( en | de | ru )

 

Disambiguation of "Indyk, Piotr"

Author of the publication

copydeleteadd this publication to your clipboard
Focal plane array folding for efficient information extraction and tracking.

, , , and . AIPR, page 1-6. IEEE Computer Society, (2012)

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

K-median clustering, model-based compressive sensing, and sparse recovery for earth mover distance., and . STOC, page 627-636. ACM, (2011)Histogramming Data Streams with Fast Per-Item Processing., , , and . ICALP, volume 2380 of Lecture Notes in Computer Science, page 681-692. Springer, (2002)Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm., , , and . ICML, volume 97 of Proceedings of Machine Learning Research, page 4254-4263. PMLR, (2019)Which Regular Expression Patterns Are Hard to Match?, and . FOCS, page 457-466. IEEE Computer Society, (2016)Tight Lower Bounds for the Distinct Elements Problem., and . FOCS, page 283-288. IEEE Computer Society, (2003)Algorithmic Applications of Low-Distortion Geometric Embeddings.. FOCS, page 10-33. IEEE Computer Society, (2001)Composable Core-sets for Determinant Maximization Problems via Spectral Spanners., , , and . SODA, page 1675-1694. SIAM, (2020)Approximation-Tolerant Model-Based Compressive Sensing., , and . SODA, page 1544-1561. SIAM, (2014)Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching., , , and . SODA, page 318-337. SIAM, (2016)Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform., and . SODA, page 298-317. SIAM, (2016)