Dijkstra's algorithm (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Dijkstra's algorithm" in English language version.

Last modified: 22:38:22, 4 November 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

2820doi.org

2^nd place

1511semanticscholar.org

15^th place

8^th place

53web.archive.org

1^st place

51mpg.de

1,722^nd place

1,710^th place

44arxiv.org

49^th place

31^st place

31aaai.org

low place

6,393^rd place

33nih.gov

5^th place

22springer.com

182^nd place

172^nd place

21ucl.ac.uk

1,187^th place

756^th place

21mit.edu

476^th place

340^th place

21hdl.handle.net

66^th place

34^th place

11infona.pl

low place

11acm.org

1,200^th place

821^st place

11cwi.nl

low place

11gwdg.de

low place

11tue.nl

9,533^rd place

6,917^th place

11utexas.edu

868^th place

634^th place

11adsabs.harvard.edu

14^th place

9^th place

11ict.ac.cn

low place

11stackexchange.com

4,114^th place

3,027^th place

11sunysb.edu

low place

11umd.edu

1,356^th place

1,172^nd place

11kit.edu

520^th place

7,067^th place

11quantamagazine.org

6,258^th place

4,046^th place

11cornell.edu

308^th place

253^rd place

11tum.de

6,595^th place

8,480^th place

11worldcat.org

4^th place

11archive.org

6^th place

11icm.edu.pl

1,395^th place

4,083^rd place

11unimelb.edu.au

3,366^th place

2,021^st place

aaai.org (Global: low place; English: 6,393^rd place)

Felner, Ariel (2011). Position Paper: Dijkstra's Algorithm versus Uniform Cost Search or a Case Against Dijkstra's Algorithm. Proc. 4th Int'l Symp. on Combinatorial Search. Archived from the original on 18 February 2020. Retrieved 12 February 2015. In a route-finding problem, Felner finds that the queue can be a factor 500–600 smaller, taking some 40% of the running time.

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

amturing.acm.org

Richards, Hamilton. "Edsger Wybe Dijkstra". A.M. Turing Award. Association for Computing Machinery. Retrieved 16 October 2017. At the Mathematical Centre a major project was building the ARMAC computer. For its official inauguration in 1956, Dijkstra devised a program to solve a problem interesting to a nontechnical audience: Given a network of roads connecting cities, what is the shortest route between two designated cities?

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

ui.adsabs.harvard.edu

Prim, R.C. (1957). "Shortest connection networks and some generalizations" (PDF). Bell System Technical Journal. 36 (6): 1389–1401. Bibcode:1957BSTJ...36.1389P. doi:10.1002/j.1538-7305.1957.tb01515.x. Archived from the original (PDF) on 18 July 2017. Retrieved 18 July 2017.

archive.org (Global: 6^th place; English: 6^th place)

Jeff Erickson (29 December 2018). Algorithms by Jeff Erickson. pp. 283–286.

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

Szcześniak, Ireneusz; Jajszczyk, Andrzej; Woźna-Szcześniak, Bożena (2019). "Generic Dijkstra for optical networks". Journal of Optical Communications and Networking. 11 (11): 568–577. arXiv:1810.04481. doi:10.1364/JOCN.11.000568. S2CID 52958911.
Szcześniak, Ireneusz; Woźna-Szcześniak, Bożena (2023), "Generic Dijkstra: Correctness and tractability", NOMS 2023-2023 IEEE/IFIP Network Operations and Management Symposium, pp. 1–7, arXiv:2204.13547, doi:10.1109/NOMS56928.2023.10154322, ISBN 978-1-6654-7716-1, S2CID 248427020
Haeupler, Bernhard; Hladík, Richard; Rozhon, Václav; Tarjan, Robert E.; Tetek, Jakub (2025). "Bidirectional Dijkstra's algorithm is instance-optimal". In Bercea, Ioana Oriana; Pagh, Rasmus (eds.). 2025 Symposium on Simplicity in Algorithms, SOSA 2025, New Orleans, LA, USA, January 13–15, 2025. Society for Industrial and Applied Mathematics. pp. 202–215. arXiv:2410.14638. doi:10.1137/1.9781611978315.16.
Haeupler, Bernhard; Hladík, Richard; Rozhoň, Václav; Tarjan, Robert; Tětek, Jakub (28 October 2024). "Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps". arXiv:2311.11793 [cs.DS].

cornell.edu (Global: 308^th place; English: 253^rd place)

courses.cis.cornell.edu

"23. Shortest Paths | CS 2110". courses.cis.cornell.edu. Retrieved 1 November 2026.

cwi.nl (Global: low place; English: low place)

ir.cwi.nl

Dijkstra, E. W. (1959). "A note on two problems in connexion with graphs" (PDF). Numerische Mathematik. 1: 269–271. doi:10.1007/BF01386390. S2CID 123284777.

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

Fredman & Tarjan 1987. Fredman, Michael Lawrence; Tarjan, Robert E. (1987). "Fibonacci heaps and their uses in improved network optimization algorithms". Journal of the Association for Computing Machinery. 34 (3): 596–615. doi:10.1145/28869.28874. S2CID 7904683.
Frana, Phil (August 2010). "An Interview with Edsger W. Dijkstra". Communications of the ACM. 53 (8): 41–47. doi:10.1145/1787234.1787249. S2CID 27009702.
Dijkstra, E. W. (1959). "A note on two problems in connexion with graphs" (PDF). Numerische Mathematik. 1: 269–271. doi:10.1007/BF01386390. S2CID 123284777.
Mehlhorn, Kurt; Sanders, Peter (2008). "Chapter 10. Shortest Paths" (PDF). Algorithms and Data Structures: The Basic Toolbox. Springer. doi:10.1007/978-3-540-77978-0. ISBN 978-3-540-77977-3.
Schrijver, Alexander (2012). "On the history of the shortest path problem" (PDF). Optimization Stories. Documenta Mathematica Series. Vol. 6. pp. 155–167. doi:10.4171/dms/6/19. ISBN 978-3-936609-58-5.
Szcześniak, Ireneusz; Jajszczyk, Andrzej; Woźna-Szcześniak, Bożena (2019). "Generic Dijkstra for optical networks". Journal of Optical Communications and Networking. 11 (11): 568–577. arXiv:1810.04481. doi:10.1364/JOCN.11.000568. S2CID 52958911.
Szcześniak, Ireneusz; Woźna-Szcześniak, Bożena (2023), "Generic Dijkstra: Correctness and tractability", NOMS 2023-2023 IEEE/IFIP Network Operations and Management Symposium, pp. 1–7, arXiv:2204.13547, doi:10.1109/NOMS56928.2023.10154322, ISBN 978-1-6654-7716-1, S2CID 248427020
Prim, R.C. (1957). "Shortest connection networks and some generalizations" (PDF). Bell System Technical Journal. 36 (6): 1389–1401. Bibcode:1957BSTJ...36.1389P. doi:10.1002/j.1538-7305.1957.tb01515.x. Archived from the original (PDF) on 18 July 2017. Retrieved 18 July 2017.
Gass, Saul; Fu, Michael (2013). "Dijkstra's Algorithm". In Gass, Saul I; Fu, Michael C (eds.). Encyclopedia of Operations Research and Management Science. Vol. 1. Springer. doi:10.1007/978-1-4419-1153-7. ISBN 978-1-4419-1137-7 – via Springer Link.
Fredman & Tarjan 1984. Fredman, Michael Lawrence; Tarjan, Robert E. (1984). Fibonacci heaps and their uses in improved network optimization algorithms. 25th Annual Symposium on Foundations of Computer Science. IEEE. pp. 338–346. doi:10.1109/SFCS.1984.715934.
Sometimes also least-cost-first search: Nau, Dana S. (1983). "Expert computer systems" (PDF). Computer. 16 (2). IEEE: 63–85. doi:10.1109/mc.1983.1654302. S2CID 7301753.
Bauer, Reinhard; Delling, Daniel; Sanders, Peter; Schieferdecker, Dennis; Schultes, Dominik; Wagner, Dorothea (2010). "Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm". ACM Journal of Experimental Algorithmics. 15: 2.1. doi:10.1145/1671970.1671976. S2CID 1661292.
Haeupler, Bernhard; Hladík, Richard; Rozhon, Václav; Tarjan, Robert E.; Tetek, Jakub (2025). "Bidirectional Dijkstra's algorithm is instance-optimal". In Bercea, Ioana Oriana; Pagh, Rasmus (eds.). 2025 Symposium on Simplicity in Algorithms, SOSA 2025, New Orleans, LA, USA, January 13–15, 2025. Society for Industrial and Applied Mathematics. pp. 202–215. arXiv:2410.14638. doi:10.1137/1.9781611978315.16.
Geisberger, Robert; Sanders, Peter; Schultes, Dominik; Delling, Daniel (2008). Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. Experimental Algorithms (WEA 2008). Lecture Notes in Computer Science. Vol. 5038. Springer. pp. 319–333. doi:10.1007/978-3-540-68552-4_24. ISBN 978-3-540-68548-7.
Sanders, Peter; Schultes, Dominik (2005). Highway Hierarchies Hasten Exact Shortest Path Queries. Algorithms – ESA 2005. Lecture Notes in Computer Science. Vol. 3669. Springer. pp. 568–579. doi:10.1007/11561071_51. ISBN 978-3-540-29118-3.
Dial 1969. Dial, Robert B. (1969). "Algorithm 360: Shortest-path forest with topological ordering [H]". Communications of the ACM. 12 (11): 632–633. doi:10.1145/363269.363610. S2CID 6754003.
Ahuja et al. 1990. Ahuja, Ravindra K.; Mehlhorn, Kurt; Orlin, James B.; Tarjan, Robert E. (April 1990). "Faster Algorithms for the Shortest Path Problem" (PDF). Journal of the ACM. 37 (2): 213–223. doi:10.1145/77600.77615. hdl:1721.1/47994. S2CID 5499589.
Thorup 2000. Thorup, Mikkel (2000). "On RAM priority Queues". SIAM Journal on Computing. 30 (1): 86–109. doi:10.1137/S0097539795288246. S2CID 5221089.
Raman 1997. Raman, Rajeev (1997). "Recent results on the single-source shortest paths problem". SIGACT News. 28 (2): 81–87. doi:10.1145/261342.261352. S2CID 18031586.
Shier, Douglas R.; Witzgall, Christoph (1981). "Properties of Labeling Methods for Determining Shortest Path Trees". Journal of Research of the National Bureau of Standards. 86 (3): 317–330. doi:10.6028/jres.086.013. ISSN 0160-1741. PMC 6756282. PMID 34566048. RESULT 7. Under the DIJKSTRA sequence discipline, a labeling method has exponential computational complexity if arcs of negative lengths are admitted

gwdg.de (Global: low place; English: low place)

ftp.gwdg.de

Schrijver, Alexander (2012). "On the history of the shortest path problem" (PDF). Optimization Stories. Documenta Mathematica Series. Vol. 6. pp. 155–167. doi:10.4171/dms/6/19. ISBN 978-3-936609-58-5.

hdl.handle.net (Global: 66^th place; English: 34^th place)

Ahuja et al. 1990. Ahuja, Ravindra K.; Mehlhorn, Kurt; Orlin, James B.; Tarjan, Robert E. (April 1990). "Faster Algorithms for the Shortest Path Problem" (PDF). Journal of the ACM. 37 (2): 213–223. doi:10.1145/77600.77615. hdl:1721.1/47994. S2CID 5499589.

icm.edu.pl (Global: 1,395^th place; English: 4,083^rd place)

matwbn.icm.edu.pl

Sniedovich, M. (2006). "Dijkstra's algorithm revisited: the dynamic programming connexion" (PDF). Journal of Control and Cybernetics. 35 (3): 599–620. Online version of the paper with interactive computational modules.

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

bioinfo.ict.ac.cn

Prim, R.C. (1957). "Shortest connection networks and some generalizations" (PDF). Bell System Technical Journal. 36 (6): 1389–1401. Bibcode:1957BSTJ...36.1389P. doi:10.1002/j.1538-7305.1957.tb01515.x. Archived from the original (PDF) on 18 July 2017. Retrieved 18 July 2017.

infona.pl (Global: low place; English: low place)

Controversial, see Moshe Sniedovich (2006). "Dijkstra's algorithm revisited: the dynamic programming connexion". Control and Cybernetics. 35: 599–620. and below part.

kit.edu (Global: 520^th place; English: 7,067^th place)

publikationen.bibliothek.kit.edu

Bauer, Reinhard; Delling, Daniel; Sanders, Peter; Schieferdecker, Dennis; Schultes, Dominik; Wagner, Dorothea (2010). "Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm". ACM Journal of Experimental Algorithmics. 15: 2.1. doi:10.1145/1671970.1671976. S2CID 1661292.

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

dspace.mit.edu

Ahuja et al. 1990. Ahuja, Ravindra K.; Mehlhorn, Kurt; Orlin, James B.; Tarjan, Robert E. (April 1990). "Faster Algorithms for the Shortest Path Problem" (PDF). Journal of the ACM. 37 (2): 213–223. doi:10.1145/77600.77615. hdl:1721.1/47994. S2CID 5499589.

mpg.de (Global: 1,722^nd place; English: 1,710^th place)

people.mpi-inf.mpg.de

Mehlhorn, Kurt; Sanders, Peter (2008). "Chapter 10. Shortest Paths" (PDF). Algorithms and Data Structures: The Basic Toolbox. Springer. doi:10.1007/978-3-540-77978-0. ISBN 978-3-540-77977-3.

nih.gov (Global: 5^th place; English: 5^th place)

pmc.ncbi.nlm.nih.gov

Shier, Douglas R.; Witzgall, Christoph (1981). "Properties of Labeling Methods for Determining Shortest Path Trees". Journal of Research of the National Bureau of Standards. 86 (3): 317–330. doi:10.6028/jres.086.013. ISSN 0160-1741. PMC 6756282. PMID 34566048. RESULT 7. Under the DIJKSTRA sequence discipline, a labeling method has exponential computational complexity if arcs of negative lengths are admitted

ncbi.nlm.nih.gov

Shier, Douglas R.; Witzgall, Christoph (1981). "Properties of Labeling Methods for Determining Shortest Path Trees". Journal of Research of the National Bureau of Standards. 86 (3): 317–330. doi:10.6028/jres.086.013. ISSN 0160-1741. PMC 6756282. PMID 34566048. RESULT 7. Under the DIJKSTRA sequence discipline, a labeling method has exponential computational complexity if arcs of negative lengths are admitted

pubmed.ncbi.nlm.nih.gov

Shier, Douglas R.; Witzgall, Christoph (1981). "Properties of Labeling Methods for Determining Shortest Path Trees". Journal of Research of the National Bureau of Standards. 86 (3): 317–330. doi:10.6028/jres.086.013. ISSN 0160-1741. PMC 6756282. PMID 34566048. RESULT 7. Under the DIJKSTRA sequence discipline, a labeling method has exponential computational complexity if arcs of negative lengths are admitted

quantamagazine.org (Global: 6,258^th place; English: 4,046^th place)

Brubaker, Ben (25 October 2024). "Computer Scientists Establish the Best Way to Traverse a Graph". Quanta Magazine. Retrieved 9 December 2024.

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

api.semanticscholar.org

Fredman & Tarjan 1987. Fredman, Michael Lawrence; Tarjan, Robert E. (1987). "Fibonacci heaps and their uses in improved network optimization algorithms". Journal of the Association for Computing Machinery. 34 (3): 596–615. doi:10.1145/28869.28874. S2CID 7904683.
Frana, Phil (August 2010). "An Interview with Edsger W. Dijkstra". Communications of the ACM. 53 (8): 41–47. doi:10.1145/1787234.1787249. S2CID 27009702.
Dijkstra, E. W. (1959). "A note on two problems in connexion with graphs" (PDF). Numerische Mathematik. 1: 269–271. doi:10.1007/BF01386390. S2CID 123284777.
Szcześniak, Ireneusz; Jajszczyk, Andrzej; Woźna-Szcześniak, Bożena (2019). "Generic Dijkstra for optical networks". Journal of Optical Communications and Networking. 11 (11): 568–577. arXiv:1810.04481. doi:10.1364/JOCN.11.000568. S2CID 52958911.
Szcześniak, Ireneusz; Woźna-Szcześniak, Bożena (2023), "Generic Dijkstra: Correctness and tractability", NOMS 2023-2023 IEEE/IFIP Network Operations and Management Symposium, pp. 1–7, arXiv:2204.13547, doi:10.1109/NOMS56928.2023.10154322, ISBN 978-1-6654-7716-1, S2CID 248427020
Sometimes also least-cost-first search: Nau, Dana S. (1983). "Expert computer systems" (PDF). Computer. 16 (2). IEEE: 63–85. doi:10.1109/mc.1983.1654302. S2CID 7301753.
Bauer, Reinhard; Delling, Daniel; Sanders, Peter; Schieferdecker, Dennis; Schultes, Dominik; Wagner, Dorothea (2010). "Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm". ACM Journal of Experimental Algorithmics. 15: 2.1. doi:10.1145/1671970.1671976. S2CID 1661292.
Dial 1969. Dial, Robert B. (1969). "Algorithm 360: Shortest-path forest with topological ordering [H]". Communications of the ACM. 12 (11): 632–633. doi:10.1145/363269.363610. S2CID 6754003.
Ahuja et al. 1990. Ahuja, Ravindra K.; Mehlhorn, Kurt; Orlin, James B.; Tarjan, Robert E. (April 1990). "Faster Algorithms for the Shortest Path Problem" (PDF). Journal of the ACM. 37 (2): 213–223. doi:10.1145/77600.77615. hdl:1721.1/47994. S2CID 5499589.
Thorup 2000. Thorup, Mikkel (2000). "On RAM priority Queues". SIAM Journal on Computing. 30 (1): 86–109. doi:10.1137/S0097539795288246. S2CID 5221089.
Raman 1997. Raman, Rajeev (1997). "Recent results on the single-source shortest paths problem". SIGACT News. 28 (2): 81–87. doi:10.1145/261342.261352. S2CID 18031586.

springer.com (Global: 182^nd place; English: 172^nd place)

link.springer.com

Geisberger, Robert; Sanders, Peter; Schultes, Dominik; Delling, Daniel (2008). Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. Experimental Algorithms (WEA 2008). Lecture Notes in Computer Science. Vol. 5038. Springer. pp. 319–333. doi:10.1007/978-3-540-68552-4_24. ISBN 978-3-540-68548-7.
Sanders, Peter; Schultes, Dominik (2005). Highway Hierarchies Hasten Exact Shortest Path Queries. Algorithms – ESA 2005. Lecture Notes in Computer Science. Vol. 3669. Springer. pp. 568–579. doi:10.1007/11561071_51. ISBN 978-3-540-29118-3.

stackexchange.com (Global: 4,114^th place; English: 3,027^th place)

cs.stackexchange.com

Observe that p < dist[u] cannot ever hold because of the update dist[v] ← alt when updating the queue. See https://cs.stackexchange.com/questions/118388/dijkstra-without-decrease-key for discussion.

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

cs.sunysb.edu

Chen, M.; Chowdhury, R. A.; Ramachandran, V.; Roche, D. L.; Tong, L. (2007). Priority Queues and Dijkstra's Algorithm – UTCS Technical Report TR-07-54 – 12 October 2007 (PDF). Austin, Texas: The University of Texas at Austin, Department of Computer Sciences.

tue.nl (Global: 9,533^rd place; English: 6,917^th place)

www-set.win.tue.nl

"ARMAC". Unsung Heroes in Dutch Computing History. 2007. Archived from the original on 13 November 2013.

tum.de (Global: 6,595^th place; English: 8,480^th place)

algorithms.discrete.ma.tum.de

"Dijkstra's algorithm". algorithms.discrete.ma.tum.de. Retrieved 1 November 2026.

ucl.ac.uk (Global: 1,187^th place; English: 756^th place)

homepages.ucl.ac.uk

Thomas, Mark (30 May 2020). "Bidirectional Dijkstra". UCL Mathematics Blog. Retrieved 3 October 2025.

umd.edu (Global: 1,356^th place; English: 1,172^nd place)

cs.umd.edu

Sometimes also least-cost-first search: Nau, Dana S. (1983). "Expert computer systems" (PDF). Computer. 16 (2). IEEE: 63–85. doi:10.1109/mc.1983.1654302. S2CID 7301753.

unimelb.edu.au (Global: 3,366^th place; English: 2,021^st place)

ifors.ms.unimelb.edu.au

Sniedovich, M. (2006). "Dijkstra's algorithm revisited: the dynamic programming connexion" (PDF). Journal of Control and Cybernetics. 35 (3): 599–620. Online version of the paper with interactive computational modules.

utexas.edu (Global: 868^th place; English: 634^th place)

cs.utexas.edu

Dijkstra, Edsger W., Reflections on "A note on two problems in connexion with graphs (PDF)

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

Felner, Ariel (2011). Position Paper: Dijkstra's Algorithm versus Uniform Cost Search or a Case Against Dijkstra's Algorithm. Proc. 4th Int'l Symp. on Combinatorial Search. Archived from the original on 18 February 2020. Retrieved 12 February 2015. In a route-finding problem, Felner finds that the queue can be a factor 500–600 smaller, taking some 40% of the running time.
"ARMAC". Unsung Heroes in Dutch Computing History. 2007. Archived from the original on 13 November 2013.
Prim, R.C. (1957). "Shortest connection networks and some generalizations" (PDF). Bell System Technical Journal. 36 (6): 1389–1401. Bibcode:1957BSTJ...36.1389P. doi:10.1002/j.1538-7305.1957.tb01515.x. Archived from the original (PDF) on 18 July 2017. Retrieved 18 July 2017.

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

search.worldcat.org

Shier, Douglas R.; Witzgall, Christoph (1981). "Properties of Labeling Methods for Determining Shortest Path Trees". Journal of Research of the National Bureau of Standards. 86 (3): 317–330. doi:10.6028/jres.086.013. ISSN 0160-1741. PMC 6756282. PMID 34566048. RESULT 7. Under the DIJKSTRA sequence discipline, a labeling method has exponential computational complexity if arcs of negative lengths are admitted

Dijkstra's algorithm (English Wikipedia)

aaai.org (Global: low place; English: 6,393rd place)

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

amturing.acm.org

adsabs.harvard.edu (Global: 14th place; English: 9th place)

ui.adsabs.harvard.edu

archive.org (Global: 6th place; English: 6th place)

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

cornell.edu (Global: 308th place; English: 253rd place)

courses.cis.cornell.edu

cwi.nl (Global: low place; English: low place)

ir.cwi.nl

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

gwdg.de (Global: low place; English: low place)

ftp.gwdg.de

hdl.handle.net (Global: 66th place; English: 34th place)

icm.edu.pl (Global: 1,395th place; English: 4,083rd place)

matwbn.icm.edu.pl

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

bioinfo.ict.ac.cn

infona.pl (Global: low place; English: low place)

kit.edu (Global: 520th place; English: 7,067th place)

publikationen.bibliothek.kit.edu

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

dspace.mit.edu

mpg.de (Global: 1,722nd place; English: 1,710th place)

people.mpi-inf.mpg.de

nih.gov (Global: 5th place; English: 5th place)

pmc.ncbi.nlm.nih.gov

ncbi.nlm.nih.gov

pubmed.ncbi.nlm.nih.gov

quantamagazine.org (Global: 6,258th place; English: 4,046th place)

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

api.semanticscholar.org

springer.com (Global: 182nd place; English: 172nd place)

link.springer.com

stackexchange.com (Global: 4,114th place; English: 3,027th place)

cs.stackexchange.com

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

cs.sunysb.edu

tue.nl (Global: 9,533rd place; English: 6,917th place)

www-set.win.tue.nl

tum.de (Global: 6,595th place; English: 8,480th place)

algorithms.discrete.ma.tum.de

ucl.ac.uk (Global: 1,187th place; English: 756th place)

homepages.ucl.ac.uk

umd.edu (Global: 1,356th place; English: 1,172nd place)

cs.umd.edu

unimelb.edu.au (Global: 3,366th place; English: 2,021st place)

ifors.ms.unimelb.edu.au

utexas.edu (Global: 868th place; English: 634th place)

cs.utexas.edu

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

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

search.worldcat.org

aaai.org (Global: low place; English: 6,393^rd place)

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

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

archive.org (Global: 6^th place; English: 6^th place)

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

cornell.edu (Global: 308^th place; English: 253^rd place)

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

hdl.handle.net (Global: 66^th place; English: 34^th place)

icm.edu.pl (Global: 1,395^th place; English: 4,083^rd place)

kit.edu (Global: 520^th place; English: 7,067^th place)

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

mpg.de (Global: 1,722^nd place; English: 1,710^th place)

nih.gov (Global: 5^th place; English: 5^th place)

quantamagazine.org (Global: 6,258^th place; English: 4,046^th place)

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

springer.com (Global: 182^nd place; English: 172^nd place)

stackexchange.com (Global: 4,114^th place; English: 3,027^th place)

tue.nl (Global: 9,533^rd place; English: 6,917^th place)

tum.de (Global: 6,595^th place; English: 8,480^th place)

ucl.ac.uk (Global: 1,187^th place; English: 756^th place)

umd.edu (Global: 1,356^th place; English: 1,172^nd place)

unimelb.edu.au (Global: 3,366^th place; English: 2,021^st place)

utexas.edu (Global: 868^th place; English: 634^th place)

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

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