1. Cache-oblivious B-trees;Bender;SIAM J. Comput.,2005
2. An almost optimal algorithm for unbounded searching;Bentley;Inform. Process. Lett.,1976
3. Structure and use of ALGOL 60;Bottenbruch;J. ACM,1962
4. Cache oblivious search trees via binary trees of small height;Brodal,2002
5. M. Eytzinger, Thesaurus principum hac aetate in Europa viventium (Cologne) Aitsingero, Aitsingerum, Eyzingern. 1590.