Piotr Indyk

Piotr Indyk is Thomas D. and Virginia W. Cabot Professor in the Theory of Computation Group at the Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology. Provided by Wikipedia
Showing 1 - 20 results of 74 for search 'Indyk, Piotr', query time: 0.11s Refine Results
  1. 1
    Composable core-sets for determinant maximization problems via spectral spanners
    by Indyk, Piotr
    Published 2021
    Get fulltext
    Article
  2. 2
    Sketching via hashing: from heavy hitters to compressed sensing to sparse fourier transform
    by Indyk, Piotr
    Published 2014
    Other Authors: “...Indyk, Piotr...”
    Get fulltext
    Article
  3. 3
    Composable core-sets for determinant maximization: A simple near-optimal algorithm
    by Indyk, Piotr
    Published 2021
    Get fulltext
    Article
  4. 4
    Estimating entropy of distributions in constant space
    by Indyk, Piotr
    Published 2021
    Get fulltext
    Article
  5. 5
    Learning-based low-rank approximations
    by Indyk, Piotr
    Published 2021
    Get fulltext
    Article
  6. 6
    Almost-Euclidean Subspaces of ℓ1N via Tensor Products: A Simple Approach to Randomness Reduction
    by Indyk, Piotr, Szarek, Stanislaw
    Published 2012
    Other Authors: “...Indyk, Piotr...”
    Get fulltext
    Article
  7. 7
    Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)
    by Backurs, Arturs, Indyk, Piotr
    Published 2018
    Other Authors: “...Indyk, Piotr...”
    Get fulltext
    Article
  8. 8
    Compressive sensing using locality-preserving matrices
    by Grant, Elyot, Indyk, Piotr
    Published 2014
    Other Authors: “...Indyk, Piotr...”
    Get fulltext
    Article
  9. 9
    Near-optimal (euclidean) metric compression
    by Indyk, Piotr, Wagner, Tal
    Published 2018
    Other Authors: “...Indyk, Piotr...”
    Get fulltext
    Article
  10. 10
    Approximate congruence in nearly linear time
    Other Authors: “...Indyk, Piotr...”
    Get fulltext
    Article
  11. 11
    On Model-Based RIP-1 Matrices
    by Indyk, Piotr, Razenshteyn, Ilya
    Published 2014
    Other Authors: “...Indyk, Piotr...”
    Get fulltext
    Article
  12. 12
    Nearly optimal deterministic algorithm for sparse Walsh-Hadamard transform
    by Cheraghchi, Mahdi, Indyk, Piotr
    Published 2018
    Other Authors: “...Indyk, Piotr...”
    Get fulltext
    Article
  13. 13
    Sparse Recovery Using Sparse Matrices
    by Gilbert, Anna, Indyk, Piotr
    Published 2021
    Get fulltext
    Article
  14. 14
    Sample-Optimal Fourier Sampling in Any Constant Dimension
    by Indyk, Piotr, Kapralov, Mikhail
    Published 2017
    Other Authors: “...Indyk, Piotr...”
    Get fulltext
    Article
  15. 15
    Edit Distance Cannot Be Computed in Strongly Subquadratic Time (Unless SETH is False)
    by Backurs, Arturs, Indyk, Piotr
    Published 2021
    Get fulltext
    Article
  16. 16
    Which Regular Expression Patterns Are Hard to Match?
    by Backurs, Arturs, Indyk, Piotr
    Published 2017
    Other Authors: “...Indyk, Piotr...”
    Get fulltext
    Article
  17. 17
    Sequential sparse matching pursuit
    by Berinde, Radu, Indyk, Piotr
    Published 2010
    Other Authors: “...Indyk, Piotr...”
    Get fulltext
    Article
  18. 18
    Fast recovery from a union of subspaces
    by Indyk, Piotr, Schmidt, Ludwig
    Published 2021
    Get fulltext
    Article
  19. 19
    Sparse Recovery Using Sparse Matrices
    by Gilbert, Anna, Indyk, Piotr
    Published 2012
    Other Authors: “...Indyk, Piotr...”
    Get fulltext
    Article
  20. 20
    Space and time efficient kernel density estimation in high dimensions
    by Indyk, Piotr, Wagner, Tal
    Published 2021
    Get fulltext
    Article
Search Tools: Get RSS Feed — Email this Search