Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. G. M. Adel'son-Vel'skii and E. M. Landis. An Algorithm for the Organisation of Information. Dokl. Akad. Nauk SSSR, 146:263–266, 1962. In Russian. English translation in Soviet Math. Dokl., 3:1259–1263, 1962.
2. A. Andersson. Optimal bounds on the dictionary problem. In Proc. Symp. on Optimal Algorithms, Varna, volume 401 of LNCS, pages 106–114. Springer-Verlag, 1989.
3. A. Andersson. Efficient Search Trees. PhD thesis, Department of Computer Science, Lund University, Sweden, 1990.
4. A. Andersson, C. Icking, R. Klein, and T. Ottmann. Binary search trees of almost optimal height. Acta Informatica, 28:165–178, 1990.
5. A. Andersson and T. W. Lai. Fast updating of well-balanced trees. In SWAT'90, volume 447 of LNCS, pages 111–121. Springer-Verlag, 1990.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献