Reference20 articles.
1. Georgy Adelson-Velsky G, Landis E M (1962) An algorithm for the organization of information. Proc USSR Acad Sci (in Russian) 146:263–266. English translation by Myron J Ricci in Sov Math Dokl 3:1259–1263 (1962)
2. Ajtai M, Fredman M, Komlós J (1984) Hash functions for priority queues. Inf Control 63(3):217–225
3. Alstrup S, Brodal GS, Rauhe T (2001) Optimal static range reporting in one dimension. In: Proceedings of the thirty-third annual ACM symposium on theory of computing, Heraklion. ACM, pp 476–482
4. Andersson A, Thorup M (2007) Dynamic ordered sets with exponential search trees. J ACM (JACM) 54(3):13
5. Andersson A, Hagerup T, Nilsson S, Raman R (1998) Sorting in linear time? J Comput Syst Sci 57:74–93
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Predecessor Search;ACM Computing Surveys;2020-10-15