Galactic algorithm (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Galactic algorithm" in English language version.

refsWebsite

Global rank English rank

21doi.org

2^nd place

5arxiv.org

69^th place

59^th place

4semanticscholar.org

11^th place

8^th place

4harvard.edu

18^th place

17^th place

4mit.edu

415^th place

327^th place

3worldcat.org

5^th place

2psu.edu

207^th place

136^th place

2quantamagazine.org

6,413^th place

4,268^th place

2web.archive.org

1^st place

1books.google.com

3^rd place

1cmu.edu

1,564^th place

1,028^th place

1acm.org

1,185^th place

840^th place

1archives-ouvertes.fr

1,031^st place

879^th place

1theconversation.com

928^th place

651^st place

1springer.com

274^th place

309^th place

1github.com

383^rd place

320^th place

1franciscothiesen.github.io

low place

1ams.org

451^st place

277^th place

1handle.net

102^nd place

76^th place

1switzernet.com

low place

1ieee.org

652^nd place

515^th place

acm.org (Global: 1,185^th place; English: 840^th place)

dl.acm.org

Fortnow, Lance (2022). "Fifty Years of P Versus NP and the Possibility of the Impossible". Communications of the ACM. 65 (1): 76–85. doi:10.1145/3460351.

ams.org (Global: 451^st place; English: 277^th place)

mathscinet.ams.org

Reingold, Omer (2008), "Undirected connectivity in log-space", Journal of the ACM, 55 (4): 1–24, doi:10.1145/1391289.1391291, MR 2445014.

archives-ouvertes.fr (Global: 1,031^st place; English: 879^th place)

hal.archives-ouvertes.fr

David, Harvey; Hoeven, Joris van der (March 2019). "Integer multiplication in time O(n log n)". HAL. hal-02070778.

arxiv.org (Global: 69^th place; English: 59^th place)

Le Gall, F. (2012), "Faster algorithms for rectangular matrix multiplication", Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2012), pp. 514–523, arXiv:1204.1111, doi:10.1109/FOCS.2012.80, ISBN 978-0-7695-4874-6, S2CID 2410545
Anna R. Karlin; Nathan Klein; Shayan Oveis Gharan (September 1, 2020). "A (Slightly) Improved Approximation Algorithm for Metric TSP". arXiv:2007.01409 [cs.DS].
Hutter, Marcus (2002-06-14). "The Fastest and Shortest Algorithm for All Well-Defined Problems". arXiv:cs/0206022.
Li, Tianxiao; Liang, Jingxun; Yu, Huacheng; Zhou, Renfei (6 November 2023). "Tight Cell-Probe Lower Bounds for Dynamic Succinct Dictionaries". 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS). IEEE. pp. 1842–1862. arXiv:2306.02253. doi:10.1109/FOCS57990.2023.00112. ISBN 979-8-3503-1894-4.
Bender, Michael; Farach-Colton, Martin; Kuszmaul, John; Kuszmaul, William; Mingmou, Liu (4 Nov 2021). "On the Optimal Time/Space Tradeoff for Hash Tables". arXiv:2111.00602 [cs].

books.google.com (Global: 3^rd place; English: 3^rd place)

Lipton, Richard J.; Regan, Kenneth W. (2013). "David Johnson: Galactic Algorithms". People, Problems, and Proofs: Essays from Gödel's Lost Letter: 2010. Heidelberg: Springer Berlin. pp. 109–112. ISBN 9783642414220.

cmu.edu (Global: 1,564^th place; English: 1,028^th place)

cs.cmu.edu

Fortnow, L. (2009). "The status of the P versus NP problem" (PDF). Communications of the ACM. 52 (9): 78–86. doi:10.1145/1562164.1562186. S2CID 5969255.

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

Fortnow, L. (2009). "The status of the P versus NP problem" (PDF). Communications of the ACM. 52 (9): 78–86. doi:10.1145/1562164.1562186. S2CID 5969255.
Fortnow, Lance (2022). "Fifty Years of P Versus NP and the Possibility of the Impossible". Communications of the ACM. 65 (1): 76–85. doi:10.1145/3460351.
Le Gall, F. (2012), "Faster algorithms for rectangular matrix multiplication", Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2012), pp. 514–523, arXiv:1204.1111, doi:10.1109/FOCS.2012.80, ISBN 978-0-7695-4874-6, S2CID 2410545
Kawarabayashi, Ken-ichi; Kobayashi, Yusuke; Reed, Bruce (2012). "The disjoint paths problem in quadratic time". Journal of Combinatorial Theory. Series B. 102 (2): 424–435. doi:10.1016/j.jctb.2011.07.004.
Johnson, David S. (1987). "The NP-completeness column: An ongoing guide (edition 19)". Journal of Algorithms. 8 (2): 285–303. CiteSeerX 10.1.1.114.3864. doi:10.1016/0196-6774(87)90043-5.
Biaoshuai Tao & Hongjun Wu (2015). Information Security and Privacy. Lecture Notes in Computer Science. Vol. 9144. pp. 39–56. doi:10.1007/978-3-319-19962-7_3. ISBN 978-3-319-19961-0.
Gagliolo, Matteo (2007-11-20). "Universal search". Scholarpedia. 2 (11): 2575. Bibcode:2007SchpJ...2.2575G. doi:10.4249/scholarpedia.2575. ISSN 1941-6016.
Granville, V.; Krivanek, M.; Rasson, J.-P. (1994). "Simulated annealing: A proof of convergence". IEEE Transactions on Pattern Analysis and Machine Intelligence. 16 (6): 652–656. Bibcode:1994ITPAM..16..652G. doi:10.1109/34.295910.
Nolte, Andreas; Schrader, Rainer (1997), "A Note on the Finite Time Behaviour of Simulated Annealing", Operations Research Proceedings 1996, vol. 1996, Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 175–180, doi:10.1007/978-3-642-60744-8_32, ISBN 978-3-540-62630-5, retrieved 2023-02-06{{citation}}: CS1 maint: work parameter with ISBN (link)
Ingber, Lester (1993). "Simulated annealing: Practice versus theory". Mathematical and Computer Modelling. 18 (11): 29–57. CiteSeerX 10.1.1.15.1046. doi:10.1016/0895-7177(93)90204-C.
Liang, Faming; Cheng, Yichen; Lin, Guang (2014). "Simulated stochastic approximation annealing for global optimization with a square-root cooling schedule". Journal of the American Statistical Association. 109 (506): 847–863. doi:10.1080/01621459.2013.872993. S2CID 123410795.
Karger, David R.; Klein, Philip N.; Tarjan, Robert E. (1995-03-01). "A randomized linear-time algorithm to find minimum spanning trees". Journal of the ACM. 42 (2): 321–328. doi:10.1145/201019.201022. ISSN 0004-5411.
Li, Tianxiao; Liang, Jingxun; Yu, Huacheng; Zhou, Renfei (6 November 2023). "Tight Cell-Probe Lower Bounds for Dynamic Succinct Dictionaries". 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS). IEEE. pp. 1842–1862. arXiv:2306.02253. doi:10.1109/FOCS57990.2023.00112. ISBN 979-8-3503-1894-4.
Reingold, Omer (2008), "Undirected connectivity in log-space", Journal of the ACM, 55 (4): 1–24, doi:10.1145/1391289.1391291, MR 2445014.
Gallager, R.G. (January 1962). "Low density parity check codes". IRE Trans. Inf. Theory. 8 (1): 21–28. Bibcode:1962IRTIT...8...21G. doi:10.1109/TIT.1962.1057683. hdl:1721.1/11804/32786367-MIT. S2CID 260490814.
Andrews, Kenneth S; Divsalar, Dariush; Dolinar, Sam; Hamkins, Jon; Jones, Christopher R; Pollara, Fabrizio (2007). "The development of turbo and LDPC codes for deep-space applications" (PDF). Proceedings of the IEEE. 95 (11). IEEE: 2142–2156. doi:10.1109/JPROC.2007.905132. Archived from the original on 2009-06-20. Retrieved 2025-03-04.{{cite journal}}: CS1 maint: bot: original URL status unknown (link)
MacKay, David JC; Neal, Radford M (1996). "Near Shannon limit performance of low density parity check codes" (PDF). Electronics Letters. 32 (18). IET: 1645–1646. Bibcode:1996ElL....32.1645M. doi:10.1049/el:19961141.
Chazelle, Bernard (1991), "Triangulating a Simple Polygon in Linear Time", Discrete & Computational Geometry, 6 (3): 485–524, doi:10.1007/BF02574703, ISSN 0179-5376
Seidel, Raimund (1991). "A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons". Computational Geometry. 1 (1): 51–64. doi:10.1016/0925-7721(91)90012-4.
Žalik, Borut; Lamot, Marko (2000). "A contribution to triangulation algorithms for simple polygons". Journal of Computing and Information Technology. 8 (4): 319–331. doi:10.2498/cit.2000.04.07.
Lamot, Marko; Žalik, Borut (2003). "A fast polygon triangulation algorithm based on uniform plane subdivision". Computers & Graphics. 27 (2): 239–253. doi:10.1016/S0097-8493(02)00281-9.

franciscothiesen.github.io (Global: low place; English: low place)

Geiman Thiesen, Francisco. "Expected Linear-Time Minimum Spanning Trees". franciscothiesen.github.io. Retrieved 2022-11-13.

github.com (Global: 383^rd place; English: 320^th place)

Thiesen, Francisco. "A C++ implementation for an Expected Linear-Time Minimum Spanning Tree Algorithm(Karger-Klein-Tarjan + Hagerup Minimum Spanning Tree Verification as a sub-routine)". GitHub. Retrieved 2022-11-19.

handle.net (Global: 102^nd place; English: 76^th place)

hdl.handle.net

Gallager, R.G. (January 1962). "Low density parity check codes". IRE Trans. Inf. Theory. 8 (1): 21–28. Bibcode:1962IRTIT...8...21G. doi:10.1109/TIT.1962.1057683. hdl:1721.1/11804/32786367-MIT. S2CID 260490814.

harvard.edu (Global: 18^th place; English: 17^th place)

ui.adsabs.harvard.edu

Gagliolo, Matteo (2007-11-20). "Universal search". Scholarpedia. 2 (11): 2575. Bibcode:2007SchpJ...2.2575G. doi:10.4249/scholarpedia.2575. ISSN 1941-6016.
Granville, V.; Krivanek, M.; Rasson, J.-P. (1994). "Simulated annealing: A proof of convergence". IEEE Transactions on Pattern Analysis and Machine Intelligence. 16 (6): 652–656. Bibcode:1994ITPAM..16..652G. doi:10.1109/34.295910.
Gallager, R.G. (January 1962). "Low density parity check codes". IRE Trans. Inf. Theory. 8 (1): 21–28. Bibcode:1962IRTIT...8...21G. doi:10.1109/TIT.1962.1057683. hdl:1721.1/11804/32786367-MIT. S2CID 260490814.
MacKay, David JC; Neal, Radford M (1996). "Near Shannon limit performance of low density parity check codes" (PDF). Electronics Letters. 32 (18). IET: 1645–1646. Bibcode:1996ElL....32.1645M. doi:10.1049/el:19961141.

ieee.org (Global: 652^nd place; English: 515^th place)

spectrum.ieee.org

Erico Guizzo (Mar 1, 2004). "CLOSING IN ON THE PERFECT CODE". IEEE Spectrum. Archived from the original on September 2, 2021. "Another advantage, perhaps the biggest of all, is that the LDPC patents have expired, so companies can use them without having to pay for intellectual-property rights."

mit.edu (Global: 415^th place; English: 327^th place)

news.mit.edu

Larry Hardesty (January 19, 2010). "Explained: The Shannon limit". MIT News Office.

ocw.mit.edu

"Capacity-approaching codes (Chapter 13 of Principles Of Digital Communication II)" (PDF). MIT OpenCourseWare. 2005.

dspace.mit.edu

Gallager, Robert G. (1960). Low density parity check codes (PDF) (Ph.D thesis). Massachusetts Institute of Technology.

web.mit.edu

Hardesty, L. (January 21, 2010). "Explained: Gallager codes". MIT News. Retrieved August 7, 2013.

psu.edu (Global: 207^th place; English: 136^th place)

citeseerx.ist.psu.edu

Johnson, David S. (1987). "The NP-completeness column: An ongoing guide (edition 19)". Journal of Algorithms. 8 (2): 285–303. CiteSeerX 10.1.1.114.3864. doi:10.1016/0196-6774(87)90043-5.
Ingber, Lester (1993). "Simulated annealing: Practice versus theory". Mathematical and Computer Modelling. 18 (11): 29–57. CiteSeerX 10.1.1.15.1046. doi:10.1016/0895-7177(93)90204-C.

quantamagazine.org (Global: 6,413^th place; English: 4,268^th place)

Klarreich, Erica (8 October 2020). "Computer Scientists Break Traveling Salesperson Record". Quanta Magazine.
Nadis, Steve (8 February 2024). "Scientists Find Optimal Balance of Data Storage and Time". Quanta Magazine. Retrieved 12 February 2025.

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

api.semanticscholar.org

Fortnow, L. (2009). "The status of the P versus NP problem" (PDF). Communications of the ACM. 52 (9): 78–86. doi:10.1145/1562164.1562186. S2CID 5969255.
Le Gall, F. (2012), "Faster algorithms for rectangular matrix multiplication", Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2012), pp. 514–523, arXiv:1204.1111, doi:10.1109/FOCS.2012.80, ISBN 978-0-7695-4874-6, S2CID 2410545
Liang, Faming; Cheng, Yichen; Lin, Guang (2014). "Simulated stochastic approximation annealing for global optimization with a square-root cooling schedule". Journal of the American Statistical Association. 109 (506): 847–863. doi:10.1080/01621459.2013.872993. S2CID 123410795.
Gallager, R.G. (January 1962). "Low density parity check codes". IRE Trans. Inf. Theory. 8 (1): 21–28. Bibcode:1962IRTIT...8...21G. doi:10.1109/TIT.1962.1057683. hdl:1721.1/11804/32786367-MIT. S2CID 260490814.

springer.com (Global: 274^th place; English: 309^th place)

link.springer.com

Nolte, Andreas; Schrader, Rainer (1997), "A Note on the Finite Time Behaviour of Simulated Annealing", Operations Research Proceedings 1996, vol. 1996, Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 175–180, doi:10.1007/978-3-642-60744-8_32, ISBN 978-3-540-62630-5, retrieved 2023-02-06{{citation}}: CS1 maint: work parameter with ISBN (link)

switzernet.com (Global: low place; English: low place)

docs.switzernet.com

MacKay, David JC; Neal, Radford M (1996). "Near Shannon limit performance of low density parity check codes" (PDF). Electronics Letters. 32 (18). IET: 1645–1646. Bibcode:1996ElL....32.1645M. doi:10.1049/el:19961141.

theconversation.com (Global: 928^th place; English: 651^st place)

Harvey, David (9 April 2019). "We've found a quicker way to multiply really big numbers". The Conversation. Retrieved 9 March 2023.

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

Andrews, Kenneth S; Divsalar, Dariush; Dolinar, Sam; Hamkins, Jon; Jones, Christopher R; Pollara, Fabrizio (2007). "The development of turbo and LDPC codes for deep-space applications" (PDF). Proceedings of the IEEE. 95 (11). IEEE: 2142–2156. doi:10.1109/JPROC.2007.905132. Archived from the original on 2009-06-20. Retrieved 2025-03-04.{{cite journal}}: CS1 maint: bot: original URL status unknown (link)
Erico Guizzo (Mar 1, 2004). "CLOSING IN ON THE PERFECT CODE". IEEE Spectrum. Archived from the original on September 2, 2021. "Another advantage, perhaps the biggest of all, is that the LDPC patents have expired, so companies can use them without having to pay for intellectual-property rights."

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

search.worldcat.org

Gagliolo, Matteo (2007-11-20). "Universal search". Scholarpedia. 2 (11): 2575. Bibcode:2007SchpJ...2.2575G. doi:10.4249/scholarpedia.2575. ISSN 1941-6016.
Karger, David R.; Klein, Philip N.; Tarjan, Robert E. (1995-03-01). "A randomized linear-time algorithm to find minimum spanning trees". Journal of the ACM. 42 (2): 321–328. doi:10.1145/201019.201022. ISSN 0004-5411.
Chazelle, Bernard (1991), "Triangulating a Simple Polygon in Linear Time", Discrete & Computational Geometry, 6 (3): 485–524, doi:10.1007/BF02574703, ISSN 0179-5376

Galactic algorithm (English Wikipedia)

acm.org (Global: 1,185th place; English: 840th place)

dl.acm.org

ams.org (Global: 451st place; English: 277th place)

mathscinet.ams.org

archives-ouvertes.fr (Global: 1,031st place; English: 879th place)

hal.archives-ouvertes.fr

arxiv.org (Global: 69th place; English: 59th place)

books.google.com (Global: 3rd place; English: 3rd place)

cmu.edu (Global: 1,564th place; English: 1,028th place)