Finding frequent items in probabilistic data. - Qin Zhang 001; Feifei Li 001; Ke Yi 001 (SIGMOD Conference, 2008)

Revenue generation for truthful spectrum auction in dynamic spectrum access. - Juncheng Jia; Qian Zhang 001; Qin Zhang 001; Mingyan Liu (MobiHoc, 2009)

Multi-dimensional online tracking. - Ke Yi 001; Qin Zhang 001 (SODA, 2009)

Dynamic external hashing: the limit of buffering. - Zhewei Wei; Ke Yi 001; Qin Zhang 001 (SPAA, 2009)

Clustering with Diversity. - Jian Li 015; Ke Yi 001; Qin Zhang 001 (ICALP (1), 2010)

Optimal sampling from distributed streams. - Graham Cormode; S. Muthukrishnan 001; Ke Yi 001; Qin Zhang 001 (PODS, 2010)

On the Cell Probe Complexity of Dynamic Membership. - Ke Yi 001; Qin Zhang 001 (SODA, 2010)

Edit Distance to Monotonicity in Sliding Windows. - Ho-Leung Chan; Tak Wah Lam; Lap-Kei Lee; Jiangwei Pan; Hing-Fung Ting; Qin Zhang 001 (ISAAC, 2011)

Sorting, Searching, and Simulation in the MapReduce Framework. - Michael T. Goodrich; Nodari Sitchinava; Qin Zhang 001 (ISAAC, 2011)

Rademacher-Sketch: A Dimensionality-Reducing Embedding for Sum-Product Norms, with an Application to Earth-Mover Distance. - Elad Verbin; Qin Zhang 001 (ICALP (1), 2012)

Parikh Matching in the Streaming Model. - Lap-Kei Lee; Moshe Lewenstein; Qin Zhang 001 (SPIRE, 2012)

Tight bounds for distributed functional monitoring. - David P. Woodruff; Qin Zhang 001 (STOC, 2012)

Continuous sampling from distributed streams. - Graham Cormode; S. Muthukrishnan 001; Ke Yi 001; Qin Zhang 001 (J. ACM, 2012)

Multidimensional online tracking. - Ke Yi 001; Qin Zhang 001 (ACM Trans. Algorithms, 2012)

Subspace Embeddings and ( ell_p )-Regression Using Exponential Random Variables. - David P. Woodruff; Qin Zhang 001 (COLT, 2013)

Optimal Tracking of Distributed Heavy Hitters and Quantiles. - Ke Yi 001; Qin Zhang 001 (Algorithmica, 2013)

When Distributed Computation does not Help - David P. Woodruff; Qin Zhang 001 (CoRR, 2013)

Subspace Embeddings and ℓp-Regression Using Exponential Random Variables - David P. Woodruff; Qin Zhang 001 (CoRR, 2013)

The Limits of Buffering: A Tight Lower Bound for Dynamic Membership in the External Memory Model. - Elad Verbin; Qin Zhang 001 (SIAM J. Comput., 2013)

Robust set reconciliation. - Di Chen; Christian Konrad 001; Ke Yi 001; Wei Yu; Qin Zhang 001 (SIGMOD Conference, 2014)

An Optimal Lower Bound for Distinct Elements in the Message Passing Model. - David P. Woodruff; Qin Zhang 001 (SODA, 2014)

Cache-Oblivious Hashing. - Rasmus Pagh; Zhewei Wei; Ke Yi 001; Qin Zhang 001 (Algorithmica, 2014)

A Sketching Algorithm for Spectral Graph Sparsification. - Jiecao Chen; Bo Qin; David P. Woodruff; Qin Zhang 001 (CoRR, 2014)

AMS-Sampling in Distributed Monitoring, with Applications to Entropy. - Jiecao Chen; Qin Zhang 001 (CoRR, 2014)

The Communication Complexity of Distributed Set-Joins with Applications to Matrix Multiplication. - Dirk Van Gucht; Ryan Williams 001; David P. Woodruff; Qin Zhang 001 (PODS, 2015)

Communication-Efficient Computation on Distributed Noisy Datasets. - Qin Zhang 001 (SPAA, 2015)

Communication Complexity of Approximate Matching in Distributed Graphs. - Zengfeng Huang; Bozidar Radunovic; Milan Vojnovic; Qin Zhang 001 (STACS, 2015)

Edit Distance: Sketching, Streaming, and Document Exchange. - Djamal Belazzougui; Qin Zhang 001 (FOCS, 2016)

On Sketching Quadratic Forms. - Alexandr Andoni; Jiecao Chen; Robert Krauthgamer; Bo Qin; David P. Woodruff; Qin Zhang 001 (ITCS, 2016)

Communication-Optimal Distributed Clustering. - Jiecao Chen; He Sun 001; David P. Woodruff; Qin Zhang 001 (NIPS, 2016)

Streaming Algorithms for Robust Distinct Elements. - Di Chen; Qin Zhang 001 (SIGMOD Conference, 2016)

Submodular Maximization over Sliding Windows. - Jiecao Chen; Huy L. Nguyen; Qin Zhang 001 (CoRR, 2016)

A Concise Forwarding Information Base for Scalable and Fast Flat Name Switching. - Ye Yu 001; Djamal Belazzougui; Chen Qian 001; Qin Zhang 001 (CoRR, 2016)

Computing Skylines on Distributed Data. - Haoyu Zhang; Qin Zhang 001 (CoRR, 2016)

Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy. - Jeff M. Phillips; Elad Verbin; Qin Zhang 001 (SIAM J. Comput., 2016)

Communication-Efficient Distributed Skyline Computation. - Haoyu Zhang; Qin Zhang 001 (CIKM, 2017)

Adaptive Multiple-Arm Identification. - Jiecao Chen; Xi Chen 010; Qin Zhang 001; Yuan Zhou 007 (ICML, 2017)

A concise forwarding information base for scalable and fast name lookups. - Ye Yu 001; Djamal Belazzougui; Chen Qian 001; Qin Zhang 001 (ICNP, 2017)

EmbedJoin: Efficient Edit Similarity Joins via Embeddings. - Haoyu Zhang; Qin Zhang 001 (KDD, 2017)

A Fast, Small, and Dynamic Forwarding Information Base. - Ye Yu 001; Djamal Belazzougui; Chen Qian 001; Qin Zhang 001 (SIGMETRICS (Abstracts), 2017)

Improved Algorithms for Distributed Entropy Monitoring. - Jiecao Chen; Qin Zhang 001 (Algorithmica, 2017)

When distributed computation is communication expensive. - David P. Woodruff; Qin Zhang 001 (Distributed Comput., 2017)

Bias-Aware Sketches. - Jiecao Chen; Qin Zhang 001 (Proc. VLDB Endow., 2017)

Smooth q-Gram, and Its Applications to Detection of Overlaps among Long, Error-Prone Sequencing Reads. - Haoyu Zhang; Qin Zhang 001; Haixu Tang (CIKM, 2018)

Tight Bounds for Collaborative PAC Learning via Multiplicative Weights. - Jiecao Chen; Qin Zhang 001; Yuan Zhou 007 (NeurIPS, 2018)

A Practical Algorithm for Distributed Clustering and Outlier Detection. - Jiecao Chen; Erfan Sadeqi Azer; Qin Zhang 001 (NeurIPS, 2018)

Distinct Sampling on Streaming Data with Near-Duplicates. - Jiecao Chen; Qin Zhang 001 (PODS, 2018)

Distributed Statistical Estimation of Matrix Products with Applications. - David P. Woodruff; Qin Zhang 001 (PODS, 2018)

MinJoin: Efficient Edit Similarity Joins via Local Hash Minimums. - Haoyu Zhang; Qin Zhang 001 (CoRR, 2018)

Editorial: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2016 Special Issue. - Arnab Bhattacharyya 001; Fabrizio Grandoni 001; Aleksandar Nikolov; Barna Saha; Saket Saurabh 001; Aravindan Vijayaraghavan; Qin Zhang 001 (ACM Trans. Algorithms, 2018)

Memory-Efficient and Ultra-Fast Network Lookup and Forwarding Using Othello Hashing. - Ye Yu 001; Djamal Belazzougui; Chen Qian 001; Qin Zhang 001 (IEEE/ACM Trans. Netw., 2018)

Collaborative Learning with Limited Interaction: Tight Bounds for Distributed Exploration in Multi-armed Bandits. - Chao Tao 003; Qin Zhang 001; Yuan Zhou 007 (FOCS, 2019)

MinJoin: Efficient Edit Similarity Joins via Local Hash Minima. - Haoyu Zhang; Qin Zhang 001 (KDD, 2019)

Distributed and Streaming Linear Programming in Low Dimensions. - Sepehr Assadi; Nikolai Karpov; Qin Zhang 001 (PODS, 2019)

Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks. - Zengfeng Huang; Ke Yi 001; Qin Zhang 001 (Algorithmica, 2019)

Distributed Partial Clustering. - Sudipto Guha; Yi Li 002; Qin Zhang 001 (ACM Trans. Parallel Comput., 2019)

A Multi-criteria Approximation Algorithm for Influence Maximization with Probabilistic Guarantees. - Maleq Khan; Gopal Pandurangan; Nguyen Dinh Pham; Anil Vullikanti; Qin Zhang 001 (ALENEX, 2020)

Collaborative Top Distribution Identifications with Limited Interaction (Extended Abstract). - Nikolai Karpov; Qin Zhang 001; Yuan Zhou 007 (FOCS, 2020)

Multinomial Logit Bandit with Low Switching Cost. - Kefan Dong; Yingkai Li; Qin Zhang 001; Yuan Zhou 007 (ICML, 2020)

MinSearch: An Efficient Algorithm for Similarity Search under Edit Distance. - Haoyu Zhang; Qin Zhang 001 (KDD, 2020)

Batched Coarse Ranking in Multi-Armed Bandits. - Nikolai Karpov; Qin Zhang 001 (NeurIPS, 2020)

Correction to: Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks. - Zengfeng Huang; Ke Yi 001; Qin Zhang 001 (Algorithmica, 2020)

Overlap detection on long, error-prone sequencing reads via smooth q-gram. - Yan Song; Haixu Tang; Haoyu Zhang; Qin Zhang 001 (Bioinform., 2020)

Collaborative Top Distribution Identifications with Limited Interaction. - Nikolai Karpov; Qin Zhang 001; Yuan Zhou 007 (CoRR, 2020)

Communication complexity of approximate maximum matching in the message-passing model. - Zengfeng Huang; Bozidar Radunovic; Milan Vojnovic; Qin Zhang 001 (Distributed Comput., 2020)

Learning to Cluster via Same-Cluster Queries. - Yi Li 002; Yan Song; Qin Zhang 001 (CIKM, 2021)

Batched Thompson Sampling for Multi-Armed Bandits. - Nikolai Karpov; Qin Zhang 001 (CoRR, 2021)

Technical Perspective: Fair Near Neighbor Search via Sampling. - Qin Zhang 001 (SIGMOD Rec., 2021)

Instance-Sensitive Algorithms for Pure Exploration in Multinomial Logit Bandit. - Nikolai Karpov; Qin Zhang 001 (AAAI, 2022)

Meta Proximal Policy Optimization for Cooperative Multi-Agent Continuous Control. - Boli Fang; Zhenghao Peng; Hao Sun; Qin Zhang 001 (IJCNN, 2022)

Technical perspective: Can data structures treat us fairly? - Qin Zhang 001 (Commun. ACM, 2022)

Collaborative Best Arm Identification with Limited Communication on Non-IID Data. - Nikolai Karpov; Qin Zhang 001 (CoRR, 2022)

SyncSignature: A Simple, Efficient, Parallelizable Framework for Tree Similarity Joins. - Nikolai Karpov; Qin Zhang 001 (Proc. VLDB Endow., 2022)

Communication-Efficient Collaborative Best Arm Identification. - Nikolai Karpov; Qin Zhang 001 (AAAI, 2023)

Collaborative Regret Minimization in Multi-Armed Bandits. - Nikolai Karpov; Qin Zhang 001 (CoRR, 2023)

Communication-Efficient Collaborative Regret Minimization in Multi-Armed Bandits. - Nikolai Karpov; Qin Zhang 001 (AAAI, 2024)

EEiF: Efficient Isolated Forest with e Branches for Anomaly Detection. - Yifan Zhang; Haolong Xiang; Xuyun Zhang; Xiaolong Xu 001; Wei Fan 010; Qin Zhang 001; Lianyong Qi (ICDM, 2024)

Parallel Best Arm Identification in Heterogeneous Environments. - Nikolai Karpov; Qin Zhang 001 (SPAA, 2024)

MinJoin++: a fast algorithm for string similarity joins under edit distance. - Nikolai Karpov; Haoyu Zhang; Qin Zhang 001 (VLDB J., 2024)

Quantum Data Sketches. - Qin Zhang 001; Mohsen Heidari (ICDT, 2025)

Breaking the log⁡(1/Δ2) Barrier: Better Batched Best Arm Identification with Adaptive Grids. - Tianyuan Jin; Qin Zhang 001; Dongruo Zhou (ICLR, 2025)

Breaking the log(1/Δ2) Barrier: Better Batched Best Arm Identification with Adaptive Grids. - Tianyuan Jin; Qin Zhang 001; Dongruo Zhou (CoRR, 2025)

Faster Approximation Algorithms for k-Center via Data Reduction. - Arnold Filtser; Shaofeng H.-C. Jiang; Yi Li 002; Anurag Murty Naredla; Ioannis Psarros; Qiaoyuan Yang; Qin Zhang 001 (CoRR, 2025)

Computing Approximate Graph Edit Distance via Optimal Transport. - Qihao Cheng; Da Yan 001; Tianhao Wu 006; Zhongyi Huang; Qin Zhang 001 (Proc. ACM Manag. Data, 2025)

Robust Statistical Analysis on Streaming Data with Near-Duplicates in General Metric Spaces. - Qin Zhang 001 (Proc. ACM Manag. Data, 2025)