![]() |
email: nkarpov@iu.edu General Information: I am a Ph.D. student at Luddy School of Informatics, Computing, and Engineering; Indiana University, Bloomington working under the supervision of Qin Zhang and Cenk Sahinalp. Before I come here, I graduated from St. Petersburg Academic University with an MSc degree under the supervision of Fedor Fomin and Alexander Kulikov. I graduated from St. Petersburg State University with BSc degree in Math. I am currently supported by the following grants NSF CCF-1844234 and NSF CCF-2006591. Misc: Sometimes I participate in programming contests (meta profile). |
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 [eprint] |
Batched Coarse Ranking in Multi-Armed Bandits NK, Qin Zhang NeurIPS 2020 [eprint] |
Collaborative Top Distribution Identifications with Limited Interaction NK, Qin Zhang, Yuan Zhou FOCS 2020 [eprint] |
Distributed and Streaming Linear Programming in Low Dimensions Sepehr Assadi, NK, Qin Zhang PODS 2019 [eprint] |
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 RECOMB 2019 [eprint] |
A Multi-labeled Tree Edit Distance for Comparing "Clonal Trees" of Tumor Progression NK, Salem Malikic, Md. Khaledur Rahman, Cenk Sahinalp WABI 2018 [eprint] |
An exponential lower bound for cut sparsifiers in planar graphs NK, Marcin Pilipczuk, Anna Zych-Pawlewicz IPEC 2017 [eprint] |
Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters Ivan Bliznets, NK MFCS 2017 [eprint] |
Parameterized Complexity of Secluded Connectivity Problems Fedor Fomin, Petr Golovach, NK, Alexander Kulikov FSTTCS 2015 [eprint] |
Parameterized Complexity of Superstring Problems Ivan Bliznets, Fedor Fomin, Petr Golovach, NK, Alexander Kulikov, Saket Saurabh CPM 2015 [eprint] |