Arbre de Van Emde Boas (French Wikipedia)

Analysis of information sources in references of the Wikipedia article "Arbre de Van Emde Boas" in French language version.

refsWebsite

Global rank French rank

3doi.org

2^nd place

3^rd place

2issn.org

57^th place

4^th place

1springerlink.com

2,569^th place

766^th place

1au.dk

8,222^nd place

low place

1web.archive.org

1^st place

1wikiwix.com

194^th place

17^th place

1archive.is

87^th place

20^th place

1googleusercontent.com

243^rd place

21^st place

1sudoc.fr

4,537^th place

247^th place

1books.google.com

3^rd place

11^th place

1mathoverflow.net

low place

9,257^th place

archive.is

Gudmund Skovbjerg Frandsen, « Dynamic algorithms: Course notes on van Emde Boas trees »^{(Archive.org • Wikiwix • Archive.is • Google • Que faire ?)}, University of Aarhus, Department of Computer Science.

au.dk

daimi.au.dk

Gudmund Skovbjerg Frandsen, « Dynamic algorithms: Course notes on van Emde Boas trees »^{(Archive.org • Wikiwix • Archive.is • Google • Que faire ?)}, University of Aarhus, Department of Computer Science.

books.google.com

(en) Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest et Clifford Stein, Introduction to Algorithms, Cambridge (Mass.), MIT Press, 2009, 3^e éd., xix+1312 (ISBN 978-0-262-03384-8, 978-0-262-53305-8 et 9780262259460, SUDOC 136281273, présentation en ligne), « Chapter 20: The van Emde Boas tree », p. 531–560

doi.org

dx.doi.org

Peter van Emde Boas, « Preserving order in a forest in less than logarithmic time », Foundations of Computer Science (Conference Proceedings,‎ 1975, p. 75-84 (ISSN 0272-5428, DOI 10.1109/SFCS.1975.26).
Peter van Emde Boas, « Preserving order in a forest in less than logarithmic time and linear space », Information Processing Letters, vol. 6, n^o 3,‎ 1977, p. 80–82 (ISSN 0020-0190, DOI 10.1016/0020-0190(77)90031-X).
Peter Van Emde Boas, R. Kaas et E. Zijlstra, « Design and implementation of an efficient priority queue », Mathematical Systems Theory, vol. 10,‎ 1976, p. 99–127 (DOI 10.1007/BF01683268l, présentation en ligne)

googleusercontent.com

webcache.googleusercontent.com

Gudmund Skovbjerg Frandsen, « Dynamic algorithms: Course notes on van Emde Boas trees »^{(Archive.org • Wikiwix • Archive.is • Google • Que faire ?)}, University of Aarhus, Department of Computer Science.

issn.org

portal.issn.org

Peter van Emde Boas, « Preserving order in a forest in less than logarithmic time », Foundations of Computer Science (Conference Proceedings,‎ 1975, p. 75-84 (ISSN 0272-5428, DOI 10.1109/SFCS.1975.26).
Peter van Emde Boas, « Preserving order in a forest in less than logarithmic time and linear space », Information Processing Letters, vol. 6, n^o 3,‎ 1977, p. 80–82 (ISSN 0020-0190, DOI 10.1016/0020-0190(77)90031-X).

mathoverflow.net

A. Rex, « Determining the space complexity of van Emde Boas trees ».

springerlink.com

Peter Van Emde Boas, R. Kaas et E. Zijlstra, « Design and implementation of an efficient priority queue », Mathematical Systems Theory, vol. 10,‎ 1976, p. 99–127 (DOI 10.1007/BF01683268l, présentation en ligne)

sudoc.fr

(en) Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest et Clifford Stein, Introduction to Algorithms, Cambridge (Mass.), MIT Press, 2009, 3^e éd., xix+1312 (ISBN 978-0-262-03384-8, 978-0-262-53305-8 et 9780262259460, SUDOC 136281273, présentation en ligne), « Chapter 20: The van Emde Boas tree », p. 531–560

web.archive.org

Gudmund Skovbjerg Frandsen, « Dynamic algorithms: Course notes on van Emde Boas trees »^{(Archive.org • Wikiwix • Archive.is • Google • Que faire ?)}, University of Aarhus, Department of Computer Science.

wikiwix.com

archive.wikiwix.com

Gudmund Skovbjerg Frandsen, « Dynamic algorithms: Course notes on van Emde Boas trees »^{(Archive.org • Wikiwix • Archive.is • Google • Que faire ?)}, University of Aarhus, Department of Computer Science.