Subject
Computer Science Applications,General Mathematics,Software
Reference17 articles.
1. G.S. Brodal, Fast meldable priority queues. Proc. of the 4th International Workshop on Algorithms and Data Structures. In vol. 955 of Lect. Notes Comput. Sci. Springer, Berlin/Heidelberg (1995) 282–290.
2. Implementation and Analysis of Binomial Queue Algorithms
3. M.J. Clancy and D.E. Knuth, A programming and problem-solving seminar. Technical report, STAN-CS-77-606. Dept. Comput. Sci., Stanford Univ., Stanford (1977).
4. T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms, 3rd Edition. The MIT Press, Cambridge (2009).
5. Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献