Piotr Indyk

From MaRDI portal
Person:732030

Available identifiers

zbMath Open indyk.piotrWikidataQ7196952 ScholiaQ7196952MaRDI QIDQ732030

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61262972024-04-09Paper
Efficient parallel computing with memory faults2022-12-09Paper
Optimal (Euclidean) Metric Compression2022-05-31Paper
Fractional Set Cover in the Streaming Model.2021-07-28Paper
https://portal.mardi4nfdi.de/entity/Q50027562021-07-28Paper
Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering2021-07-05Paper
Composable Core-sets for Determinant Maximization Problems via Spectral Spanners2021-02-02Paper
APPROXIMATE NEAREST NEIGHBOR SEARCH IN HIGH DIMENSIONS2020-09-22Paper
https://portal.mardi4nfdi.de/entity/Q49672002019-07-03Paper
(Nearly) Sample-Optimal Sparse Fourier Transform2019-06-20Paper
Approximation-Tolerant Model-Based Compressive Sensing2019-06-20Paper
Shift Finding in Sub-linear Time2019-05-15Paper
Euclidean Spanners in High Dimensions2019-05-15Paper
https://portal.mardi4nfdi.de/entity/Q57434682019-05-10Paper
https://portal.mardi4nfdi.de/entity/Q46338992019-05-06Paper
Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces2019-03-12Paper
Approximate nearest neighbor algorithms for Frechet distance via product metrics2018-11-23Paper
Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform2018-11-05Paper
Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform2018-07-16Paper
Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching2018-07-16Paper
Near-Optimal (Euclidean) Metric Compression2018-07-16Paper
Better Approximations for Tree Sparsity in Nearly-Linear Time2018-07-16Paper
Edit Distance Cannot Be Computed in Strongly Subquadratic Time (Unless SETH is False)2018-07-04Paper
Better embeddings for planar Earth-Mover Distance over sparse sets2018-04-23Paper
https://portal.mardi4nfdi.de/entity/Q46080532018-03-15Paper
https://portal.mardi4nfdi.de/entity/Q31328792018-01-30Paper
Optimal simulation of automata by neural nets2017-12-04Paper
On word-level parallelism in fault-tolerant computing2017-11-16Paper
Sampling in dynamic data streams and applications2017-10-20Paper
When crossings count — approximating the minimum spanning tree2017-09-29Paper
Locality-sensitive hashing scheme based on p-stable distributions2017-09-29Paper
Low-dimensional embedding with extra information2017-09-29Paper
Approximation Algorithms for Model-Based Compressive Sensing2017-04-28Paper
Sublinear time algorithms for metric space problems2016-09-29Paper
Interpolation of symmetric functions and a new type of combinatorial design2016-09-29Paper
Stable distributions, pseudorandom generators, embeddings, and data stream computation2015-12-04Paper
Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)2015-08-21Paper
https://portal.mardi4nfdi.de/entity/Q55017812015-08-14Paper
https://portal.mardi4nfdi.de/entity/Q55013212015-08-03Paper
https://portal.mardi4nfdi.de/entity/Q55013352015-08-03Paper
https://portal.mardi4nfdi.de/entity/Q55013202015-08-03Paper
Diverse near neighbor problem2015-02-17Paper
Compressive sensing using locality-preserving matrices2015-02-17Paper
https://portal.mardi4nfdi.de/entity/Q29345802014-12-18Paper
https://portal.mardi4nfdi.de/entity/Q29346332014-12-18Paper
On the Power of Adaptivity in Sparse Recovery2014-07-30Paper
Efficient Sketches for Earth-Mover Distance, with Applications2014-07-25Paper
Nearly Linear-Time Model-Based Compressive Sensing2014-07-01Paper
K-median clustering, model-based compressive sensing, and sparse recovery for earth mover distance2014-06-05Paper
https://portal.mardi4nfdi.de/entity/Q54176952014-05-22Paper
Lower Bounds for Sparse Recovery2014-05-22Paper
Nearly optimal sparse fourier transform2014-05-13Paper
Compressive sensing with local geometric features2014-03-24Paper
On Model-Based RIP-1 Matrices2013-08-06Paper
https://portal.mardi4nfdi.de/entity/Q29138142012-09-27Paper
https://portal.mardi4nfdi.de/entity/Q28809542012-04-17Paper
Sparse Recovery with Partial Support Knowledge2011-08-17Paper
Sublinear Algorithms in the External Memory Model2010-10-12Paper
Online Embeddings2010-09-10Paper
Almost-Euclidean Subspaces of $\ell_1^N$ via Tensor Products: A Simple Approach to Randomness Reduction2010-09-10Paper
Linear time encodable and list decodable codes2010-08-16Paper
Low-distortion embeddings of general metrics into the line2010-08-16Paper
Optimal approximations of the frequency moments of data streams2010-08-16Paper
Efficient algorithms for substring near neighbor problem2010-08-16Paper
Algorithms for dynamic geometric problems over data streams2010-08-15Paper
Nearest-neighbor-preserving embeddings2010-08-14Paper
https://portal.mardi4nfdi.de/entity/Q35793982010-08-06Paper
https://portal.mardi4nfdi.de/entity/Q35794072010-08-06Paper
https://portal.mardi4nfdi.de/entity/Q35794642010-08-06Paper
Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets2010-08-05Paper
Approximate clustering via core-sets2010-08-05Paper
Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances2009-10-09Paper
External Sampling2009-07-14Paper
Sketching information divergences2009-03-31Paper
https://portal.mardi4nfdi.de/entity/Q36028752009-02-12Paper
https://portal.mardi4nfdi.de/entity/Q36015392009-02-10Paper
https://portal.mardi4nfdi.de/entity/Q35496632009-01-05Paper
Linear-Time Encodable/Decodable Codes With Near-Optimal Rate2008-12-21Paper
SAMPLING IN DYNAMIC DATA STREAMS AND APPLICATIONS2008-08-26Paper
Sketching Information Divergences2008-01-03Paper
Theory of Cryptography2007-02-12Paper
Low-dimensional embedding with extra information2006-12-06Paper
Automata, Languages and Programming2006-01-10Paper
Automata, Languages and Programming2005-08-24Paper
Automata, Languages and Programming2005-08-24Paper
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science2005-08-12Paper
Pattern matching for sets of segments2005-02-11Paper
Combinatorial and experimental methods for approximate point pattern matching2004-12-02Paper
https://portal.mardi4nfdi.de/entity/Q48289952004-11-29Paper
https://portal.mardi4nfdi.de/entity/Q48290042004-11-29Paper
https://portal.mardi4nfdi.de/entity/Q48290052004-11-29Paper
PROBABILISTIC ANALYSIS FOR DISCRETE ATTRIBUTES OF MOVING POINTS2004-09-29Paper
https://portal.mardi4nfdi.de/entity/Q48188682004-09-24Paper
https://portal.mardi4nfdi.de/entity/Q47371792004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44713392004-07-28Paper
https://portal.mardi4nfdi.de/entity/Q44713412004-07-28Paper
https://portal.mardi4nfdi.de/entity/Q44713422004-07-28Paper
Approximate congruence in nearly linear time2003-04-28Paper
Maintaining Stream Statistics over Sliding Windows2003-01-05Paper
https://portal.mardi4nfdi.de/entity/Q45425832002-08-01Paper
On approximate nearest neighbors under \(l_\infty\) norm2002-07-04Paper
https://portal.mardi4nfdi.de/entity/Q27683792002-03-24Paper
On page migration and other relaxed task systems2002-03-03Paper
https://portal.mardi4nfdi.de/entity/Q27683082002-01-30Paper
A Small Approximately Min-Wise Independent Family of Hash Functions2001-04-17Paper
https://portal.mardi4nfdi.de/entity/Q45270292001-02-28Paper
https://portal.mardi4nfdi.de/entity/Q49526402001-02-02Paper
https://portal.mardi4nfdi.de/entity/Q42522942000-06-21Paper
https://portal.mardi4nfdi.de/entity/Q49526382000-05-10Paper
https://portal.mardi4nfdi.de/entity/Q42523212000-04-25Paper
Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)1999-10-28Paper
https://portal.mardi4nfdi.de/entity/Q42523201999-06-17Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Piotr Indyk