Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
SIAM Journal on Computing
Approximate nearest neighbors and sequence comparison with block operations
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Approximation algorithms for the metric labeling problem via a new linear programming formulation
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The Earth Mover's Distance as a Metric for Image Retrieval
International Journal of Computer Vision
Similarity estimation techniques from rounding algorithms
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
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
A sublinear algorithm for weakly approximating edit distance
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Approximate Nearest Neighbor under edit distance via product metrics
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate classification via earthmover metrics
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating Edit Distance Efficiently
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Low distortion embeddings for edit distance
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Oblivious string embeddings and edit distance approximations
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Improved lower bounds for embeddings into L1
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On the fourier tails of bounded functions over the discrete cube
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On earthmover distance, metric labeling, and 0-extension
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Estimating the sortedness of a data stream
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Low distortion embeddings for edit distance
Journal of the ACM (JACM)
Overcoming the l1 non-embeddability barrier: algorithms for product metrics
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Approximating edit distance in near-linear time
Proceedings of the forty-first annual ACM symposium on Theory of computing
Hard metrics from Cayley graphs of Abelian groups
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
The Euclidean distortion of flat tori
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Approximating tree edit distance through string edit distance
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
NNS lower bounds via metric expansion for l
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Moving heaven and earth: distances between distributions
ACM SIGACT News
| Hi-index | 0.00 |
Various new nonembeddability results (mainly into L1) are proved via Fourier analysis. In particular, it is shown that the Edit Distance on {0,1}^d has L1 distortion (\log d)^frac{1}{2}^{} - (1). We also give new lower bounds on the L1 distortion of quotients of the discrete hypercube under group actions, and the transportation cost (Earthmover) metric.