Bernard Chazelle (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Bernard Chazelle" in English language version.

refsWebsite

Global rank English rank

741^st place

577^th place

2^nd place

2^nd place

5^th place

5^th place

1books.google.com

3^rd place

3^rd place

451^st place

277^th place

1semanticscholar.org

11^th place

8^th place

1mathgenealogy.org

4,501^st place

3,002^nd place

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

mathscinet.ams.org

Chazelle, Bernard (2000), "A minimum spanning tree algorithm with inverse-Ackermann type complexity", Journal of the Association for Computing Machinery, 47 (6): 1028–47, doi:10.1145/355541.355562, MR 1866456, S2CID 6276962

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

Chazelle, Bernard (2000), The Discrepancy Method: Randomness and Complexity, Cambridge University Press, ISBN 978-0-521-00357-5

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

Chazelle, Bernard (1991), "Triangulating a Simple Polygon in Linear Time", Discrete & Computational Geometry, 6 (3): 485–524, doi:10.1007/BF02574703, ISSN 0179-5376
Chazelle, Bernard (2000), "A minimum spanning tree algorithm with inverse-Ackermann type complexity", Journal of the Association for Computing Machinery, 47 (6): 1028–47, doi:10.1145/355541.355562, MR 1866456, S2CID 6276962

mathgenealogy.org (Global: 4,501^st place; English: 3,002^nd place)

Bernard Chazelle at the Mathematics Genealogy Project

princeton.edu (Global: 741^st place; English: 577^th place)

cs.princeton.edu

"Bernard Chazelle – Curriculum Vitae" (PDF).
Profile, princeton.edu; accessed February 16, 2017.

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

api.semanticscholar.org

Chazelle, Bernard (2000), "A minimum spanning tree algorithm with inverse-Ackermann type complexity", Journal of the Association for Computing Machinery, 47 (6): 1028–47, doi:10.1145/355541.355562, MR 1866456, S2CID 6276962

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

search.worldcat.org

Chazelle, Bernard (1991), "Triangulating a Simple Polygon in Linear Time", Discrete & Computational Geometry, 6 (3): 485–524, doi:10.1007/BF02574703, ISSN 0179-5376