Algoritmo galáctico (Spanish Wikipedia)

Analysis of information sources in references of the Wikipedia article "Algoritmo galáctico" in Spanish language version.

refsWebsite

Global rank Spanish rank

8doi.org

2^nd place

3semanticscholar.org

11^th place

79^th place

3arxiv.org

69^th place

148^th place

2mit.edu

415^th place

495^th place

1rjlipton.wordpress.com

low place

1uchicago.edu

230^th place

247^th place

1archives-ouvertes.fr

1,031^st place

2,356^th place

1phys.org

1,283^rd place

2,262^nd place

1theconversation.com

928^th place

1,273^rd place

1quantamagazine.org

6,413^th place

7,477^th place

1harvard.edu

18^th place

34^th place

1issn.org

57^th place

3^rd place

archives-ouvertes.fr (Global: 1,031^st place; Spanish: 2,356^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; Spanish: 148^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, S2CID 2410545, arXiv:1204.1111, doi:10.1109/FOCS.2012.80 .
Anna R. Karlin; Nathan Klein; Shayan Oveis Gharan (2020-09-01). «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.

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

dx.doi.org

Fortnow, L. (2009). «The status of the P versus NP problem». Communications of the ACM 52 (9): 78-86. S2CID 5969255. doi:10.1145/1562164.1562186.
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, S2CID 2410545, arXiv:1204.1111, doi:10.1109/FOCS.2012.80 .
Kawarabayashi, K. I.; Kobayashi, Y.; Reed, B. (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. doi:10.1016/0196-6774(87)90043-5. «citeseerx: 10.1.1.114.3864».
Biaoshuai Tao; Hongjun Wu (2015). Information Security and Privacy. Lecture Notes in Computer Science 9144. pp. 39-56. ISBN 978-3-319-19961-0. doi:10.1007/978-3-319-19962-7_3.
Gagliolo, Matteo (20 de noviembre de 2007). «Universal search». Scholarpedia (en inglés) 2 (11): 2575. Bibcode:2007SchpJ...2.2575G. ISSN 1941-6016. doi:10.4249/scholarpedia.2575.
Liang, Faming, Yichen Cheng, and Guang Lin (2014). «Simulated stochastic approximation annealing for global optimization with a square-root cooling schedule». Journal of the American Statistical Association 109 (506): 847-863. S2CID 123410795. doi:10.1080/01621459.2013.872993.
Ingber, Lester (1993). «Simulated annealing: Practice versus theory». Mathematical and Computer Modelling 18 (11): 29-57. doi:10.1016/0895-7177(93)90204-C.

harvard.edu (Global: 18^th place; Spanish: 34^th place)

adsabs.harvard.edu

Gagliolo, Matteo (20 de noviembre de 2007). «Universal search». Scholarpedia (en inglés) 2 (11): 2575. Bibcode:2007SchpJ...2.2575G. ISSN 1941-6016. doi:10.4249/scholarpedia.2575.

issn.org (Global: 57^th place; Spanish: 3^rd place)

portal.issn.org

Gagliolo, Matteo (20 de noviembre de 2007). «Universal search». Scholarpedia (en inglés) 2 (11): 2575. Bibcode:2007SchpJ...2.2575G. ISSN 1941-6016. doi:10.4249/scholarpedia.2575.

mit.edu (Global: 415^th place; Spanish: 495^th place)

news.mit.edu

Larry Hardesty (19 de enero de 2010). «Explained: The Shannon limit». MIT News Office.

ocw.mit.edu

«Capacity-Approaching Codes».

phys.org (Global: 1,283^rd place; Spanish: 2,262^nd place)

David Harvey (April 2019). «We've found a quicker way to multiply really big numbers». Phys.org.

quantamagazine.org (Global: 6,413^th place; Spanish: 7,477^th place)

Klarreich, Erica (8 de octubre de 2020). «Computer Scientists Break Traveling Salesperson Record». Quanta Magazine.

rjlipton.wordpress.com (Global: low place; Spanish: low place)

Lipton, Richard J., and Kenneth W. Regan (2013). «David Johnson: Galactic Algorithms». People, Problems, and Proofs. Heidelberg: Springer Berlin. pp. 109-112.

semanticscholar.org (Global: 11^th place; Spanish: 79^th place)

api.semanticscholar.org

Fortnow, L. (2009). «The status of the P versus NP problem». Communications of the ACM 52 (9): 78-86. S2CID 5969255. doi:10.1145/1562164.1562186.
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, S2CID 2410545, arXiv:1204.1111, doi:10.1109/FOCS.2012.80 .
Liang, Faming, Yichen Cheng, and Guang Lin (2014). «Simulated stochastic approximation annealing for global optimization with a square-root cooling schedule». Journal of the American Statistical Association 109 (506): 847-863. S2CID 123410795. doi:10.1080/01621459.2013.872993.

theconversation.com (Global: 928^th place; Spanish: 1,273^rd place)

«We've found a quicker way to multiply really big numbers». Cita, de uno de los autores del algoritmo: "El nuevo algoritmo no es realmente práctico en su forma actual, porque la prueba dada en nuestro artículo solo funciona para números ridículamente grandes. Incluso si cada dígito se escribiera en un átomo de hidrógeno, no habría suficiente espacio disponible en el universo observable para escribirlos."

uchicago.edu (Global: 230^th place; Spanish: 247^th place)

people.cs.uchicago.edu

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

Algoritmo galáctico (Spanish Wikipedia)

archives-ouvertes.fr (Global: 1,031st place; Spanish: 2,356th place)

hal.archives-ouvertes.fr

arxiv.org (Global: 69th place; Spanish: 148th place)

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