General Information:

I am a Genomic Applications Bioinformatician at Oxford Nanopore Technologies. Previously I finished PhD at Indiana University, Bloomington in CS.


Sometimes I participate in programming contests (meta profile).

Conference papers

Parallel Best Arm Identification in Heterogeneous Environments
NK, Qin Zhang
SPAA 2024
Communication-Efficient Collaborative Regret Minimization in Multi-Armed Bandits
NK, Qin Zhang
AAAI 2024
MinJoin++: A Fast Algorithm for String Similarity Joins under Edit Distance
NK, Haoyu Zhang, Qin Zhang
VLDB Journal
Communication-Efficient Collaborative Best Arm Identification
NK, Qin Zhang
AAAI 2023
SyncSignature: A Simple, Efficient, Parallelizable Framework for Tree Similarity Joins.
NK, Qin Zhang
VLDB 2023
Instance-Sensitive Algorithms for Pure Exploration in Multinomial Logit Bandit
NK, Qin Zhang
AAAI 2022
Batched Coarse Ranking in Multi-Armed Bandits
NK, Qin Zhang
NeurIPS 2020
Collaborative Top Distribution Identifications with Limited Interaction
NK, Qin Zhang, Yuan Zhou
FOCS 2020
Distributed and Streaming Linear Programming in Low Dimensions
Sepehr Assadi, NK, Qin Zhang
PODS 2019
Sketching Algorithms for Genomic Data Analysis and Querying in a Secure Enclave
Can Kockan, Kaiyuan Zhu, Natnatee Dokmai, NK, M. Oğuzhan Külekci, David Woodruff, Cenk Sahinalp
A Multi-labeled Tree Edit Distance for Comparing "Clonal Trees" of Tumor Progression
NK, Salem Malikic, Md. Khaledur Rahman, Cenk Sahinalp
WABI 2018
An exponential lower bound for cut sparsifiers in planar graphs
NK, Marcin Pilipczuk, Anna Zych-Pawlewicz
IPEC 2017
Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters
Ivan Bliznets, NK
MFCS 2017
Parameterized Complexity of Secluded Connectivity Problems
Fedor Fomin, Petr Golovach, NK, Alexander Kulikov
Parameterized Complexity of Superstring Problems
Ivan Bliznets, Fedor Fomin, Petr Golovach, NK, Alexander Kulikov, Saket Saurabh
CPM 2015


Batched Thompson Sampling for Multi-Armed Bandits
NK, Qin Zhang