The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Piotr Indyk: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Soumen Chakrabarti, Byron Dom, Piotr Indyk
    Enhanced Hypertext Categorization Using Hyperlinks. [Citation Graph (5, 13)][DBLP]
    SIGMOD Conference, 1998, pp:307-318 [Conf]
  2. Edith Cohen, Mayur Datar, Shinji Fujiwara, Aristides Gionis, Piotr Indyk, Rajeev Motwani, Jeffrey D. Ullman, Cheng Yang
    Finding Interesting Associations without Support Pruning. [Citation Graph (2, 0)][DBLP]
    ICDE, 2000, pp:489-499 [Conf]
  3. Piotr Indyk, Rajeev Motwani
    Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. [Citation Graph (2, 0)][DBLP]
    STOC, 1998, pp:604-613 [Conf]
  4. Aristides Gionis, Piotr Indyk, Rajeev Motwani
    Similarity Search in High Dimensions via Hashing. [Citation Graph (2, 22)][DBLP]
    VLDB, 1999, pp:518-529 [Conf]
  5. Piotr Indyk, Rajeev Motwani, Prabhakar Raghavan, Santosh Vempala
    Locality-Preserving Hashing in Multidimensional Spaces. [Citation Graph (1, 0)][DBLP]
    STOC, 1997, pp:618-625 [Conf]
  6. Tibor Hegedüs, Piotr Indyk
    On Learning Disjunctions of Zero-One Treshold Functions with Queries. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:446-460 [Conf]
  7. Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos
    Embedding ultrametrics into low-dimensional spaces. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:187-196 [Conf]
  8. Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk
    Low-dimensional embedding with extra information. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:320-329 [Conf]
  9. Mayur Datar, Nicole Immorlica, Piotr Indyk, Vahab S. Mirrokni
    Locality-sensitive hashing scheme based on p-stable distributions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:253-262 [Conf]
  10. Gereon Frahling, Piotr Indyk, Christian Sohler
    Sampling in dynamic data streams and applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:142-149 [Conf]
  11. Martin Gavrilov, Piotr Indyk, Rajeev Motwani, Suresh Venkatasubramanian
    Geometric Pattern Matching: A Performance Study. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:79-85 [Conf]
  12. Sariel Har-Peled, Piotr Indyk
    When crossings count - approximating the minimum spanning tree. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:166-175 [Conf]
  13. Piotr Indyk
    Approximate nearest neighbor algorithms for Frechet distance via product metrics. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:102-106 [Conf]
  14. Piotr Indyk, Anastasios Sidiropoulos
    Probabilistic embeddings of bounded genus graphs into planar graphs. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:204-209 [Conf]
  15. Li Zhang, Harish Devarajan, Julien Basch, Piotr Indyk
    Probabilistic Analysis for Combinatorial Functions of Moving Points. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:442-444 [Conf]
  16. Leszek Gasieniec, Piotr Indyk, Piotr Krysta
    External Inverse Pattern Matching. [Citation Graph (0, 0)][DBLP]
    CPM, 1997, pp:90-101 [Conf]
  17. Bogdan S. Chlebus, Anna Gambin, Piotr Indyk
    PRAM Computations Resilient to Memory Faults. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:401-412 [Conf]
  18. Leszek Gasieniec, Piotr Indyk
    Efficient Parallel Computing with Memory Faults. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:188-197 [Conf]
  19. Arnon Amir, Alon Efrat, Piotr Indyk, Hanan Samet
    Efficient Regular Data Structures and Algorithms for Location and Proximity Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:160-170 [Conf]
  20. Martin Farach-Colton, Piotr Indyk
    Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:171-180 [Conf]
  21. Ashish Goel, Piotr Indyk
    Stochastic Load Balancing and Related Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:579-586 [Conf]
  22. Venkatesan Guruswami, Piotr Indyk
    Expander-Based Constructions of Efficiently Decodable Codes. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:658-667 [Conf]
  23. Piotr Indyk
    Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:189-197 [Conf]
  24. Piotr Indyk
    Algorithmic Applications of Low-Distortion Geometric Embeddings. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:10-33 [Conf]
  25. Piotr Indyk
    Deterministic Superimposed Coding with Applications to Pattern Matching. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:127-136 [Conf]
  26. Piotr Indyk
    On Approximate Nearest Neighbors in Non-Euclidean Spaces. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:148-155 [Conf]
  27. Piotr Indyk
    Faster Algorithms for String Matching Problems: Matching the Convolution Bound. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:166-173 [Conf]
  28. Piotr Indyk
    A Sublinear Time Approximation Scheme for Clustering in Metric Spaces. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:154-159 [Conf]
  29. Piotr Indyk, David P. Woodruff
    Tight Lower Bounds for the Distinct Elements Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:283-0 [Conf]
  30. Alexandr Andoni, Piotr Indyk
    Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:459-468 [Conf]
  31. Alexandr Andoni, Piotr Indyk, Mihai Patrascu
    On the Optimality of the Dimensionality Reduction Method. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:449-458 [Conf]
  32. Piotr Indyk
    Streaming Algorithms for Geometric Problems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2004, pp:32-34 [Conf]
  33. Mihai Badoiu, Artur Czumaj, Piotr Indyk, Christian Sohler
    Facility Location in Sublinear Time. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:866-877 [Conf]
  34. Moses Charikar, Piotr Indyk, Rina Panigrahy
    New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:451-462 [Conf]
  35. Bogdan S. Chlebus, Anna Gambin, Piotr Indyk
    Shared-Memory Simulations on a Faulty-Memory DMM. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:586-597 [Conf]
  36. Sudipto Guha, Piotr Indyk, S. Muthukrishnan, Martin Strauss
    Histogramming Data Streams with Fast Per-Item Processing. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:681-692 [Conf]
  37. Venkatesan Guruswami, Piotr Indyk
    Linear-Time List Decoding in Error-Free Settings: (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:695-707 [Conf]
  38. Piotr Indyk, Moshe Lewenstein, Ohad Lipsky, Ely Porat
    Closest Pair Problems in Very High Dimensions. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:782-792 [Conf]
  39. Graham Cormode, Piotr Indyk, Nick Koudas, S. Muthukrishnan
    Fast Mining of Massive Tabular Data via Approximate Distance Computations. [Citation Graph (0, 0)][DBLP]
    ICDE, 2002, pp:605-0 [Conf]
  40. Martin Gavrilov, Dragomir Anguelov, Piotr Indyk, Rajeev Motwani
    Mining the stock market (extended abstract): which measure is best? [Citation Graph (0, 0)][DBLP]
    KDD, 2000, pp:487-496 [Conf]
  41. Nitin Thaper, Sudipto Guha, Piotr Indyk, Nick Koudas
    Dynamic multidimensional histograms. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2002, pp:428-439 [Conf]
  42. Alexandr Andoni, Michel Deza, Anupam Gupta, Piotr Indyk, Sofya Raskhodnikova
    Lower bounds for embedding edit distance into normed spaces. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:523-526 [Conf]
  43. Alexandr Andoni, Piotr Indyk
    Efficient algorithms for substring near neighbor problem. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:1203-1212 [Conf]
  44. Mihai Badoiu, Piotr Indyk
    Fast approximate pattern matching with few indels via embeddings. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:651-652 [Conf]
  45. Yair Bartal, Moses Charikar, Piotr Indyk
    On Page Migration and Other Related Task Systems. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:43-52 [Conf]
  46. Richard Cole, Ramesh Hariharan, Piotr Indyk
    Tree Pattern Matching and Subset Matching in Deterministic O(n log3 n)-time. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:245-254 [Conf]
  47. Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev Motwani
    Maintaining stream statistics over sliding windows (extended abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:635-644 [Conf]
  48. Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian
    Pattern matching for sets of segments. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:295-304 [Conf]
  49. Lars Engebretsen, Piotr Indyk, Ryan O'Donnell
    Derandomized dimensionality reduction with applications. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:705-712 [Conf]
  50. Ashish Goel, Piotr Indyk, Kasturi R. Varadarajan
    Reductions among high dimensional proximity problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:769-778 [Conf]
  51. Venkatesan Guruswami, Piotr Indyk
    Embeddings and non-approximability of geometric problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:537-538 [Conf]
  52. Venkatesan Guruswami, Piotr Indyk
    Efficiently decodable codes meeting Gilbert-Varshamov bound for low rates. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:756-757 [Conf]
  53. Piotr Indyk
    Dimensionality reduction techniques for proximity problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:371-378 [Conf]
  54. Piotr Indyk
    Explicit constructions of selectors and related combinatorial structures, with applications. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:697-704 [Conf]
  55. Piotr Indyk
    Better algorithms for high-dimensional proximity problems via asymmetric embeddings. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:539-545 [Conf]
  56. Piotr Indyk
    Approximate Nearest Neighbor under edit distance via product metrics. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:646-650 [Conf]
  57. Piotr Indyk
    A Small Approximately min-wise Independent Family of Hash Functions. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:454-456 [Conf]
  58. Piotr Indyk, Rajeev Motwani, Suresh Venkatasubramanian
    Geometric Matching Under Noise: Combinatorial Bounds and Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:457-465 [Conf]
  59. Piotr Indyk, Suresh Venkatasubramanian
    Approximate congruence in nearly linear time. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:354-360 [Conf]
  60. Piotr Indyk
    Optimal Simulation of Automata by Neural Nets. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:337-348 [Conf]
  61. Piotr Indyk
    On Word-Level Parallelism in Fault-Tolerant Computing. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:193-204 [Conf]
  62. Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos
    Low-distortion embeddings of general metrics into the line. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:225-233 [Conf]
  63. Mihai Badoiu, Sariel Har-Peled, Piotr Indyk
    Approximate clustering via core-sets. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:250-257 [Conf]
  64. Anna C. Gilbert, Sudipto Guha, Piotr Indyk, Yannis Kotidis, S. Muthukrishnan, Martin Strauss
    Fast, small-space algorithms for approximate histogram maintenance. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:389-398 [Conf]
  65. Anna C. Gilbert, Sudipto Guha, Piotr Indyk, S. Muthukrishnan, Martin Strauss
    Near-optimal sparse fourier representations via sampling. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:152-161 [Conf]
  66. Venkatesan Guruswami, Piotr Indyk
    Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:812-821 [Conf]
  67. Venkatesan Guruswami, Piotr Indyk
    Linear time encodable and list decodable codes. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:126-135 [Conf]
  68. Piotr Indyk
    Algorithms for dynamic geometric problems over data streams. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:373-380 [Conf]
  69. Piotr Indyk
    Sublinear Time Algorithms for Metric Space Problems. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:428-434 [Conf]
  70. Piotr Indyk
    Inerpolation of Symmetric Functions and a New Type of Combinatorial Design. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:736-740 [Conf]
  71. Piotr Indyk, David P. Woodruff
    Optimal approximations of the frequency moments of data streams. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:202-208 [Conf]
  72. Piotr Indyk, David P. Woodruff
    Polylogarithmic Private Approximations and Efficient Matching. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:245-264 [Conf]
  73. Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthukrishnan
    Comparing Data Streams Using Hamming Norms (How to Zero In). [Citation Graph (0, 0)][DBLP]
    VLDB, 2002, pp:335-345 [Conf]
  74. Piotr Indyk, Nick Koudas, S. Muthukrishnan
    Identifying Representative Trends in Massive Time Series Data Sets Using Sketches. [Citation Graph (0, 0)][DBLP]
    VLDB, 2000, pp:363-372 [Conf]
  75. Taher H. Haveliwala, Aristides Gionis, Piotr Indyk
    Scalable Techniques for Clustering the Web. [Citation Graph (0, 0)][DBLP]
    WebDB (Informal Proceedings), 2000, pp:129-134 [Conf]
  76. Taher H. Haveliwala, Aristides Gionis, Dan Klein, Piotr Indyk
    Evaluating strategies for similarity search on the web. [Citation Graph (0, 0)][DBLP]
    WWW, 2002, pp:432-442 [Conf]
  77. Arnon Amir, Alon Efrat, Piotr Indyk, Hanan Samet
    Efficient Regular Data Structures and Algorithms for Dilation, Location, and Proximity Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:30, n:2, pp:164-187 [Journal]
  78. Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian
    Pattern Matching for Sets of Segments. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:40, n:3, pp:147-160 [Journal]
  79. Martin Gavrilov, Piotr Indyk, Rajeev Motwani, Suresh Venkatasubramanian
    Combinatorial and Experimental Methods for Approximate Point Pattern Matching. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:38, n:1, pp:59-90 [Journal]
  80. Piotr Indyk, Suresh Venkatasubramanian
    Approximate congruence in nearly linear time. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:24, n:2, pp:115-128 [Journal]
  81. Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian
    Pattern Matching for sets of segments [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  82. Sariel Har-Peled, Piotr Indyk
    When Crossings Count - Approximating the Minimum Spanning Tree [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  83. Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk
    Low-Dimensional Embedding with Extra Information. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:36, n:4, pp:609-632 [Journal]
  84. Piotr Indyk
    List-decoding in Linear Time [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:024, pp:- [Journal]
  85. Piotr Indyk, David P. Woodruff
    Polylogarithmic Private Approximations and Efficient Matching [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:117, pp:- [Journal]
  86. Julien Basch, Harish Devarajan, Piotr Indyk, Li Zhang
    Probabilistic Analysis for Discrete Attributes of Moving Points. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2003, v:13, n:1, pp:5-22 [Journal]
  87. Piotr Indyk
    Stable distributions, pseudorandom generators, embeddings, and data stream computation. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2006, v:53, n:3, pp:307-323 [Journal]
  88. Piotr Indyk
    A Small Approximately Min-Wise Independent Family of Hash Functions. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:38, n:1, pp:84-90 [Journal]
  89. Piotr Indyk
    On Approximate Nearest Neighbors under linfinity Norm. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:63, n:4, pp:627-638 [Journal]
  90. Donald Aingworth, Chandra Chekuri, Piotr Indyk, Rajeev Motwani
    Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication). [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:4, pp:1167-1181 [Journal]
  91. Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev Motwani
    Maintaining Stream Statistics over Sliding Windows. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:6, pp:1794-1813 [Journal]
  92. Yair Bartal, Moses Charikar, Piotr Indyk
    On page migration and other relaxed task systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:268, n:1, pp:43-66 [Journal]
  93. Venkatesan Guruswami, Piotr Indyk
    Linear-time encodable/decodable codes with near-optimal rate. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:10, pp:3393-3400 [Journal]
  94. Edith Cohen, Mayur Datar, Shinji Fujiwara, Aristides Gionis, Piotr Indyk, Rajeev Motwani, Jeffrey D. Ullman, Cheng Yang
    Finding Interesting Associations without Support Pruning. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Knowl. Data Eng., 2001, v:13, n:1, pp:64-78 [Journal]
  95. Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthukrishnan
    Comparing Data Streams Using Hamming Norms (How to Zero In). [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Knowl. Data Eng., 2003, v:15, n:3, pp:529-540 [Journal]
  96. Sudipto Guha, Piotr Indyk, Andrew McGregor
    Sketching Information Divergences. [Citation Graph (0, 0)][DBLP]
    COLT, 2007, pp:424-438 [Conf]
  97. Piotr Indyk
    A near linear time constant factor approximation for Euclidean bichromatic matching (cost). [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:39-42 [Conf]
  98. Mihai Badoiu, Piotr Indyk, Anastasios Sidiropoulos
    Approximation algorithms for embedding general metrics into trees. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:512-521 [Conf]
  99. Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat
    Efficient Computations of l1 and linfinity Rearrangement Distances. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2007, pp:39-49 [Conf]
  100. Piotr Indyk
    Uncertainty principles, extractors, and explicit embeddings of l2 into l1. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:615-620 [Conf]
  101. Piotr Indyk, Assaf Naor
    Nearest-neighbor-preserving embeddings. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:3, pp:- [Journal]

  102. Almost-Euclidean Subspaces of l1N\ell_1^N via Tensor Products: A Simple Approach to Randomness Reduction. [Citation Graph (, )][DBLP]


  103. Online Embeddings. [Citation Graph (, )][DBLP]


  104. Near-Optimal Sparse Recovery in the L1 Norm. [Citation Graph (, )][DBLP]


  105. Efficient Sketches for Earth-Mover Distance, with Applications. [Citation Graph (, )][DBLP]


  106. External Sampling. [Citation Graph (, )][DBLP]


  107. Sparse Recovery Using Sparse Random Matrices. [Citation Graph (, )][DBLP]


  108. Space-optimal heavy hitters with strong error bounds. [Citation Graph (, )][DBLP]


  109. Earth mover distance over high-dimensional spaces. [Citation Graph (, )][DBLP]


  110. Declaring independence via the sketching of sketches. [Citation Graph (, )][DBLP]


  111. Explicit constructions for compressed sensing of sparse signals. [Citation Graph (, )][DBLP]


  112. Approximate line nearest neighbor in high dimensions. [Citation Graph (, )][DBLP]


  113. Overcoming the l1 non-embeddability barrier: algorithms for product metrics. [Citation Graph (, )][DBLP]


  114. Lower Bounds for Sparse Recovery. [Citation Graph (, )][DBLP]


  115. Efficiently Decodable Non-adaptive Group Testing. [Citation Graph (, )][DBLP]


  116. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. [Citation Graph (, )][DBLP]


  117. Combining geometry and combinatorics: A unified approach to sparse signal recovery [Citation Graph (, )][DBLP]


  118. A simple construction of almost-Euclidean subspaces of $\ell_1^N$ via tensor products [Citation Graph (, )][DBLP]


  119. Earth Mover Distance over High-Dimensional Spaces. [Citation Graph (, )][DBLP]


  120. Uncertainty Principles, Extractors, and Explicit Embeddings of L2 into L1. [Citation Graph (, )][DBLP]


Search in 0.807secs, Finished in 0.814secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002