( en | de | ru )

 

Disambiguation of "Indyk, Piotr"

Author of the publication

copydeleteadd this publication to your clipboard
Scalable Techniques for Clustering the Web.

, , and . WebDB (Informal Proceedings), page 129-134. (2000)

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.

Sven Piotrowiak

Katja Piotrowski

Heinz Piotrowski

Berthold Piotrowski

Jens Piotraschke

 

Other publications of authors with the same name

Approximation Algorithms for Model-Based Compressive Sensing., , and . CoRR, (2014)Evaluating strategies for similarity search on the web., , , and . WWW, page 432-442. ACM, (2002)Beyond P vs. NP: Quadratic-Time Hardness for Big Data Problems.. SPAA, page 1. ACM, (2017)Low-Distortion Embeddings of Finite Metric Spaces., and . Handbook of Discrete and Computational Geometry, 2nd Ed., Chapman and Hall/CRC, (2004)Approximate Nearest Neighbors in Limited Space., and . COLT, volume 75 of Proceedings of Machine Learning Research, page 2012-2036. PMLR, (2018)On Word-Level Parallelism in Fault-Tolerant Computing.. STACS, volume 1046 of Lecture Notes in Computer Science, page 193-204. Springer, (1996)Sample-Optimal Low-Rank Approximation of Distance Matrices., , , and . COLT, volume 99 of Proceedings of Machine Learning Research, page 1723-1751. PMLR, (2019)Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model., and . PODS, page 200-217. ACM, (2019)Real-time recommendation of diverse related articles., , , and . WWW, page 1-12. International World Wide Web Conferences Steering Committee / ACM, (2013)Geometric Matching Under Noise: Combinatorial Bounds and Algorithms., , and . SODA, page 457-465. ACM/SIAM, (1999)