Priority queue (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Priority queue" in English language version.

Last modified: 17:19:33, 13 August 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

3217doi.org

2^nd place

82worldcat.org

4^th place

64semanticscholar.org

15^th place

8^th place

51acm.org

1,200^th place

821^st place

33web.archive.org

1^st place

31cmu.edu

2,125^th place

1,347^th place

22arxiv.org

49^th place

31^st place

22au.dk

6,515^th place

7,211^th place

21projecteuclid.org

4,781^st place

3,117^th place

11oracle.com

2,532^nd place

1,847^th place

11ox.ac.uk

541^st place

356^th place

11brilliant.org

low place

11canterbury.ac.nz

low place

6,359^th place

11poly.edu

low place

11uqac.ca

low place

11umich.edu

429^th place

307^th place

11sidsen.org

low place

11ict.ac.cn

low place

11mit.edu

476^th place

340^th place

11geeksforgeeks.org

low place

11uu.se

3,445^th place

3,148^th place

acm.org (Global: 1,200^th place; English: 821^st place)

dl.acm.org

Rönngren, Robert; Ayani, Rassul (1997-04-01). "A comparative study of parallel and sequential priority queue algorithms". ACM Trans. Model. Comput. Simul. 7 (2): 157–209. doi:10.1145/249204.249205. ISSN 1049-3301.

arxiv.org (Global: 49^th place; English: 31^st place)

Iacono, John (2000), "Improved upper bounds for pairing heaps", Proc. 7th Scandinavian Workshop on Algorithm Theory (PDF), Lecture Notes in Computer Science, vol. 1851, Springer-Verlag, pp. 63–77, arXiv:1110.4428, doi:10.1007/3-540-44985-X_5, ISBN 3-540-67690-2
Blelloch, Guy E.; Ferizovic, Daniel; Sun, Yihan (2016), "Just Join for Parallel Ordered Sets", Symposium on Parallel Algorithms and Architectures, Proc. of 28th ACM Symp. Parallel Algorithms and Architectures (SPAA 2016), ACM, pp. 253–264, arXiv:1602.02120, doi:10.1145/2935764.2935768, ISBN 978-1-4503-4210-0, S2CID 2897793

au.dk (Global: 6,515^th place; English: 7,211^th place)

cs.au.dk

Brodal, Gerth Stølting; Lagogiannis, George; Tarjan, Robert E. (2012). Strict Fibonacci heaps (PDF). Proceedings of the 44th symposium on Theory of Computing - STOC '12. pp. 1177–1184. doi:10.1145/2213977.2214082. ISBN 978-1-4503-1245-5.
Brodal, Gerth S. (1996), "Worst-Case Efficient Priority Queues" (PDF), Proc. 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 52–58

brilliant.org (Global: low place; English: low place)

"Binomial Heap | Brilliant Math & Science Wiki". brilliant.org. Retrieved 2019-09-30.

canterbury.ac.nz (Global: low place; English: 6,359^th place)

ir.canterbury.ac.nz

Takaoka, Tadao (1999), Theory of 2–3 Heaps (PDF), p. 12

cmu.edu (Global: 2,125^th place; English: 1,347^th place)

cs.cmu.edu

Sleator, Daniel Dominic; Tarjan, Robert Endre (February 1986). "Self-Adjusting Heaps". SIAM Journal on Computing. 15 (1): 52–69. doi:10.1137/0215004. ISSN 0097-5397.

doi.org (Global: 2^nd place; English: 2^nd place)

Miller Jr., Robert G. (1960). "Priority queues" (PDF). The Annals of Mathematical Statistics. 31. Stanford University: 86–103. doi:10.1214/aoms/1177705990.
Rönngren, Robert; Ayani, Rassul (1997-04-01). "A comparative study of parallel and sequential priority queue algorithms". ACM Trans. Model. Comput. Simul. 7 (2): 157–209. doi:10.1145/249204.249205. ISSN 1049-3301.
Ayani, R. (December 1990). "LR-algorithm: Concurrent operations on priority queues". Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990. pp. 22–25. doi:10.1109/SPDP.1990.143500. ISBN 0-8186-2087-0.
Sleator, Daniel Dominic; Tarjan, Robert Endre (February 1986). "Self-Adjusting Heaps". SIAM Journal on Computing. 15 (1): 52–69. doi:10.1137/0215004. ISSN 0097-5397.
Tarjan, Robert (1983). "3.3. Leftist heaps". Data Structures and Network Algorithms. pp. 38–42. doi:10.1137/1.9781611970265. ISBN 978-0-89871-187-5.
Hayward, Ryan; McDiarmid, Colin (1991). "Average Case Analysis of Heap Building by Repeated Insertion" (PDF). J. Algorithms. 12: 126–153. doi:10.1016/0196-6774(91)90027-v. Archived from the original (PDF) on 2016-02-05. Retrieved 2016-01-28.
Brodal, Gerth Stølting; Okasaki, Chris (November 1996), "Optimal purely functional priority queues", Journal of Functional Programming, 6 (6): 839–857, doi:10.1017/s095679680000201x
Iacono, John (2000), "Improved upper bounds for pairing heaps", Proc. 7th Scandinavian Workshop on Algorithm Theory (PDF), Lecture Notes in Computer Science, vol. 1851, Springer-Verlag, pp. 63–77, arXiv:1110.4428, doi:10.1007/3-540-44985-X_5, ISBN 3-540-67690-2
Fredman, Michael Lawrence (July 1999). "On the Efficiency of Pairing Heaps and Related Data Structures" (PDF). Journal of the Association for Computing Machinery. 46 (4): 473–501. doi:10.1145/320211.320214.
Pettie, Seth (2005). Towards a Final Analysis of Pairing Heaps (PDF). FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science. pp. 174–183. doi:10.1109/SFCS.2005.75. ISBN 0-7695-2468-0.
Haeupler, Bernhard; Sen, Siddhartha; Tarjan, Robert E. (November 2011). "Rank-pairing heaps" (PDF). SIAM J. Computing. 40 (6): 1463–1485. doi:10.1137/100785351.
Fredman, Michael Lawrence; Tarjan, Robert E. (July 1987). "Fibonacci heaps and their uses in improved network optimization algorithms" (PDF). Journal of the Association for Computing Machinery. 34 (3): 596–615. doi:10.1145/28869.28874.
Brodal, Gerth Stølting; Lagogiannis, George; Tarjan, Robert E. (2012). Strict Fibonacci heaps (PDF). Proceedings of the 44th symposium on Theory of Computing - STOC '12. pp. 1177–1184. doi:10.1145/2213977.2214082. ISBN 978-1-4503-1245-5.
Thorup, Mikkel (2007). "Equivalence between priority queues and sorting". Journal of the ACM. 54 (6): 28. doi:10.1145/1314690.1314692. S2CID 11494634.
Sundell, Håkan; Tsigas, Philippas (2005). "Fast and lock-free concurrent priority queues for multi-thread systems". Proceedings International Parallel and Distributed Processing Symposium. Vol. 65. pp. 609–627. doi:10.1109/IPDPS.2003.1213189. ISBN 0-7695-1926-1. S2CID 20995116.
Blelloch, Guy E.; Ferizovic, Daniel; Sun, Yihan (2016), "Just Join for Parallel Ordered Sets", Symposium on Parallel Algorithms and Architectures, Proc. of 28th ACM Symp. Parallel Algorithms and Architectures (SPAA 2016), ACM, pp. 253–264, arXiv:1602.02120, doi:10.1145/2935764.2935768, ISBN 978-1-4503-4210-0, S2CID 2897793
Sanders, Peter; Mehlhorn, Kurt; Dietzfelbinger, Martin; Dementiev, Roman (2019). Sequential and Parallel Algorithms and Data Structures - The Basic Toolbox. Springer International Publishing. pp. 226–229. doi:10.1007/978-3-030-25209-0. ISBN 978-3-030-25208-3. S2CID 201692657.

geeksforgeeks.org (Global: low place; English: low place)

"Prim's Algorithm". Geek for Geeks. 18 November 2012. Archived from the original on 9 September 2014. Retrieved 12 September 2014.

ict.ac.cn (Global: low place; English: low place)

bioinfo.ict.ac.cn

Fredman, Michael Lawrence; Tarjan, Robert E. (July 1987). "Fibonacci heaps and their uses in improved network optimization algorithms" (PDF). Journal of the Association for Computing Machinery. 34 (3): 596–615. doi:10.1145/28869.28874.

mit.edu (Global: 476^th place; English: 340^th place)

courses.csail.mit.edu

"Archived copy" (PDF). Archived (PDF) from the original on 2011-07-20. Retrieved 2011-02-10.{{cite web}}: CS1 maint: archived copy as title (link)

oracle.com (Global: 2,532^nd place; English: 1,847^th place)

docs.oracle.com

"PriorityQueue (Java SE 9 & JDK 9 )". docs.oracle.com. Retrieved 2025-03-13.

ox.ac.uk (Global: 541^st place; English: 356^th place)

stats.ox.ac.uk

Hayward, Ryan; McDiarmid, Colin (1991). "Average Case Analysis of Heap Building by Repeated Insertion" (PDF). J. Algorithms. 12: 126–153. doi:10.1016/0196-6774(91)90027-v. Archived from the original (PDF) on 2016-02-05. Retrieved 2016-01-28.

poly.edu (Global: low place; English: low place)

john2.poly.edu

Iacono, John (2000), "Improved upper bounds for pairing heaps", Proc. 7th Scandinavian Workshop on Algorithm Theory (PDF), Lecture Notes in Computer Science, vol. 1851, Springer-Verlag, pp. 63–77, arXiv:1110.4428, doi:10.1007/3-540-44985-X_5, ISBN 3-540-67690-2

projecteuclid.org (Global: 4,781^st place; English: 3,117^th place)

Miller Jr., Robert G. (1960). "Priority queues" (PDF). The Annals of Mathematical Statistics. 31. Stanford University: 86–103. doi:10.1214/aoms/1177705990.

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

Thorup, Mikkel (2007). "Equivalence between priority queues and sorting". Journal of the ACM. 54 (6): 28. doi:10.1145/1314690.1314692. S2CID 11494634.
Sundell, Håkan; Tsigas, Philippas (2005). "Fast and lock-free concurrent priority queues for multi-thread systems". Proceedings International Parallel and Distributed Processing Symposium. Vol. 65. pp. 609–627. doi:10.1109/IPDPS.2003.1213189. ISBN 0-7695-1926-1. S2CID 20995116.
Blelloch, Guy E.; Ferizovic, Daniel; Sun, Yihan (2016), "Just Join for Parallel Ordered Sets", Symposium on Parallel Algorithms and Architectures, Proc. of 28th ACM Symp. Parallel Algorithms and Architectures (SPAA 2016), ACM, pp. 253–264, arXiv:1602.02120, doi:10.1145/2935764.2935768, ISBN 978-1-4503-4210-0, S2CID 2897793
Sanders, Peter; Mehlhorn, Kurt; Dietzfelbinger, Martin; Dementiev, Roman (2019). Sequential and Parallel Algorithms and Data Structures - The Basic Toolbox. Springer International Publishing. pp. 226–229. doi:10.1007/978-3-030-25209-0. ISBN 978-3-030-25208-3. S2CID 201692657.

sidsen.org (Global: low place; English: low place)

Haeupler, Bernhard; Sen, Siddhartha; Tarjan, Robert E. (November 2011). "Rank-pairing heaps" (PDF). SIAM J. Computing. 40 (6): 1463–1485. doi:10.1137/100785351.

umich.edu (Global: 429^th place; English: 307^th place)

web.eecs.umich.edu

Pettie, Seth (2005). Towards a Final Analysis of Pairing Heaps (PDF). FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science. pp. 174–183. doi:10.1109/SFCS.2005.75. ISBN 0-7695-2468-0.

uqac.ca (Global: low place; English: low place)

Fredman, Michael Lawrence (July 1999). "On the Efficiency of Pairing Heaps and Related Data Structures" (PDF). Journal of the Association for Computing Machinery. 46 (4): 473–501. doi:10.1145/320211.320214.

uu.se (Global: 3,445^th place; English: 3,148^th place)

it.uu.se

Lindén, Jonsson (2013), "A Skiplist-Based Concurrent Priority Queue with Minimal Memory Contention", Technical Report 2018-003 (in German)

web.archive.org (Global: 1^st place; English: 1^st place)

Hayward, Ryan; McDiarmid, Colin (1991). "Average Case Analysis of Heap Building by Repeated Insertion" (PDF). J. Algorithms. 12: 126–153. doi:10.1016/0196-6774(91)90027-v. Archived from the original (PDF) on 2016-02-05. Retrieved 2016-01-28.
"Archived copy" (PDF). Archived (PDF) from the original on 2011-07-20. Retrieved 2011-02-10.{{cite web}}: CS1 maint: archived copy as title (link)
"Prim's Algorithm". Geek for Geeks. 18 November 2012. Archived from the original on 9 September 2014. Retrieved 12 September 2014.

worldcat.org (Global: 4^th place; English: 4^th place)

search.worldcat.org

Rönngren, Robert; Ayani, Rassul (1997-04-01). "A comparative study of parallel and sequential priority queue algorithms". ACM Trans. Model. Comput. Simul. 7 (2): 157–209. doi:10.1145/249204.249205. ISSN 1049-3301.
Sleator, Daniel Dominic; Tarjan, Robert Endre (February 1986). "Self-Adjusting Heaps". SIAM Journal on Computing. 15 (1): 52–69. doi:10.1137/0215004. ISSN 0097-5397.

Priority queue (English Wikipedia)

acm.org (Global: 1,200th place; English: 821st place)

dl.acm.org

arxiv.org (Global: 49th place; English: 31st place)

au.dk (Global: 6,515th place; English: 7,211th place)

cs.au.dk

brilliant.org (Global: low place; English: low place)

canterbury.ac.nz (Global: low place; English: 6,359th place)

ir.canterbury.ac.nz

cmu.edu (Global: 2,125th place; English: 1,347th place)

cs.cmu.edu

doi.org (Global: 2nd place; English: 2nd place)

geeksforgeeks.org (Global: low place; English: low place)

ict.ac.cn (Global: low place; English: low place)

bioinfo.ict.ac.cn

mit.edu (Global: 476th place; English: 340th place)

courses.csail.mit.edu

oracle.com (Global: 2,532nd place; English: 1,847th place)

docs.oracle.com

ox.ac.uk (Global: 541st place; English: 356th place)

stats.ox.ac.uk

poly.edu (Global: low place; English: low place)

john2.poly.edu

projecteuclid.org (Global: 4,781st place; English: 3,117th place)

semanticscholar.org (Global: 15th place; English: 8th place)

api.semanticscholar.org

sidsen.org (Global: low place; English: low place)

umich.edu (Global: 429th place; English: 307th place)

web.eecs.umich.edu

uqac.ca (Global: low place; English: low place)

uu.se (Global: 3,445th place; English: 3,148th place)

it.uu.se

web.archive.org (Global: 1st place; English: 1st place)

worldcat.org (Global: 4th place; English: 4th place)

search.worldcat.org

acm.org (Global: 1,200^th place; English: 821^st place)

arxiv.org (Global: 49^th place; English: 31^st place)

au.dk (Global: 6,515^th place; English: 7,211^th place)

canterbury.ac.nz (Global: low place; English: 6,359^th place)

cmu.edu (Global: 2,125^th place; English: 1,347^th place)

doi.org (Global: 2^nd place; English: 2^nd place)

mit.edu (Global: 476^th place; English: 340^th place)

oracle.com (Global: 2,532^nd place; English: 1,847^th place)

ox.ac.uk (Global: 541^st place; English: 356^th place)

projecteuclid.org (Global: 4,781^st place; English: 3,117^th place)

semanticscholar.org (Global: 15^th place; English: 8^th place)

umich.edu (Global: 429^th place; English: 307^th place)

uu.se (Global: 3,445^th place; English: 3,148^th place)

web.archive.org (Global: 1^st place; English: 1^st place)

worldcat.org (Global: 4^th place; English: 4^th place)