Follow
Nikolai Karpov
Nikolai Karpov
Other namesNikolay Karpov
Genomic Applications Bioinformatician, Oxford Nanopore Technologies
Verified email at nanoporetech.com - Homepage
Title
Cited by
Cited by
Year
Sketching algorithms for genomic data analysis and querying in a secure enclave
C Kockan, K Zhu, N Dokmai, N Karpov, MO Kulekci, DP Woodruff, ...
Nature methods 17 (3), 295-301, 2020
592020
A multi-labeled tree dissimilarity measure for comparing “clonal trees” of tumor progression
N Karpov, S Malikic, MK Rahman, SC Sahinalp
Algorithms for Molecular Biology 14 (1), 1-18, 2019
262019
An exponential lower bound for cut sparsifiers in planar graphs
N Karpov, M Pilipczuk, A Zych-Pawlewicz
Algorithmica 81, 4029-4042, 2019
222019
Collaborative top distribution identifications with limited interaction
N Karpov, Q Zhang, Y Zhou
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
212020
Parameterized complexity of secluded connectivity problems
FV Fomin, PA Golovach, N Karpov, AS Kulikov
Theory of Computing Systems 61, 795-819, 2017
172017
A multi-labeled tree edit distance for comparing" clonal trees" of tumor progression
N Karpov, S Malikic, M Rahman, SC Sahinalp
18th International Workshop on Algorithms in Bioinformatics (WABI 2018), 2018
162018
Distributed and streaming linear programming in low dimensions
S Assadi, N Karpov, Q Zhang
Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on principles of …, 2019
132019
Batched coarse ranking in multi-armed bandits
N Karpov, Q Zhang
Conference on Neural Information Processing Systems (NeurIPS), 2020
72020
Collaborative best arm identification with limited communication on non-IID data
N Karpov, Q Zhang
arXiv preprint arXiv:2207.08015, 2022
62022
Communication-efficient collaborative best arm identification
N Karpov, Q Zhang
Proceedings of the AAAI Conference on Artificial Intelligence 37 (7), 8203-8210, 2023
32023
Parameterized algorithms for partitioning graphs into highly connected clusters
I Bliznets, N Karpov
arXiv preprint arXiv:1706.09487, 2017
32017
42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)
R Impagliazzo, V Kabanets, A Kolokolova, P McKenzie, S Romani, ...
Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2017
32017
SyncSignature: a simple, efficient, parallelizable framework for tree similarity joins
N Karpov, Q Zhang
Proceedings of the VLDB Endowment 16 (2), 2022
22022
Instance-sensitive algorithms for pure exploration in multinomial logit bandit
N Karpov, Q Zhang
Proceedings of the AAAI Conference on Artificial Intelligence 36 (7), 7096-7103, 2022
22022
Collaborative Regret Minimization in Multi-Armed Bandits.
N Karpov, Q Zhang
arXiv preprint arXiv:2301.11442, 2023
12023
Batched Thompson Sampling for Multi-Armed Bandits
N Karpov, Q Zhang
arXiv preprint arXiv:2108.06812, 2021
12021
Parameterized Complexity of Superstring Problems
I Bliznets, FV Fomin, PA Golovach, N Karpov, AS Kulikov, S Saurabh
Annual Symposium on Combinatorial Pattern Matching, 89-99, 2015
12015
Communication-Efficient Collaborative Regret Minimization in Multi-Armed Bandits
N Karpov, Q Zhang
Proceedings of the AAAI Conference on Artificial Intelligence 38 (12), 13076 …, 2024
2024
Collaborative Learning for Bandit Problems
N Karpov
Indiana University, 2024
2024
MinJoin++: a fast algorithm for string similarity joins under edit distance
N Karpov, H Zhang, Q Zhang
The VLDB Journal, 1-19, 2023
2023
The system can't perform the operation now. Try again later.
Articles 1–20