I'm a research scientist at Facebook Inc. I received my Ph.d. Degree in computer science at Indiana University Bloomington advised by
Prof. Qin Zhang. My research interests are algorithms and databases.
My research was supported by grant NSF CCF-1525024 and NSF IIS-1633215.
MinSearch: An Efficient Algorithm for Similarity Search under Edit Distance
Haoyu Zhang, Qin Zhang (KDD 2020, Acceptance rate: 216/1279=16.9%)
Overlap Detection on Long, Error-Prone Sequencing Reads via Smooth q-Gram
Yan Song, Haixu Tang, Haoyu Zhang, Qin Zhang (Bioinformatics, 2020, in alphabetical order)
MinJoin: Efficient Joins under Edit Distance via Local Hash Minima
Haoyu Zhang, Qin Zhang (KDD 2019, Oral Acceptance rate: 110/1200=9.2%)
Smooth q-Gram, and Its Applications to Detection of Overlaps among Long, Error-Prone Sequencing Reads
Haoyu Zhang, Qin Zhang, Haixu Tang (CIKM 2018, Acceptance rate: 147/862=17%)
Communication-Efficient Distributed Skyline Computation
Haoyu Zhang, Qin Zhang (CIKM 2017, Acceptance rate: 171/820=21%)
EmbedJoin: Efficient Edit Similarity Joins via Embeddings
Haoyu Zhang, Qin Zhang (KDD 2017, Oral, Acceptance rate: 67/748=8.6%)
- hz30 AT iu DOT edu