Author:
Joannou Stelios,Raman Rajeev
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Andersson, A., Thorup, M.: Dynamic ordered sets with exponential search trees. J. ACM 54(3), 13 (2007)
2. Arbitman, Y., Naor, M., Segev, G.: Backyard cuckoo hashing: Constant worst-case operations with a succinct representation. In: FOCS, pp. 787–796. IEEE Computer Society, Los Alamitos (2010)
3. Brodal, G.S., Demaine, E.D., Munro, J.I.: Fast allocation and deallocation with an improved buddy system. Acta Inf. 41(4-5), 273–291 (2005)
4. Lecture Notes in Computer Science;A. Brodnik,1999
5. Lecture Notes in Computer Science;A. Farzan,2009
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献