An implicit binomial queue with constant insertion time-Reference-Cited by-同舟云学术

An implicit binomial queue with constant insertion time

Published:1988 Issue: Volume: Page:1-13
ISSN:0302-9743
Container-title:SWAT 88
language:
Short-container-title:

Author:

Carlsson Svante,Munro J. Ian,Poblete Patricio V.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-19487-8_1.pdf

Reference12 articles.

1. S. Carlsson, Heaps, doctoral dissertation, Department of Computer Science, Lund University, Lund, Sweden, CODEN: LUNFD6/ (NFCS-1003)/(1-70)/(1986)

2. M. J. Clancy and D. E. Knuth, A programming and problem-solving seminar, Technical report, Computer Science Department, School of Humanities and Science, Stanford University, STAN-CS-77-606, (April 1977)

3. E. E. Doberkat, Deleting the root of a heap, Acta Informatica, 17 (1982), 245–265

4. E. E. Doberkat, Inserting a new element into a heap, BIT, 21, (1981), 255–269

5. M. L. Fredman and R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, Proc. 25th Annual IEEE Symp. on Found. of Comput. Sci., (1984), 338–346

Cited by 22 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Regular numeral systems for data structures;Acta Informatica;2021-07-25

2. Asynchronous Parallel Dijkstra’s Algorithm on Intel Xeon Phi Processor;Algorithms and Architectures for Parallel Processing;2018

3. Optimizing Binary Heaps;Theory of Computing Systems;2017-04-21

4. Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time;Lecture Notes in Computer Science;2015

5. A SIMPLE ARRAY VERSION OF M-HEAP;International Journal of Foundations of Computer Science;2014-01