![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Leonid Boytsov
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
- [j5]Leonid Boytsov, Preksha Patel, Vivek Sourabh, Riddhi Nisar, Sayani Kundu, Ramya Ramanathan, Eric Nyberg:
InPars-Light: Cost-Effective Unsupervised Training of Efficient Rankers. Trans. Mach. Learn. Res. 2024 (2024) - 2016
- [j4]Daniel Lemire
, Leonid Boytsov, Nathan Kurz:
SIMD compression and the intersection of sorted integers. Softw. Pract. Exp. 46(6): 723-749 (2016) - 2015
- [j3]Bilegsaikhan Naidan, Leonid Boytsov, Eric Nyberg:
Permutation Search Methods are Efficient, Yet Faster Search is Possible. Proc. VLDB Endow. 8(12): 1618-1629 (2015) - [j2]Daniel Lemire, Leonid Boytsov:
Decoding billions of integers per second through vectorization. Softw. Pract. Exp. 45(1): 1-29 (2015) - 2011
- [j1]Leonid Boytsov:
Indexing methods for approximate dictionary searching: Comparative analysis. ACM J. Exp. Algorithmics 16(1) (2011)
Conference and Workshop Papers
- 2024
- [c18]Rustem Yeshpanov, Pavel Efimov, Leonid Boytsov, Ardak Shalkarbayuli, Pavel Braslavski:
KazQAD: Kazakh Open-Domain Question Answering Dataset. LREC/COLING 2024: 9645-9656 - 2023
- [c17]Pavel Efimov
, Leonid Boytsov, Elena Arslanova, Pavel Braslavski
:
The Impact of Cross-Lingual Adjustment of Contextual Word Representations on Zero-Shot Transfer. ECIR (3) 2023: 51-67 - 2021
- [c16]Leonid Boytsov, Zico Kolter:
Exploring Classic and Neural Lexical Translation Models for Information Retrieval: Interpretability, Effectiveness, and Efficiency Benefits. ECIR (1) 2021: 63-78 - [c15]Iurii Mokrii, Leonid Boytsov, Pavel Braslavski
:
A Systematic Evaluation of Transfer Learning and Pseudo-labeling with BERT-based Ranking Models. SIGIR 2021: 2081-2085 - 2020
- [c14]Pavel Efimov
, Andrey Chertok, Leonid Boytsov, Pavel Braslavski
:
SberQuAD - Russian Reading Comprehension Dataset: Description and Analysis. CLEF 2020: 3-15 - [c13]Chris Kamphuis, Arjen P. de Vries
, Leonid Boytsov, Jimmy Lin:
Which BM25 Do You Mean? A Large-Scale Reproducibility Study of Scoring Variants. ECIR (2) 2020: 28-34 - 2019
- [c12]Leonid Boytsov, Eric Nyberg:
Pruning Algorithms for Low-Dimensional Non-metric k-NN Search: A Case Study. SISAP 2019: 72-85 - [c11]Leonid Boytsov, Eric Nyberg:
Accurate and Fast Retrieval for Complex Non-metric Data via Neighborhood Graphs. SISAP 2019: 128-142 - 2016
- [c10]Leonid Boytsov, David Novak, Yury A. Malkov, Eric Nyberg:
Off the Beaten Path: Let's Replace Term-Based Retrieval with k-NN Search. CIKM 2016: 1099-1108 - 2014
- [c9]Yulia Tsvetkov, Leonid Boytsov, Anatole Gershman, Eric Nyberg, Chris Dyer:
Metaphor Detection with Cross-Lingual Model Transfer. ACL (1) 2014: 248-258 - [c8]Di Wang, Leonid Boytsov, Jun Araki, Alkesh Patel, Jeff Gee, Zhengzhong Liu, Eric Nyberg, Teruko Mitamura:
CMU Multiple-choice Question Answering System at NTCIR-11 QA-Lab. NTCIR 2014 - 2013
- [c7]Leonid Boytsov, Bilegsaikhan Naidan:
Learning to Prune in Metric and Non-Metric Spaces. NIPS 2013: 1574-1582 - [c6]Leonid Boytsov, Anna Belova, Peter Westfall:
Deciding on an adjustment for multiplicity in IR experiments. SIGIR 2013: 403-412 - [c5]Leonid Boytsov, Bilegsaikhan Naidan:
Engineering Efficient and Effective Non-metric Space Library. SISAP 2013: 280-293 - 2012
- [c4]Leonid Boytsov:
Super-Linear Indices for Approximate Dictionary Searching. SISAP 2012: 162-176 - [c3]Leonid Boytsov:
Does Category A Anchor Text Improve Category B Results? TREC 2012 - 2011
- [c2]Leonid Boytsov, Anna Belova:
Evaluating Learning-to-Rank Methods in the Web Track Adhoc Task. TREC 2011 - 2010
- [c1]Leonid Boytsov, Anna Belova:
Lessons Learned From Indexing Close Word Pairs. TREC 2010
Informal and Other Publications
- 2024
- [i19]Leonid Boytsov, Ameya Joshi, Filipe Condessa:
A Curious Case of Remarkable Resilience to Gradient Attacks via Fully Convolutional and Differentiable Front End with a Skip Connection. CoRR abs/2402.17018 (2024) - [i18]Rustem Yeshpanov, Pavel Efimov, Leonid Boytsov, Ardak Shalkarbayuli, Pavel Braslavski:
KazQAD: Kazakh Open-Domain Question Answering Dataset. CoRR abs/2404.04487 (2024) - 2023
- [i17]Leonid Boytsov, Preksha Patel, Vivek Sourabh, Riddhi Nisar, Sayani Kundu, Ramya Ramanathan, Eric Nyberg:
InPars-Light: Cost-Effective Unsupervised Training of Efficient Rankers. CoRR abs/2301.02998 (2023) - 2022
- [i16]Pavel Efimov, Leonid Boytsov, Elena Arslanova, Pavel Braslavski:
The Impact of Cross-Lingual Adjustment of Contextual Word Representations on Zero-Shot Transfer. CoRR abs/2204.06457 (2022) - [i15]Ameya Joshi, Minh Pham, Minsu Cho, Leonid Boytsov, Filipe Condessa, J. Zico Kolter, Chinmay Hegde:
Smooth-Reduce: Leveraging Patches for Improved Certified Robustness. CoRR abs/2205.06154 (2022) - [i14]Leonid Boytsov, Tianyi Lin, Fangwei Gao, Yutian Zhao, Jeffrey Huang, Eric Nyberg:
Understanding Performance of Long-Document Ranking Models through Comprehensive Evaluation and Leaderboarding. CoRR abs/2207.01262 (2022) - 2021
- [i13]Leonid Boytsov, Zico Kolter:
Exploring Classic and Neural Lexical Translation Models for Information Retrieval: Interpretability, Effectiveness, and Efficiency Benefits. CoRR abs/2102.06815 (2021) - [i12]Iurii Mokrii, Leonid Boytsov, Pavel Braslavski:
A Systematic Evaluation of Transfer Learning and Pseudo-labeling with BERT-based Ranking Models. CoRR abs/2103.03335 (2021) - 2020
- [i11]Leonid Boytsov, Eric Nyberg:
Flexible retrieval with NMSLIB and FlexNeuART. CoRR abs/2010.14848 (2020) - [i10]Leonid Boytsov:
Traditional IR rivals neural models on the MS~MARCO Document Ranking Leaderboard. CoRR abs/2012.08020 (2020) - 2019
- [i9]Leonid Boytsov, Eric Nyberg:
Accurate and Fast Retrieval for Complex Non-metric Data via Neighborhood Graphs. CoRR abs/1910.03534 (2019) - [i8]Leonid Boytsov, Eric Nyberg:
Pruning Algorithms for Low-Dimensional Non-metric k-NN Search: A Case Study. CoRR abs/1910.03539 (2019) - [i7]Pavel Efimov, Leonid Boytsov, Pavel Braslavski:
SberQuAD - Russian Reading Comprehension Dataset: Description and Analysis. CoRR abs/1912.09723 (2019) - 2017
- [i6]Leonid Boytsov:
A Simple Derivation of the Heap's Law from the Generalized Zipf's Law. CoRR abs/1711.03066 (2017) - 2016
- [i5]Leonid Boytsov, David Novak, Yury A. Malkov, Eric Nyberg:
Off the Beaten Path: Let's Replace Term-Based Retrieval with k-NN Search. CoRR abs/1610.10001 (2016) - 2015
- [i4]Bilegsaikhan Naidan, Leonid Boytsov, Eric Nyberg:
Permutation Search Methods are Efficient, Yet Faster Search is Possible. CoRR abs/1506.03163 (2015) - [i3]Bilegsaikhan Naidan, Leonid Boytsov:
Non-Metric Space Library Manual. CoRR abs/1508.05470 (2015) - 2014
- [i2]Daniel Lemire, Leonid Boytsov, Nathan Kurz:
SIMD Compression and the Intersection of Sorted Integers. CoRR abs/1401.6399 (2014) - 2012
- [i1]Daniel Lemire, Leonid Boytsov:
Decoding billions of integers per second through vectorization. CoRR abs/1209.2137 (2012)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-08-10 00:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint