The following pages link to Piotr Indyk (Q732030):
Displaying 50 items.
- (Q236650) (redirect page) (← links)
- Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances (Q732031) (← links)
- Low-dimensional embedding with extra information (Q854713) (← links)
- Sketching information divergences (Q1009269) (← links)
- On approximate nearest neighbors under \(l_\infty\) norm (Q1604212) (← links)
- Pattern matching for sets of segments (Q1762985) (← links)
- Approximate congruence in nearly linear time (Q1869745) (← links)
- Combinatorial and experimental methods for approximate point pattern matching (Q1889585) (← links)
- A Small Approximately Min-Wise Independent Family of Hash Functions (Q2709793) (← links)
- (Q2768308) (← links)
- (Q2768379) (← links)
- Sublinear time algorithms for metric space problems (Q2819576) (← links)
- Interpolation of symmetric functions and a new type of combinatorial design (Q2819603) (← links)
- (Q2880954) (← links)
- (Q2913814) (← links)
- (Q2934580) (← links)
- (Q2934633) (← links)
- Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false) (Q2941488) (← links)
- Approximation Algorithms for Model-Based Compressive Sensing (Q2977311) (← links)
- Sparse Recovery with Partial Support Knowledge (Q3088079) (← links)
- Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces (Q3119488) (← links)
- (Q3132879) (← links)
- Stable distributions, pseudorandom generators, embeddings, and data stream computation (Q3455212) (← links)
- SAMPLING IN DYNAMIC DATA STREAMS AND APPLICATIONS (Q3521590) (← links)
- Linear-Time Encodable/Decodable Codes With Near-Optimal Rate (Q3546963) (← links)
- (Q3549663) (← links)
- Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets (Q3579197) (← links)
- Approximate clustering via core-sets (Q3579227) (← links)
- (Q3579398) (← links)
- (Q3579407) (← links)
- (Q3579464) (← links)
- Nearest-neighbor-preserving embeddings (Q3580943) (← links)
- Algorithms for dynamic geometric problems over data streams (Q3580982) (← links)
- Linear time encodable and list decodable codes (Q3581290) (← links)
- Low-distortion embeddings of general metrics into the line (Q3581393) (← links)
- Optimal approximations of the frequency moments of data streams (Q3581423) (← links)
- Efficient algorithms for substring near neighbor problem (Q3581521) (← links)
- Online Embeddings (Q3588411) (← links)
- Almost-Euclidean Subspaces of $\ell_1^N$ via Tensor Products: A Simple Approach to Randomness Reduction (Q3588440) (← links)
- (Q3601539) (← links)
- (Q3602875) (← links)
- External Sampling (Q3638025) (← links)
- (Q4252294) (← links)
- (Q4252320) (← links)
- (Q4252321) (← links)
- Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication) (Q4268701) (← links)
- (Q4471339) (← links)
- (Q4471341) (← links)
- (Q4471342) (← links)
- (Q4527029) (← links)
