Qin Zhang

CoRR, 2020

Overlap detection on long, error-prone sequencing reads via smooth q-gram.

[BibT_eX]

[DOI]

Bioinform., 2020

Correction to: Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks.

[BibT_eX]

[DOI]

Zengfeng Huang

Algorithmica, 2020

Batched Coarse Ranking in Multi-Armed Bandits.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

MinSearch: An Efficient Algorithm for Similarity Search under Edit Distance.

[BibT_eX]

[DOI]

Proceedings of the KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2020

Multinomial Logit Bandit with Low Switching Cost.

[BibT_eX]

[DOI]

Proceedings of the 37th International Conference on Machine Learning, 2020

Collaborative Top Distribution Identifications with Limited Interaction (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

A Multi-criteria Approximation Algorithm for Influence Maximization with Probabilistic Guarantees.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020

2019

Distributed Partial Clustering.

[BibT_eX]

[DOI]

Sudipto Guha

Yi Li

ACM Trans. Parallel Comput., 2019

Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks.

[BibT_eX]

[DOI]

Zengfeng Huang

Algorithmica, 2019

Distributed and Streaming Linear Programming in Low Dimensions.

[BibT_eX]

[DOI]

Sepehr Assadi

Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

MinJoin: Efficient Edit Similarity Joins via Local Hash Minima.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019

Collaborative Learning with Limited Interaction: Tight Bounds for Distributed Exploration in Multi-armed Bandits.

[BibT_eX]

[DOI]

Chao Tao

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018

Memory-Efficient and Ultra-Fast Network Lookup and Forwarding Using Othello Hashing.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2018

Editorial: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2016 Special Issue.

[BibT_eX]

[DOI]

Aravindan Vijayaraghavan

ACM Trans. Algorithms, 2018

MinJoin: Efficient Edit Similarity Joins via Local Hash Minimums.

[BibT_eX]

[DOI]

CoRR, 2018

Distributed Statistical Estimation of Matrix Products with Applications.

[BibT_eX]

[DOI]

Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2018

Distinct Sampling on Streaming Data with Near-Duplicates.

[BibT_eX]

[DOI]

Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2018

A Practical Algorithm for Distributed Clustering and Outlier Detection.

[BibT_eX]

[DOI]

Erfan Sadeqi Azer

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Tight Bounds for Collaborative PAC Learning via Multiplicative Weights.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Smooth q-Gram, and Its Applications to Detection of Overlaps among Long, Error-Prone Sequencing Reads.

[BibT_eX]

[DOI]

Haixu Tang

Proceedings of the 27th ACM International Conference on Information and Knowledge Management, 2018

2017

Bias-Aware Sketches.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2017

When distributed computation is communication expensive.

[BibT_eX]

[DOI]

Distributed Comput., 2017

Improved Algorithms for Distributed Entropy Monitoring.

[BibT_eX]

[DOI]

Algorithmica, 2017

A Fast, Small, and Dynamic Forwarding Information Base.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Urbana-Champaign, IL, USA, June 05, 2017

EmbedJoin: Efficient Edit Similarity Joins via Embeddings.

[BibT_eX]

[DOI]

Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13, 2017

A concise forwarding information base for scalable and fast name lookups.

[BibT_eX]

[DOI]

Proceedings of the 25th IEEE International Conference on Network Protocols, 2017

Adaptive Multiple-Arm Identification.

[BibT_eX]

[DOI]

Proceedings of the 34th International Conference on Machine Learning, 2017

Communication-Efficient Distributed Skyline Computation.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, 2017

2016

Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy.

[BibT_eX]

[DOI]

Jeff M. Phillips

Elad Verbin

SIAM J. Comput., 2016

Computing Skylines on Distributed Data.

[BibT_eX]

[DOI]

CoRR, 2016

A Concise Forwarding Information Base for Scalable and Fast Flat Name Switching.

[BibT_eX]

[DOI]

CoRR, 2016

Submodular Maximization over Sliding Windows.

[BibT_eX]

[DOI]

Huy L. Nguyen

CoRR, 2016

Streaming Algorithms for Robust Distinct Elements.

[BibT_eX]

[DOI]

Di Chen

Proceedings of the 2016 International Conference on Management of Data, 2016

Communication-Optimal Distributed Clustering.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

On Sketching Quadratic Forms.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

Edit Distance: Sketching, Streaming, and Document Exchange.

[BibT_eX]

[DOI]

Djamal Belazzougui

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015

Communication Complexity of Approximate Matching in Distributed Graphs.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Communication-Efficient Computation on Distributed Noisy Datasets.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

The Communication Complexity of Distributed Set-Joins with Applications to Matrix Multiplication.

[BibT_eX]

[DOI]

Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015

2014

AMS-Sampling in Distributed Monitoring, with Applications to Entropy.

[BibT_eX]

[DOI]

CoRR, 2014

A Sketching Algorithm for Spectral Graph Sparsification.

[BibT_eX]

[DOI]

CoRR, 2014

Cache-Oblivious Hashing.

[BibT_eX]

[DOI]

Algorithmica, 2014

An Optimal Lower Bound for Distinct Elements in the Message Passing Model.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Robust set reconciliation.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Management of Data, 2014

2013

The Limits of Buffering: A Tight Lower Bound for Dynamic Membership in the External Memory Model.

[BibT_eX]

[DOI]

Elad Verbin

SIAM J. Comput., 2013

Subspace Embeddings and ℓ<sub>p</sub>-Regression Using Exponential Random Variables

[BibT_eX]

[DOI]

CoRR, 2013

When Distributed Computation does not Help

[BibT_eX]

[DOI]

CoRR, 2013

Optimal Tracking of Distributed Heavy Hitters and Quantiles.

[BibT_eX]

[DOI]

Algorithmica, 2013

Subspace Embeddings and \(\ell_p\)-Regression Using Exponential Random Variables.

[BibT_eX]

[DOI]

Proceedings of the COLT 2013, 2013

2012

Multidimensional online tracking.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2012

Continuous sampling from distributed streams.

[BibT_eX]

[DOI]

J. ACM, 2012

Tight bounds for distributed functional monitoring.

[BibT_eX]

[DOI]

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Parikh Matching in the Streaming Model.

[BibT_eX]

[DOI]

Lap-Kei Lee

Moshe Lewenstein

Proceedings of the String Processing and Information Retrieval, 2012

Rademacher-Sketch: A Dimensionality-Reducing Embedding for Sum-Product Norms, with an Application to Earth-Mover Distance.

[BibT_eX]

[DOI]

Elad Verbin

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

Sorting, Searching, and Simulation in the MapReduce Framework.

[BibT_eX]

[DOI]

Michael T. Goodrich

Nodari Sitchinava

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Edit Distance to Monotonicity in Sliding Windows.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010

On the Cell Probe Complexity of Dynamic Membership.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Optimal sampling from distributed streams.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2010

Clustering with Diversity.

[BibT_eX]

[DOI]

Jian Li

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009

Dynamic external hashing: the limit of buffering.

[BibT_eX]

[DOI]

Zhewei Wei

Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

Multi-dimensional online tracking.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Revenue generation for truthful spectrum auction in dynamic spectrum access.

[BibT_eX]

[DOI]

Proceedings of the 10th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2009

2008

Finding frequent items in probabilistic data.

[BibT_eX]

[DOI]

Feifei Li