Red de ordenamiento (Spanish Wikipedia)

Analysis of information sources in references of the Wikipedia article "Red de ordenamiento" in Spanish language version.

refsWebsite

Global rank Spanish rank

2^nd place

2^nd place

69^th place

148^th place

800^th place

3,593^rd place

9,450^th place

low place

1web.archive.org

1^st place

1^st place

1,336^th place

2,461^st place

6^th place

5^th place

archive.org

Mitchell, M. (1998). An Introduction to Genetic Algorithms. MIT Press. pp. 21–27. ISBN 0-262-63185-7.

arxiv.org

Goodrich, Michael (March 2014). «Zig-zag Sort: A Simple Deterministic Data-Oblivious Sorting Algorithm Running in O(n log n) Time». arXiv:1403.2777 [cs.DS].
Bundala, D.; Závodný, J. (2014). «Optimal Sorting Networks». Language and Automata Theory and Applications. Lecture Notes in Computer cience 8370: 236. ISBN 978-3-319-04920-5. arXiv:1310.6271. doi:10.1007/978-3-319-04921-2_19.
Codish, Michael; Cruz-Filipe, Luís; Frank, Michael; Schneider-Kamp, Peter (2014). «Twenty-Five Comparators is Optimal when Sorting Nine Inputs (and Twenty-Nine for Ten)». arXiv:1405.5754 [cs.DM].

doi.org

dx.doi.org

Owens, J. D.; Houston, M.; Luebke, D.; Green, S.; Stone, J. E.; Phillips, J. C. (2008). «GPU Computing». Proceedings of the IEEE 96 (5): 879. doi:10.1109/JPROC.2008.917757.
Ajtai, M.; Komlós, J.; Szemerédi, E. (1983). «An $O (n log n)$ sorting network». Proc. 15th Annual ACM Symp. on the Theory of Computing (STOC). pp. 1-9. ISBN 0897910990. doi:10.1145/800061.808726.
Paterson, M. S. (1990). «Improved sorting networks with $O (log N)$ depth». Algorithmica 5: 75-92. doi:10.1007/BF01840378.
Bundala, D.; Závodný, J. (2014). «Optimal Sorting Networks». Language and Automata Theory and Applications. Lecture Notes in Computer cience 8370: 236. ISBN 978-3-319-04920-5. arXiv:1310.6271. doi:10.1007/978-3-319-04921-2_19.

espacenet.com

v3.espacenet.com

O'Connor, Daniel G. & Nelson, "Sorting system with $n$ -line sorting switch", {{{country-code}}} {{{patent-number}}}.

kent.edu

cs.kent.edu

Batcher,, K. E. (1968). Sorting networks and their applications. Proc. AFIPS Spring Joint Computer Conference. pp. 307-314.

unt.edu

larc.unt.edu

Parberry, Ian (1991). «A Computer Assisted Optimal Depth Lower Bound for Nine-Input Sorting Networks». Mathematical Systems Theory 24: 101-116. Archivado desde el original el 3 de marzo de 2016. Consultado el 28 de diciembre de 2014.

web.archive.org

Parberry, Ian (1991). «A Computer Assisted Optimal Depth Lower Bound for Nine-Input Sorting Networks». Mathematical Systems Theory 24: 101-116. Archivado desde el original el 3 de marzo de 2016. Consultado el 28 de diciembre de 2014.