Qin Zhang

Orcid: 0000-0002-6851-3115

Affiliations:
  • Indiana University Bloomington, Computer Science Department, IN, USA
  • IBM Research Almaden (former)
  • Aarhus University (former)
  • Hong Kong University of Science and Technology (former)


According to our database1, Qin Zhang authored at least 78 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
MinJoin++: a fast algorithm for string similarity joins under edit distance.
VLDB J., 2024

Parallel Best Arm Identification in Heterogeneous Environments.
Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

Communication-Efficient Collaborative Regret Minimization in Multi-Armed Bandits.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Collaborative Regret Minimization in Multi-Armed Bandits.
CoRR, 2023

Communication-Efficient Collaborative Best Arm Identification.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
SyncSignature: A Simple, Efficient, Parallelizable Framework for Tree Similarity Joins.
Proc. VLDB Endow., 2022

Collaborative Best Arm Identification with Limited Communication on Non-IID Data.
CoRR, 2022

Technical perspective: Can data structures treat us fairly?
Commun. ACM, 2022

Meta Proximal Policy Optimization for Cooperative Multi-Agent Continuous Control.
Proceedings of the International Joint Conference on Neural Networks, 2022

Instance-Sensitive Algorithms for Pure Exploration in Multinomial Logit Bandit.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Technical Perspective: Fair Near Neighbor Search via Sampling.
SIGMOD Rec., 2021

Batched Thompson Sampling for Multi-Armed Bandits.
CoRR, 2021

Learning to Cluster via Same-Cluster Queries.
Proceedings of the CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1, 2021

2020
Communication complexity of approximate maximum matching in the message-passing model.
Distributed Comput., 2020

Collaborative Top Distribution Identifications with Limited Interaction.
CoRR, 2020

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

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

Batched Coarse Ranking in Multi-Armed Bandits.
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.
Proceedings of the KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2020

Multinomial Logit Bandit with Low Switching Cost.
Proceedings of the 37th International Conference on Machine Learning, 2020

Collaborative Top Distribution Identifications with Limited Interaction (Extended Abstract).
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

A Multi-criteria Approximation Algorithm for Influence Maximization with Probabilistic Guarantees.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020

2019
Distributed Partial Clustering.
ACM Trans. Parallel Comput., 2019

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

Distributed and Streaming Linear Programming in Low Dimensions.
Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

MinJoin: Efficient Edit Similarity Joins via Local Hash Minima.
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.
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.
IEEE/ACM Trans. Netw., 2018

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

MinJoin: Efficient Edit Similarity Joins via Local Hash Minimums.
CoRR, 2018

Distributed Statistical Estimation of Matrix Products with Applications.
Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2018

Distinct Sampling on Streaming Data with Near-Duplicates.
Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2018

A Practical Algorithm for Distributed Clustering and Outlier Detection.
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.
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.
Proceedings of the 27th ACM International Conference on Information and Knowledge Management, 2018

2017
Bias-Aware Sketches.
Proc. VLDB Endow., 2017

When distributed computation is communication expensive.
Distributed Comput., 2017

Improved Algorithms for Distributed Entropy Monitoring.
Algorithmica, 2017

A Fast, Small, and Dynamic Forwarding Information Base.
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.
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.
Proceedings of the 25th IEEE International Conference on Network Protocols, 2017

Adaptive Multiple-Arm Identification.
Proceedings of the 34th International Conference on Machine Learning, 2017

Communication-Efficient Distributed Skyline Computation.
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.
SIAM J. Comput., 2016

Computing Skylines on Distributed Data.
CoRR, 2016

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

Submodular Maximization over Sliding Windows.
CoRR, 2016

Streaming Algorithms for Robust Distinct Elements.
Proceedings of the 2016 International Conference on Management of Data, 2016

Communication-Optimal Distributed Clustering.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

On Sketching Quadratic Forms.
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

Edit Distance: Sketching, Streaming, and Document Exchange.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015
Communication Complexity of Approximate Matching in Distributed Graphs.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Communication-Efficient Computation on Distributed Noisy Datasets.
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.
Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015

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

A Sketching Algorithm for Spectral Graph Sparsification.
CoRR, 2014

Cache-Oblivious Hashing.
Algorithmica, 2014

An Optimal Lower Bound for Distinct Elements in the Message Passing Model.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Robust set reconciliation.
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.
SIAM J. Comput., 2013

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

When Distributed Computation does not Help
CoRR, 2013

Optimal Tracking of Distributed Heavy Hitters and Quantiles.
Algorithmica, 2013

Subspace Embeddings and \(\ell_p\)-Regression Using Exponential Random Variables.
Proceedings of the COLT 2013, 2013

2012
Multidimensional online tracking.
ACM Trans. Algorithms, 2012

Continuous sampling from distributed streams.
J. ACM, 2012

Tight bounds for distributed functional monitoring.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Parikh Matching in the Streaming Model.
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.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
Sorting, Searching, and Simulation in the MapReduce Framework.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Edit Distance to Monotonicity in Sliding Windows.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010
On the Cell Probe Complexity of Dynamic Membership.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Optimal sampling from distributed streams.
Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2010

Clustering with Diversity.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009
Dynamic external hashing: the limit of buffering.
Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

Multi-dimensional online tracking.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Revenue generation for truthful spectrum auction in dynamic spectrum access.
Proceedings of the 10th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2009

2008
Finding frequent items in probabilistic data.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2008


  Loading...