Подписаться
Nikolai Karpov
Nikolai Karpov
Indiana University
Подтвержден адрес электронной почты в домене iu.edu - Главная страница
Название
Процитировано
Процитировано
Год
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
402020
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
202019
An exponential lower bound for cut sparsifiers in planar graphs
N Karpov, M Pilipczuk, A Zych-Pawlewicz
Algorithmica 81, 4029-4042, 2019
152019
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
142018
Parameterized complexity of secluded connectivity problems
FV Fomin, PA Golovach, N Karpov, AS Kulikov
Theory of Computing Systems 61, 795-819, 2017
132017
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
112020
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
102019
Batched coarse ranking in multi-armed bandits
N Karpov, Q Zhang
Conference on Neural Information Processing Systems (NeurIPS), 2020
52020
Collaborative best arm identification with limited communication on non-iid data
N Karpov, Q Zhang
arXiv preprint arXiv:2207.08015, 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
Parameterized algorithms for partitioning graphs into highly connected clusters
I Bliznets, N Karpov
arXiv preprint arXiv:1706.09487, 2017
22017
Collaborative Regret Minimization in Multi-Armed Bandits
N Karpov, Q Zhang
arXiv preprint arXiv:2301.11442, 2023
2023
SyncSignature: a simple, efficient, parallelizable framework for tree similarity joins
N Karpov, Q Zhang
Proceedings of the VLDB Endowment 16 (2), 330-342, 2022
2022
Communication-Efficient Collaborative Best Arm Identification
N Karpov, Q Zhang
arXiv preprint arXiv:2208.09029, 2022
2022
Batched Thompson Sampling for Multi-Armed Bandits
N Karpov, Q Zhang
arXiv preprint arXiv:2108.06812, 2021
2021
Parameterized Complexity of Superstring Problems
I Bliznets, FV Fomin, PA Golovach, N Karpov, AS Kulikov, S Saurabh
Combinatorial Pattern Matching: 26th Annual Symposium, CPM 2015, Ischia …, 2015
2015
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–16