Communication complexity of computing the Hamming distance
SIAM Journal on Computing
Efficient Replicated Remote File Comparison
IEEE Transactions on Computers
Interactive communication: balanced distributions, correlated files, and average-case complexity
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Communication complexity
Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Efficient search for approximate nearest neighbor in high dimensional spaces
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A Class of Randomized Strategies for Low-Cost Comparison of File Copies
IEEE Transactions on Parallel and Distributed Systems
An Optimal Strategy for Comparing File Copies
IEEE Transactions on Parallel and Distributed Systems
Static Dictionaries on RAMs: Query Time is Necessary and Sufficient
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Efficient approximate and dynamic matching of patterns using a labeling paradigm
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Approximate nearest neighbors and sequence comparison with block operations
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Approximate nearest neighbor algorithms for Frechet distance via product metrics
Proceedings of the eighteenth annual symposium on Computational geometry
The string edit distance matching problem with moves
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Lower bounds for embedding edit distance into normed spaces
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Secure Multiparty Computation of Approximations
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Text Sparsification via Local Maxima
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Simple and Practical Sequence Nearest Neighbors with Block Operations
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
A sublinear algorithm for weakly approximating edit distance
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Text sparsification via local maxima
Theoretical Computer Science
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Approximate Nearest Neighbor under edit distance via product metrics
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Low distortion embeddings for edit distance
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Correcting errors without leaking partial information
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Hierarchical substring caching for efficient content distribution to low-bandwidth clients
WWW '05 Proceedings of the 14th international conference on World Wide Web
Server-friendly delta compression for efficient web access
Web content caching and distribution
DeltaCast: efficient file reconciliation in wireless broadcast systems
Proceedings of the 3rd international conference on Mobile systems, applications, and services
Algorithmic Clustering of Music Based on String Compression
Computer Music Journal
Secure multiparty computation of approximations
ACM Transactions on Algorithms (TALG)
Data streams: algorithms and applications
Foundations and Trends® in Theoretical Computer Science
Bandwidth Efficient String Reconciliation Using Puzzles
IEEE Transactions on Parallel and Distributed Systems
The string edit distance matching problem with moves
ACM Transactions on Algorithms (TALG)
Edit distance with move operations
Journal of Discrete Algorithms
Individual communication complexity
Journal of Computer and System Sciences
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Distance measures for biological sequences: Some recent approaches
International Journal of Approximate Reasoning
Approximating edit distance in near-linear time
Proceedings of the forty-first annual ACM symposium on Theory of computing
The Computational Hardness of Estimating Edit Distance
SIAM Journal on Computing
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Efficient error estimating coding: feasibility and applications
IEEE/ACM Transactions on Networking (TON)
Improved sketching of hamming distance with error correcting
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Efficient communication protocols for deciding edit distance
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Homomorphic fingerprints under misalignments: sketching edit and shift distances
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |