Author:
Brodal Gerth Stølting,Lagogiannis George,Makris Christos,Tsakalidis Athanasios,Tsichlas Kostas
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference25 articles.
1. G.M. Adel'son-Vel'skii, E.M. Landis, An algorithm for the organization and information, Dokl. Acad. Nauk SSSR 146 263–266 (in Russian) (English Translation in Soviet Math. 3 (1962) 1259–1262.).
2. A. Anderson, M. Thorup, Tight(er) worst-case bounds on dynamic searching and priority queues, in: Proceedings of the 32nd Annual ACM Symposium On Theory of Computing (STOC), ACM, 2000, pp. 335–342.
3. M.J. Atallah, M. Goodrich, K. Ramaiyer, Biased finger trees and three-dimensional layers of maxima, in: Proceedings of the 10th ACM Symposium on Computational Geometry, 1994, pp. 150–159.
4. Pointer machines and pointer algorithms: an annotated bibliography, Technical Report D-351;Ben-Amram,1998
5. Partially persistent data structures of bounded degree with constant update time;Brodal;Nordic J. Comput.,1996
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献