Author:
Kaporis Alexis,Makris Christos,Sioutas Spyros,Tsakalidis Athanasios,Tsichlas Kostas,Zaroliagis Christos
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference42 articles.
1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)
2. Lecture Notes Comput. Sci.;A. Andersson,1993
3. Anderson, A., Thorup, M.: Tight(er) worst-case bounds on dynamic searching and priority queues. In: Proc. 32nd ACM Symposium on Theory of Computing—STOC 2001, pp. 335–342. ACM, New York (2000). See also http://arxiv.org/abs/cs.DS/0210006
4. Anderson, A., Thorup, M.: Dynamic ordered sets with exponential search trees. J. ACM 54(3), 1–40 (2007). Article 13
5. Atallah, M.J., Goodrich, M., Ramaiyer, K.: Biased finger trees and three-dimensional layers of maxima. In: Proc. 10th ACM Symposium on Computational Geometry, pp. 150–159 (1994)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献