default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNikolai Karpov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Nikolai Karpov, Haoyu Zhang, Qin Zhang
:
MinJoin++: a fast algorithm for string similarity joins under edit distance. VLDB J. 33(2): 281-299 (2024)- [c10]Nikolai Karpov, Qin Zhang:
Communication-Efficient Collaborative Regret Minimization in Multi-Armed Bandits. AAAI 2024: 13076-13084 - [c9]Nikolai Karpov, Qin Zhang:
Parallel Best Arm Identification in Heterogeneous Environments. SPAA 2024: 53-64 - 2023
- [c8]Nikolai Karpov, Qin Zhang:
Communication-Efficient Collaborative Best Arm Identification. AAAI 2023: 8203-8210 - [i8]Nikolai Karpov, Qin Zhang:
Collaborative Regret Minimization in Multi-Armed Bandits. CoRR abs/2301.11442 (2023) - 2022
- [j3]Nikolai Karpov, Qin Zhang:
SyncSignature: A Simple, Efficient, Parallelizable Framework for Tree Similarity Joins. Proc. VLDB Endow. 16(2): 330-342 (2022) - [c7]Nikolai Karpov, Qin Zhang:
Instance-Sensitive Algorithms for Pure Exploration in Multinomial Logit Bandit. AAAI 2022: 7096-7103 - [i7]Nikolai Karpov, Qin Zhang:
Collaborative Best Arm Identification with Limited Communication on Non-IID Data. CoRR abs/2207.08015 (2022) - [i6]Nikolai Karpov, Qin Zhang:
Communication-Efficient Collaborative Best Arm Identification. CoRR abs/2208.09029 (2022) - 2021
- [i5]Nikolai Karpov, Qin Zhang:
Batched Thompson Sampling for Multi-Armed Bandits. CoRR abs/2108.06812 (2021) - 2020
- [c6]Nikolai Karpov, Qin Zhang, Yuan Zhou:
Collaborative Top Distribution Identifications with Limited Interaction (Extended Abstract). FOCS 2020: 160-171 - [c5]Nikolai Karpov, Qin Zhang:
Batched Coarse Ranking in Multi-Armed Bandits. NeurIPS 2020 - [i4]Nikolai Karpov, Qin Zhang, Yuan Zhou:
Collaborative Top Distribution Identifications with Limited Interaction. CoRR abs/2004.09454 (2020) - [i3]Nikolai Karpov, Qin Zhang:
Instance-Sensitive Algorithms for Pure Exploration in Multinomial Logit Bandit. CoRR abs/2012.01499 (2020)
2010 – 2019
- 2019
- [j2]Nikolai Karpov, Marcin Pilipczuk, Anna Zych-Pawlewicz:
An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs. Algorithmica 81(10): 4029-4042 (2019) - [j1]Nikolai Karpov, Salem Malikic, Md. Khaledur Rahman, Süleyman Cenk Sahinalp:
A multi-labeled tree dissimilarity measure for comparing "clonal trees" of tumor progression. Algorithms Mol. Biol. 14(1): 17:1-17:18 (2019) - [c4]Sepehr Assadi, Nikolai Karpov, Qin Zhang:
Distributed and Streaming Linear Programming in Low Dimensions. PODS 2019: 236-253 - [c3]Can Kockan, Kaiyuan Zhu, Natnatee Dokmai, Nikolai Karpov, M. Oguzhan Külekci, David P. Woodruff, Süleyman Cenk Sahinalp:
Sketching Algorithms for Genomic Data Analysis and Querying in a Secure Enclave. RECOMB 2019: 302-304 - [i2]Sepehr Assadi, Nikolai Karpov, Qin Zhang:
Distributed and Streaming Linear Programming in Low Dimensions. CoRR abs/1903.05617 (2019) - 2018
- [c2]Nikolai Karpov, Salem Malikic, Md. Khaledur Rahman, Süleyman Cenk Sahinalp:
A Multi-labeled Tree Edit Distance for Comparing "Clonal Trees" of Tumor Progression. WABI 2018: 22:1-22:19 - 2017
- [c1]Nikolai Karpov, Marcin Pilipczuk, Anna Zych-Pawlewicz:
An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs. IPEC 2017: 24:1-24:11 - [i1]Nikolai Karpov, Marcin Pilipczuk, Anna Zych-Pawlewicz:
An exponential lower bound for cut sparsifiers in planar graphs. CoRR abs/1706.06086 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-29 00:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
