Author:
Barbay Jérémy,Gupta Ankur,Satti Srinivasa Rao,Sorenson Jon
Funder
Millennium Nucleus
University of Chicago
Butler Holcomb Awards
NRF
Ministry of Education, Science and Technology
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference21 articles.
1. The input/output complexity of sorting and related problems;Aggarwal;Commun. ACM,1988
2. Theory and implementation of online multiselection algorithms;Barbay,2013
3. Dynamic online multiselection in internal and external memory;Barbay,2015
4. Fun-sort—or the chaos of unordered binary search;Biedl;Discrete Appl. Math.,2004
5. Time bounds for selection;Blum;J. Comput. Syst. Sci.,1973
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Lazy Search Trees;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11