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 95 for search 'Indyk, Piotr', query time: 0.04s Refine Results
  1. 1
    Composable core-sets for determinant maximization problems via spectral spanners

    Composable core-sets for determinant maximization problems via spectral spanners by Indyk, Piotr

    Published 2021
    Get full text
    Article
  2. 2
    Learning-based low-rank approximations

    Learning-based low-rank approximations by Indyk, Piotr

    Published 2021
    Get full text
    Article
  3. 3
    Composable core-sets for determinant maximization: A simple near-optimal algorithm

    Composable core-sets for determinant maximization: A simple near-optimal algorithm by Indyk, Piotr

    Published 2021
    Get full text
    Article
  4. 4
    Estimating entropy of distributions in constant space

    Estimating entropy of distributions in constant space by Indyk, Piotr

    Published 2021
    Get full text
    Article
  5. 5
    Sketching via hashing: from heavy hitters to compressed sensing to sparse fourier transform

    Sketching via hashing: from heavy hitters to compressed sensing to sparse fourier transform by Indyk, Piotr

    Published 2014
    Get full text
    Get full text
    Article
  6. 6
    Which Regular Expression Patterns Are Hard to Match?

    Which Regular Expression Patterns Are Hard to Match? by Backurs, Arturs, Indyk, Piotr

    Published 2017
    Get full text
    Get full text
    Get full text
    Article
  7. 7
    Sample-Optimal Fourier Sampling in Any Constant Dimension

    Sample-Optimal Fourier Sampling in Any Constant Dimension by Indyk, Piotr, Kapralov, Mikhail

    Published 2017
    Get full text
    Get full text
    Article
  8. 8
    Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)

    Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false) by Backurs, Arturs, Indyk, Piotr

    Published 2018
    Get full text
    Get full text
    Get full text
    Article
  9. 9
    Nearly optimal deterministic algorithm for sparse Walsh-Hadamard transform

    Nearly optimal deterministic algorithm for sparse Walsh-Hadamard transform by Cheraghchi, Mahdi, Indyk, Piotr

    Published 2018
    Get full text
    Get full text
    Article
  10. 10
    Near-optimal (euclidean) metric compression

    Near-optimal (euclidean) metric compression by Indyk, Piotr, Wagner, Tal

    Published 2018
    Get full text
    Get full text
    Get full text
    Article
  11. 11
    Space and time efficient kernel density estimation in high dimensions

    Space and time efficient kernel density estimation in high dimensions by Indyk, Piotr, Wagner, Tal

    Published 2021
    Get full text
    Article
  12. 12
    Edit Distance Cannot Be Computed in Strongly Subquadratic Time (Unless SETH is False)

    Edit Distance Cannot Be Computed in Strongly Subquadratic Time (Unless SETH is False) by Backurs, Arturs, Indyk, Piotr

    Published 2021
    Get full text
    Article
  13. 13
    Fast recovery from a union of subspaces

    Fast recovery from a union of subspaces by Indyk, Piotr, Schmidt, Ludwig

    Published 2021
    Get full text
    Article
  14. 14
    Sparse Recovery Using Sparse Matrices

    Sparse Recovery Using Sparse Matrices by Gilbert, Anna, Indyk, Piotr

    Published 2021
    Get full text
    Article
  15. 15
    Optimal Approximations of the Frequency Moments

    Optimal Approximations of the Frequency Moments by Indyk, Piotr, Woodruff, David

    Published 2005
    Get full text
  16. 16
    New LSH-based Algorithm for Approximate Nearest Neighbor

    New LSH-based Algorithm for Approximate Nearest Neighbor by Andoni, Alexandr, Indyk, Piotr

    Published 2005
    Get full text
  17. 17
    Sparse recovery using sparse matrices

    Sparse recovery using sparse matrices by Berinde, Radu, Indyk, Piotr

    Published 2008
    Get full text
  18. 18
    6.895 / 6.095J Computational Biology: Genomes, Networks, Evolution, Fall 2005

    6.895 / 6.095J Computational Biology: Genomes, Networks, Evolution, Fall 2005 by Kellis, Manolis, Indyk, Piotr

    Published 2005
    Get full text
  19. 19
    Sequential sparse matching pursuit

    Sequential sparse matching pursuit by Berinde, Radu, Indyk, Piotr

    Published 2010
    Get full text
    Get full text
    Article
  20. 20
    Optimal Approximations of the Frequency Moments

    Optimal Approximations of the Frequency Moments by Indyk, Piotr, Woodruff, David

    Published 2004
    Get full text

Search Tools: