( en | de | ru )

 

Disambiguation of "Indyk, Piotr"

Author of the publication

copydeleteadd this publication to your clipboard
Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false).

, and . CoRR, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Katja Piotrowski

Sven Piotrowiak

Heinz Piotrowski

Berthold Piotrowski

Jens Piotraschke

 

Other publications of authors with the same name

Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)., and . STOC, page 51-58. ACM, (2015)Inerpolation of Symmetric Functions and a New Type of Combinatorial Design.. STOC, page 736-740. ACM, (1999)Which Regular Expression Patterns are Hard to Match?, and . CoRR, (2015)Polylogarithmic Private Approximations and Efficient Matching., and . TCC, volume 3876 of Lecture Notes in Computer Science, page 245-264. Springer, (2006)A Nearly-Linear Time Framework for Graph-Structured Sparsity., , and . ICML, volume 37 of JMLR Workshop and Conference Proceedings, page 928-937. JMLR.org, (2015)Efficient Computations of l1 and linfinity Rearrangement Distances., , , , and . SPIRE, volume 4726 of Lecture Notes in Computer Science, page 39-49. Springer, (2007)Seismic feature extraction using steiner tree methods., , , , , and . ICASSP, page 1647-1651. IEEE, (2015)When Crossings Count - Approximating the Minimum Spanning Tree, and . CoRR, (2003)Nearest Neighbors In High-Dimensional Spaces. Handbook of Discrete and Computational Geometry, CRC Press LLC, Boca Raton, FL, 2nd edition, (April 2004)Approximate Nearest Neighbor under edit distance via product metrics.. SODA, page 646-650. SIAM, (2004)