I agree that this site is using cookies. You can find further informations here.
X
Indyk, Piotr
32  results:
Articles (Online) X
Search for persons X
?
1

Optimal (Euclidean) Metric Compression:

Indyk, Piotr ; Wagner, Tal
SIAM Journal on Computing.  51 (2022)  3 - p. 467-491 , 2022
Link: https://doi.org/10.1137/..
 
?
2

Approximation Algorithms for Low-Distortion Embeddings into..:

Sidiropoulos, Anastasios ; Badoiu, Mihai ; Dhamdhere, Kedar...
SIAM Journal on Discrete Mathematics.  33 (2019)  1 - p. 454-473 , 2019
Link: https://doi.org/10.1137/..
 
?
3

Edit Distance Cannot Be Computed in Strongly Subquadratic T..:

Backurs, Arturs ; Indyk, Piotr
SIAM Journal on Computing.  47 (2018)  3 - p. 1087-1097 , 2018
Link: https://doi.org/10.1137/..
 
?
4

Nearly Optimal Deterministic Algorithm for Sparse Walsh-Had..:

Cheraghchi, Mahdi ; Indyk, Piotr
ACM Transactions on Algorithms.  13 (2017)  3 - p. 1-36 , 2017
Link: https://doi.org/10.1145/..
 
?
5

Nearly Optimal Deterministic Algorithm for Sparse Walsh-Had..:

Cheraghchi, Mahdi ; Indyk, Piotr
ACM Transactions on Algorithms (TALG).  13 (2017)  3 - p. 1-36 , 2017
Link: https://dl.acm.org/doi/1..
 
?
6

Rapid sampling for visualizations with ordering guarantees:

Kim, Albert ; Blais, Eric ; Parameswaran, Aditya...
Proceedings of the VLDB Endowment.  8 (2015)  5 - p. 521-532 , 2015
Link: https://doi.org/10.14778..
 
?
7

Rapid sampling for visualizations with ordering guarantees:

Kim, Albert ; Blais, Eric ; Parameswaran, Aditya...
Proceedings of the VLDB Endowment.  8 (2015)  5 - p. 521-532 , 2015
Link: https://dl.acm.org/doi/1..
 
?
8

Streaming similarity search over one billion tweets using p..:

Sundaram, Narayanan ; Turmukhametova, Aizana ; Satish, Nadathur...
Proceedings of the VLDB Endowment.  6 (2013)  14 - p. 1930-1941 , 2013
Link: https://doi.org/10.14778..
 
?
9

Streaming similarity search over one billion tweets using p..:

Sundaram, Narayanan ; Turmukhametova, Aizana ; Satish, Nadathur...
Proceedings of the VLDB Endowment.  6 (2013)  14 - p. 1930-1941 , 2013
Link: https://dl.acm.org/doi/1..
 
?
10

Efficient and reliable low-power backscatter networks:

Wang, Jue ; Hassanieh, Haitham ; Katabi, Dina.
ACM SIGCOMM Computer Communication Review.  42 (2012)  4 - p. 61-72 , 2012
Link: https://dl.acm.org/doi/1..
 
?
11

Efficient and reliable low-power backscatter networks:

Wang, Jue ; Hassanieh, Haitham ; Katabi, Dina.
ACM SIGCOMM Computer Communication Review.  42 (2012)  4 - p. 61-72 , 2012
Link: https://doi.org/10.1145/..
 
?
12

Motif discovery in physiological datasets: A methodology fo..:

Syed, Zeeshan ; Stultz, Collin ; Kellis, Manolis..
ACM Transactions on Knowledge Discovery from Data.  4 (2010)  1 - p. 1-23 , 2010
Link: https://doi.org/10.1145/..
 
?
13

Space-optimal heavy hitters with strong error bounds:

Berinde, Radu ; Indyk, Piotr ; Cormode, Graham.
ACM Transactions on Database Systems.  35 (2010)  4 - p. 1-28 , 2010
Link: https://doi.org/10.1145/..
 
?
14

Space-optimal heavy hitters with strong error bounds:

Berinde, Radu ; Indyk, Piotr ; Cormode, Graham.
ACM Transactions on Database Systems (TODS).  35 (2010)  4 - p. 1-28 , 2010
Link: https://dl.acm.org/doi/1..
 
?
15

Motif discovery in physiological datasets : A methodolog..:

Syed, Zeeshan ; Stultz, Collin ; Kellis, Manolis..
ACM Transactions on Knowledge Discovery from Data (TKDD).  4 (2010)  1 - p. 1-23 , 2010
Link: https://dl.acm.org/doi/1..
 
1-15