Author:
Borodin A.,Guibas L.J.,Lynch N.A.,Yao A.C.
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference6 articles.
1. An optimal data structure for minimal-storage dynamic member searching;Bentley;CMU,1978
2. Time bounds for selection;Blum;J. Comput. System Sci.,1973
3. A decomposition theorem for partially ordered sets;Dilworth;Ann. of Math.,1950
4. Finding the Median;Schönhage;J. Comput. System Sci.,1976
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Lazy Search Trees;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11
2. Robust and Adaptive Search;LEIBNIZ INT PR INFOR;2017
3. On searching a table consistent with division poset;Theoretical Computer Science;2007-02
4. The number of tests required to search an unordered table;Information Processing Letters;2003-07
5. A tradeoff between search and update in dictionaries;Information Processing Letters;2001-12-15