Author:
Elmasry Amr,Jensen Claus,Katajainen Jyrki
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Alstrup, S., Husfeld, T., Rauhe, T., Thorup, M.: Black box for constant-time insertion in priority queues. ACM Transactions on Algorithms 1(1), 102–106 (2005)
2. Bansal, S., Sreekanth, S., Gupta, P.: M-heap: A modified heap data structure. International Journal of Foundations of Computer Science 14(3), 491–502 (2003)
3. Brodal, G.S., Okasaki, C.: Optimal purely functional priority queues. Journal of Functional Programming 6(6), 839–857 (1996)
4. Lecture Notes in Computer Science;S. Carlsson,1988
5. Clancy, M.J., Knuth, D.E.: A programming and problem-solving seminar. Technical Report STAN-CS-77-606, Stanford University (1977)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献