Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDQin Zhang 0001
Person information
- affiliation: Indiana University Bloomington, Computer Science Department, IN, USA
- affiliation (former): IBM Research Almaden
- affiliation (former): Aarhus University
- affiliation (former): Hong Kong University of Science and Technology
Other persons with the same name
- Qin Zhang — disambiguation page
- Qin Zhang 0002 — University of Luxembourg
- Qin Zhang 0003 — Dartmouth College, Hanover, NH, USA
- Qin Zhang 0004 — Huazhong University of Science and Technology, School of Computer Science and Technology, Wuhan, China
- Qin Zhang 0005 — The University of Texas at Austin, USA (and 1 more)
- Qin Zhang 0006
![[0000-0002-7083-8947]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0002-7083-8947")
— Huazhong University of Science and Technology, School of Mechanical Science and Engineering, State Key Laboratory of Digital, Manufacturing Equipment and Technology, Wuhan, China (and 2 more) - Qin Zhang 0007 — Beihang University, School of Computer Science and Engineering, Beijing, China
- Qin Zhang 0008 — Ocean University of China, Qingdao, China (and 1 more)
- Qin Zhang 0009 — Communication University of China, Key Laboratory of Media Audio and Video, Beijing, China
- Qin Zhang 0010 — Chang'an University, College of Geology Engineering and Geomatics, Xi'an, China
- Qin Zhang 0011 — Tencent, Data Center for Cloud and Smart Industries Group, Shenzhen, China (and 2 more)
- Qin Zhang 0012 — Washington State University, Center for Precision and Automated Agricultural Systems, Prosser, WA, USA
- Qin Zhang 0013 — South China University of Technology, School of Computer Science and Engineering, Guangzhou, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2024
[j20]Nikolai Karpov, Haoyu Zhang, Qin Zhang:
MinJoin++: a fast algorithm for string similarity joins under edit distance. VLDB J. 33(2): 281-299 (2024)- 2022
- [j19]Qin Zhang:
Technical perspective: Can data structures treat us fairly? Commun. ACM 65(8): 82 (2022) - [j18]Nikolai Karpov, Qin Zhang:
SyncSignature: A Simple, Efficient, Parallelizable Framework for Tree Similarity Joins. Proc. VLDB Endow. 16(2): 330-342 (2022) - 2021
- [j17]Qin Zhang:
Technical Perspective: Fair Near Neighbor Search via Sampling. SIGMOD Rec. 50(1): 41 (2021) - 2020
- [j16]Zengfeng Huang, Ke Yi, Qin Zhang:
Correction to: Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks. Algorithmica 82(11): 3413 (2020) - [j15]Yan Song, Haixu Tang, Haoyu Zhang, Qin Zhang:
Overlap detection on long, error-prone sequencing reads via smooth q-gram. Bioinform. 36(19): 4838-4845 (2020) - [j14]Zengfeng Huang, Bozidar Radunovic, Milan Vojnovic, Qin Zhang:
Communication complexity of approximate maximum matching in the message-passing model. Distributed Comput. 33(6): 515-531 (2020) - 2019
- [j13]Zengfeng Huang, Ke Yi, Qin Zhang:
Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks. Algorithmica 81(6): 2222-2243 (2019) - [j12]Sudipto Guha, Yi Li, Qin Zhang:
Distributed Partial Clustering. ACM Trans. Parallel Comput. 6(3): 11:1-11:20 (2019) - 2018
- [j11]Arnab Bhattacharyya, Fabrizio Grandoni, Aleksandar Nikolov, Barna Saha, Saket Saurabh, Aravindan Vijayaraghavan, Qin Zhang:
Editorial: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2016 Special Issue. ACM Trans. Algorithms 14(3): 26:1-26:2 (2018) - [j10]Ye Yu, Djamal Belazzougui, Chen Qian, Qin Zhang:
Memory-Efficient and Ultra-Fast Network Lookup and Forwarding Using Othello Hashing. IEEE/ACM Trans. Netw. 26(3): 1151-1164 (2018) - 2017
- [j9]Jiecao Chen, Qin Zhang:
Improved Algorithms for Distributed Entropy Monitoring. Algorithmica 78(3): 1041-1066 (2017) - [j8]David P. Woodruff, Qin Zhang:
When distributed computation is communication expensive. Distributed Comput. 30(5): 309-323 (2017) - [j7]Jiecao Chen, Qin Zhang:
Bias-Aware Sketches. Proc. VLDB Endow. 10(9): 961-972 (2017) - 2016
- [j6]Jeff M. Phillips, Elad Verbin, Qin Zhang:
Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy. SIAM J. Comput. 45(1): 174-196 (2016) - 2014
- [j5]Rasmus Pagh, Zhewei Wei, Ke Yi, Qin Zhang:
Cache-Oblivious Hashing. Algorithmica 69(4): 864-883 (2014) - 2013
- [j4]Ke Yi, Qin Zhang:
Optimal Tracking of Distributed Heavy Hitters and Quantiles. Algorithmica 65(1): 206-223 (2013) - [j3]Elad Verbin, Qin Zhang:
The Limits of Buffering: A Tight Lower Bound for Dynamic Membership in the External Memory Model. SIAM J. Comput. 42(1): 212-229 (2013) - 2012
- [j2]Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang:
Continuous sampling from distributed streams. J. ACM 59(2): 10:1-10:25 (2012) - [j1]Ke Yi, Qin Zhang:
Multidimensional online tracking. ACM Trans. Algorithms 8(2): 12:1-12:16 (2012)
Conference and Workshop Papers
- 2024
- [c52]Nikolai Karpov, Qin Zhang:
Communication-Efficient Collaborative Regret Minimization in Multi-Armed Bandits. AAAI 2024: 13076-13084 - 2023
- [c51]Nikolai Karpov, Qin Zhang:
Communication-Efficient Collaborative Best Arm Identification. AAAI 2023: 8203-8210 - 2022
- [c50]Nikolai Karpov, Qin Zhang:
Instance-Sensitive Algorithms for Pure Exploration in Multinomial Logit Bandit. AAAI 2022: 7096-7103 - [c49]Boli Fang, Zhenghao Peng, Hao Sun, Qin Zhang:
Meta Proximal Policy Optimization for Cooperative Multi-Agent Continuous Control. IJCNN 2022: 1-8 - 2021
- [c48]Yi Li, Yan Song, Qin Zhang:
Learning to Cluster via Same-Cluster Queries. CIKM 2021: 978-987 - 2020
- [c47]Maleq Khan, Gopal Pandurangan, Nguyen Dinh Pham, Anil Vullikanti, Qin Zhang:
A Multi-criteria Approximation Algorithm for Influence Maximization with Probabilistic Guarantees. ALENEX 2020: 81-93 - [c46]Nikolai Karpov, Qin Zhang, Yuan Zhou:
Collaborative Top Distribution Identifications with Limited Interaction (Extended Abstract). FOCS 2020: 160-171 - [c45]Kefan Dong, Yingkai Li, Qin Zhang, Yuan Zhou:
Multinomial Logit Bandit with Low Switching Cost. ICML 2020: 2607-2615 - [c44]Haoyu Zhang, Qin Zhang:
MinSearch: An Efficient Algorithm for Similarity Search under Edit Distance. KDD 2020: 566-576 - [c43]Nikolai Karpov, Qin Zhang:
Batched Coarse Ranking in Multi-Armed Bandits. NeurIPS 2020 - 2019
- [c42]Chao Tao, Qin Zhang, Yuan Zhou:
Collaborative Learning with Limited Interaction: Tight Bounds for Distributed Exploration in Multi-armed Bandits. FOCS 2019: 126-146 - [c41]Haoyu Zhang, Qin Zhang:
MinJoin: Efficient Edit Similarity Joins via Local Hash Minima. KDD 2019: 1093-1103 - [c40]Sepehr Assadi, Nikolai Karpov, Qin Zhang:
Distributed and Streaming Linear Programming in Low Dimensions. PODS 2019: 236-253 - 2018
- [c39]Haoyu Zhang, Qin Zhang, Haixu Tang:
Smooth q-Gram, and Its Applications to Detection of Overlaps among Long, Error-Prone Sequencing Reads. CIKM 2018: 267-276 - [c38]Jiecao Chen, Erfan Sadeqi Azer, Qin Zhang:
A Practical Algorithm for Distributed Clustering and Outlier Detection. NeurIPS 2018: 2253-2262 - [c37]Jiecao Chen, Qin Zhang, Yuan Zhou:
Tight Bounds for Collaborative PAC Learning via Multiplicative Weights. NeurIPS 2018: 3602-3611 - [c36]Jiecao Chen, Qin Zhang:
Distinct Sampling on Streaming Data with Near-Duplicates. PODS 2018: 369-382 - [c35]David P. Woodruff, Qin Zhang:
Distributed Statistical Estimation of Matrix Products with Applications. PODS 2018: 383-394 - 2017
- [c34]Haoyu Zhang, Qin Zhang:
Communication-Efficient Distributed Skyline Computation. CIKM 2017: 437-446 - [c33]Jiecao Chen, Xi Chen, Qin Zhang, Yuan Zhou:
Adaptive Multiple-Arm Identification. ICML 2017: 722-730 - [c32]Ye Yu, Djamal Belazzougui, Chen Qian, Qin Zhang:
A concise forwarding information base for scalable and fast name lookups. ICNP 2017: 1-10 - [c31]Haoyu Zhang, Qin Zhang:
EmbedJoin: Efficient Edit Similarity Joins via Embeddings. KDD 2017: 585-594 - [c30]Ye Yu, Djamal Belazzougui, Chen Qian, Qin Zhang:
A Fast, Small, and Dynamic Forwarding Information Base. SIGMETRICS (Abstracts) 2017: 41-42 - [c29]Sudipto Guha, Yi Li, Qin Zhang:
Distributed Partial Clustering. SPAA 2017: 143-152 - 2016
- [c28]Djamal Belazzougui, Qin Zhang:
Edit Distance: Sketching, Streaming, and Document Exchange. FOCS 2016: 51-60 - [c27]Alexandr Andoni, Jiecao Chen, Robert Krauthgamer, Bo Qin, David P. Woodruff, Qin Zhang:
On Sketching Quadratic Forms. ITCS 2016: 311-319 - [c26]Jiecao Chen, He Sun, David P. Woodruff, Qin Zhang:
Communication-Optimal Distributed Clustering. NIPS 2016: 3720-3728 - [c25]Di Chen, Qin Zhang:
Streaming Algorithms for Robust Distinct Elements. SIGMOD Conference 2016: 1433-1447 - 2015
- [c24]Dirk Van Gucht, Ryan Williams, David P. Woodruff, Qin Zhang:
The Communication Complexity of Distributed Set-Joins with Applications to Matrix Multiplication. PODS 2015: 199-212 - [c23]Qin Zhang:
Communication-Efficient Computation on Distributed Noisy Datasets. SPAA 2015: 313-322 - [c22]Zengfeng Huang, Bozidar Radunovic, Milan Vojnovic, Qin Zhang:
Communication Complexity of Approximate Matching in Distributed Graphs. STACS 2015: 460-473 - 2014
- [c21]Di Chen, Christian Konrad, Ke Yi, Wei Yu, Qin Zhang:
Robust set reconciliation. SIGMOD Conference 2014: 135-146 - [c20]David P. Woodruff, Qin Zhang:
An Optimal Lower Bound for Distinct Elements in the Message Passing Model. SODA 2014: 718-733 - 2013
- [c19]David P. Woodruff, Qin Zhang:
Subspace Embeddings and \(\ell_p\)-Regression Using Exponential Random Variables. COLT 2013: 546-567 - [c18]David P. Woodruff, Qin Zhang:
When Distributed Computation Is Communication Expensive. DISC 2013: 16-30 - 2012
- [c17]Elad Verbin, Qin Zhang:
Rademacher-Sketch: A Dimensionality-Reducing Embedding for Sum-Product Norms, with an Application to Earth-Mover Distance. ICALP (1) 2012: 834-845 - [c16]Zengfeng Huang, Ke Yi, Qin Zhang:
Randomized algorithms for tracking distributed count, frequencies, and ranks. PODS 2012: 295-306 - [c15]Jeff M. Phillips, Elad Verbin, Qin Zhang:
Lower bounds for number-in-hand multiparty communication complexity, made easy. SODA 2012: 486-501 - [c14]Lap-Kei Lee, Moshe Lewenstein, Qin Zhang:
Parikh Matching in the Streaming Model. SPIRE 2012: 336-341 - [c13]David P. Woodruff, Qin Zhang:
Tight bounds for distributed functional monitoring. STOC 2012: 941-960 - 2011
- [c12]Michael T. Goodrich, Nodari Sitchinava, Qin Zhang:
Sorting, Searching, and Simulation in the MapReduce Framework. ISAAC 2011: 374-383 - [c11]Ho-Leung Chan, Tak Wah Lam, Lap-Kei Lee, Jiangwei Pan, Hing-Fung Ting, Qin Zhang:
Edit Distance to Monotonicity in Sliding Windows. ISAAC 2011: 564-573 - 2010
- [c10]Jian Li, Ke Yi, Qin Zhang:
Clustering with Diversity. ICALP (1) 2010: 188-200 - [c9]Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang:
Optimal sampling from distributed streams. PODS 2010: 77-86 - [c8]Rasmus Pagh, Zhewei Wei, Ke Yi, Qin Zhang:
Cache-oblivious hashing. PODS 2010: 297-304 - [c7]Ke Yi, Qin Zhang:
On the Cell Probe Complexity of Dynamic Membership. SODA 2010: 123-133 - [c6]Elad Verbin, Qin Zhang:
The limits of buffering: a tight lower bound for dynamic membership in the external memory model. STOC 2010: 447-456 - 2009
- [c5]Juncheng Jia, Qian Zhang, Qin Zhang, Mingyan Liu:
Revenue generation for truthful spectrum auction in dynamic spectrum access. MobiHoc 2009: 3-12 - [c4]Ke Yi, Qin Zhang:
Optimal tracking of distributed heavy hitters and quantiles. PODS 2009: 167-174 - [c3]Ke Yi, Qin Zhang:
Multi-dimensional online tracking. SODA 2009: 1098-1107 - [c2]Zhewei Wei, Ke Yi, Qin Zhang:
Dynamic external hashing: the limit of buffering. SPAA 2009: 253-259 - 2008
- [c1]Qin Zhang, Feifei Li, Ke Yi:
Finding frequent items in probabilistic data. SIGMOD Conference 2008: 819-832
Informal and Other Publications
- 2023
- [i39]Nikolai Karpov, Qin Zhang:
Collaborative Regret Minimization in Multi-Armed Bandits. CoRR abs/2301.11442 (2023) - 2022
- [i38]Nikolai Karpov, Qin Zhang:
Collaborative Best Arm Identification with Limited Communication on Non-IID Data. CoRR abs/2207.08015 (2022) - [i37]Nikolai Karpov, Qin Zhang:
Communication-Efficient Collaborative Best Arm Identification. CoRR abs/2208.09029 (2022) - 2021
- [i36]Nikolai Karpov, Qin Zhang:
Batched Thompson Sampling for Multi-Armed Bandits. CoRR abs/2108.06812 (2021) - [i35]Yi Li, Yan Song, Qin Zhang:
Learning to Cluster via Same-Cluster Queries. CoRR abs/2108.07383 (2021) - 2020
- [i34]Nikolai Karpov, Qin Zhang, Yuan Zhou:
Collaborative Top Distribution Identifications with Limited Interaction. CoRR abs/2004.09454 (2020) - [i33]Kefan Dong, Yingkai Li, Qin Zhang, Yuan Zhou:
Multinomial Logit Bandit with Low Switching Cost. CoRR abs/2007.04876 (2020) - [i32]Nikolai Karpov, Qin Zhang:
Instance-Sensitive Algorithms for Pure Exploration in Multinomial Logit Bandit. CoRR abs/2012.01499 (2020) - 2019
- [i31]Sepehr Assadi, Nikolai Karpov, Qin Zhang:
Distributed and Streaming Linear Programming in Low Dimensions. CoRR abs/1903.05617 (2019) - [i30]Chao Tao, Qin Zhang, Yuan Zhou:
Collaborative Learning with Limited Interaction: Tight Bounds for Distributed Exploration in Multi-Armed Bandits. CoRR abs/1904.03293 (2019) - 2018
- [i29]Haoyu Zhang, Qin Zhang, Haixu Tang:
Smooth q-Gram, and Its Applications to Detection of Overlaps among Long, Error-Prone Sequencing Reads. CoRR abs/1802.01189 (2018) - [i28]Jiecao Chen, Qin Zhang, Yuan Zhou:
Tight Bounds for Collaborative PAC Learning via Multiplicative Weights. CoRR abs/1805.09217 (2018) - [i27]Jiecao Chen, Erfan Sadeqi Azer, Qin Zhang:
A Practical Algorithm for Distributed Clustering and Outlier Detection. CoRR abs/1805.09495 (2018) - [i26]David P. Woodruff, Qin Zhang:
Distributed Statistical Estimation of Matrix Products with Applications. CoRR abs/1807.00878 (2018) - [i25]Haoyu Zhang, Qin Zhang:
MinJoin: Efficient Edit Similarity Joins via Local Hash Minimums. CoRR abs/1810.08833 (2018) - [i24]Jiecao Chen, Qin Zhang:
Distinct Sampling on Streaming Data with Near-Duplicates. CoRR abs/1810.12388 (2018) - 2017
- [i23]Haoyu Zhang, Qin Zhang:
EmbedJoin: Efficient Edit Similarity Joins via Embeddings. CoRR abs/1702.00093 (2017) - [i22]Jiecao Chen, He Sun, David P. Woodruff, Qin Zhang:
Communication-Optimal Distributed Clustering. CoRR abs/1702.00196 (2017) - [i21]Sudipto Guha, Yi Li, Qin Zhang:
Distributed Partial Clustering. CoRR abs/1703.01539 (2017) - [i20]Zengfeng Huang, Bozidar Radunovic, Milan Vojnovic, Qin Zhang:
Communication complexity of approximate maximum matching in the message-passing model. CoRR abs/1704.08462 (2017) - [i19]Jiecao Chen, Xi Chen, Qin Zhang, Yuan Zhou:
Adaptive Multiple-Arm Identification. CoRR abs/1706.01026 (2017) - 2016
- [i18]Djamal Belazzougui, Qin Zhang:
Edit Distance: Sketching, Streaming and Document Exchange. CoRR abs/1607.04200 (2016) - [i17]Ye Yu, Djamal Belazzougui, Chen Qian, Qin Zhang:
A Concise Forwarding Information Base for Scalable and Fast Flat Name Switching. CoRR abs/1608.05699 (2016) - [i16]Jiecao Chen, Qin Zhang:
Bias-Aware Sketches. CoRR abs/1610.07718 (2016) - [i15]Jiecao Chen, Huy L. Nguyen, Qin Zhang:
Submodular Maximization over Sliding Windows. CoRR abs/1611.00129 (2016) - [i14]Haoyu Zhang, Qin Zhang:
Computing Skylines on Distributed Data. CoRR abs/1611.00423 (2016) - 2015
- [i13]Alexandr Andoni, Jiecao Chen, Robert Krauthgamer, Bo Qin, David P. Woodruff, Qin Zhang:
On Sketching Quadratic Forms. CoRR abs/1511.06099 (2015) - 2014
- [i12]Jiecao Chen, Qin Zhang:
AMS-Sampling in Distributed Monitoring, with Applications to Entropy. CoRR abs/1409.4843 (2014) - [i11]Jiecao Chen, Bo Qin, David P. Woodruff, Qin Zhang:
A Sketching Algorithm for Spectral Graph Sparsification. CoRR abs/1412.8225 (2014) - 2013
- [i10]David P. Woodruff, Qin Zhang:
When Distributed Computation does not Help. CoRR abs/1304.4636 (2013) - [i9]David P. Woodruff, Qin Zhang:
Subspace Embeddings and ℓp-Regression Using Exponential Random Variables. CoRR abs/1305.5580 (2013) - 2011
- [i8]Michael T. Goodrich, Nodari Sitchinava, Qin Zhang:
Sorting, Searching, and Simulation in the MapReduce Framework. CoRR abs/1101.1902 (2011) - [i7]Jeff M. Phillips, Elad Verbin, Qin Zhang:
Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy. CoRR abs/1107.2559 (2011) - [i6]Zengfeng Huang, Ke Yi, Qin Zhang:
Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks. CoRR abs/1108.3413 (2011) - [i5]Ho-Leung Chan, Tak Wah Lam, Lap-Kei Lee, Jiangwei Pan, Hing-Fung Ting, Qin Zhang:
Edit Distance to Monotonicity in Sliding Windows. CoRR abs/1111.5386 (2011) - [i4]David P. Woodruff, Qin Zhang:
Tight Bounds for Distributed Functional Monitoring. CoRR abs/1112.5153 (2011) - 2010
- [i3]Jian Li, Ke Yi, Qin Zhang:
Clustering with diversity. CoRR abs/1004.2968 (2010) - 2008
- [i2]Zhewei Wei, Ke Yi, Qin Zhang:
Dynamic External Hashing: The Limit of Buffering. CoRR abs/0811.3062 (2008) - [i1]Ke Yi, Qin Zhang:
Optimal Tracking of Distributed Heavy Hitters and Quantiles. CoRR abs/0812.0209 (2008)
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-18 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
