An algorithm for approximate membership checking with application to password security
U Manber, S Wu - Information Processing Letters, 1994 - Elsevier
Abstract Given a large set of words W, we want to be able to determine quickly whether a
query word q is close to any word in the set. A new data structure is presented that allows
such queries to be answered very quickly even for huge sets if the words are not too long ...
query word q is close to any word in the set. A new data structure is presented that allows
such queries to be answered very quickly even for huge sets if the words are not too long ...
Cited by 76 Related articles Cite SaveSaving...Error saving. Try again? More EBSCOhost Full Text Fewer
[CITATION][C] An algorithm for approximate membership checking with application to password security
U Manber, S Wu - Information Processing Letters, 1994 - dl.acm.org
Google, Inc. (search). ...
[PDF][PDF] An Algorithm for Approximate Membership Checking With Application to Password Security
U Manber, S Wu - 1992 - Citeseer
Abstract Given a large set of words W, we want to be able to determine quickly whether a
query word q is close to any word in the set. A new data structure is presented that allows
such queries to be answered very quickly even for huge sets if the words are not too long ...
query word q is close to any word in the set. A new data structure is presented that allows
such queries to be answered very quickly even for huge sets if the words are not too long ...
[PDF][PDF] An Algorithm for Approximate Membership Checking With Application to Password Security
U Manber, S Wu - 1992 - webglimpse.net
Abstract Given a large set of words W, we want to be able to determine quickly whether a
query word q is close to any word in the set. A new data structure is presented that allows
such queries to be answered very quickly even for huge sets if the words are not too long ...
query word q is close to any word in the set. A new data structure is presented that allows
such queries to be answered very quickly even for huge sets if the words are not too long ...
[PDF][PDF] An Algorithm for Approximate Membership Checking With Application to Password Security
U Manber, S Wu - 1992 - pdfs.semanticscholar.org
Abstract Given a large set of words W, we want to be able to determine quickly whether a
query word q is close to any word in the set. A new data structure is presented that allows
such queries to be answered very quickly even for huge sets if the words are not too long ...
query word q is close to any word in the set. A new data structure is presented that allows
such queries to be answered very quickly even for huge sets if the words are not too long ...
An algorithm for approximate membership checking with application to password security
U MANBER, WU SUN - Information processing letters, 1994 - cat.inist.fr
Résumé/Abstract Given a large set of words W, we want to be able to determine quickly
whether a query word q is close to any word in the set. A new data structure is presented that
allows such queries to be answered very quickly even for huge sets if the words are not ...
whether a query word q is close to any word in the set. A new data structure is presented that
allows such queries to be answered very quickly even for huge sets if the words are not ...
[PDF][PDF] An Algorithm for Approximate Membership Checking With Application to Password Security
U Manber, S Wu - 1992 - Citeseer
Abstract Given a large set of words W, we want to be able to determine quickly whether a
query word q is close to any word in the set. A new data structure is presented that allows
such queries to be answered very quickly even for huge sets if the words are not too long ...
query word q is close to any word in the set. A new data structure is presented that allows
such queries to be answered very quickly even for huge sets if the words are not too long ...
[PDF][PDF] An Algorithm for Approximate Membership Checking With Application to Password Security
U Manber, S Wu - 1992 - webglimpse.net
Abstract Given a large set of words W, we want to be able to determine quickly whether a
query word q is close to any word in the set. A new data structure is presented that allows
such queries to be answered very quickly even for huge sets if the words are not too long ...
query word q is close to any word in the set. A new data structure is presented that allows
such queries to be answered very quickly even for huge sets if the words are not too long ...
