Bernard Chazelle

Bernard Chazelle

Bernard Chazelle (born November 5, 1955) is a professor of computer science at Princeton University. Although he is best known for his invention of the soft heap data structure and the most asymptotically efficient known algorithm for finding minimum spanning trees, most of his work is in computational geometry, where he has found many of the best-known algorithms, such as linear-time triangulation of a simple polygon, as well as many useful complexity results, such as lower bound techniques based on discrepancy theory.

Chazelle originally grew up in Paris, France, where he received his bachelors degree and masters degree in applied mathematics at the Ecole des Mines de Paris in 1977. Then, at the age of 22, he came to Yale University in the United States, where he received his Ph.D. in computer science under the supervision of David P. Dobkin. He went on to claim important research positions at institutions such as Carnegie Mellon, Brown, NEC, Xerox PARC, and the Paris institutions Ecole Normale Supérieure, Ecole Polytechnique, and INRIA. As of 2004, he has 191 published articles, 93 of which are journal articles, and published two books. He has received 18 grants, 12 of which are from the National Science Foundation. He is a fellow of the ACM, the American Academy of Arts and Sciences, the John Simon Guggenheim Memorial Foundation, and NEC, as well as a member of the European Academy of Sciences.

Chazelle has also written a few political essays, such as "Bush's Desolate Imperium" [http://www.cs.princeton.edu/~chazelle/politics/bush-article.html] and "Anti-Americanism: A Clinical Study" [http://www.cs.princeton.edu/~chazelle/politics/antiam.html] , which draw from his life experience in both France and the United States.

References

*Bernard Chazelle, "The Discrepancy Method: Randomness and Complexity" (2001), ISBN 0-521-00357-1
*"Advances in Discrete and Computational Geometry" (B. Chazelle, J.E. Goodman and R. Pollack, eds.) Contemporary Mathematics series, 223, AMS, (1998), ISBN 0-8218-0674-2

External links

* [http://www.cs.princeton.edu/~chazelle/ Chazelle's home page, with publications and CV]


Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • Bernard Chazelle — Saltar a navegación, búsqueda Bernard Chazelle Bernard Chazelle (5 de noviembre de 1955) es un investigador francés en computación de la Universidad de Princeton. Es sobre todo conocido por su invención de la estructura de datos …   Wikipedia Español

  • Bernard Chazelle — (5 de noviembre de 1955) es un investigador francés en computación de la Universidad de Princeton. Es sobre todo conocido por su invención de la estructura de datos Montículo suave y el más asintoticamente eficiente algoritmo conocido para… …   Enciclopedia Universal

  • Fractional cascading — In computer science, fractional cascading is a technique to speed up a sequence of binary searches for the same value in a sequence of related data structures. The first binary search in the sequence takes a logarithmic amount of time, as is… …   Wikipedia

  • Minimum spanning tree — The minimum spanning tree of a planar graph. Each edge is labeled with its weight, which here is roughly proportional to its length. Given a connected, undirected graph, a spanning tree of that graph is a subgraph that is a tree and connects all… …   Wikipedia

  • Triangulation d'un polygone — En géométrie algorithmique, la triangulation d un polygone consiste à décomposer ce polygone en un ensemble (fini) de triangles[1]. Une triangulation d un polygone P est une partition de P en un ensemble de triangles qui ne se recouvrent pas, et… …   Wikipédia en Français

  • Soft heap — In computer science, the soft heap, designed by Bernard Chazelle in 2000, is a variant on the simple heap data structure. By carefully corrupting (increasing) the keys of at most a certain fixed percentage of values in the heap, it is able to… …   Wikipedia

  • Bloom filter — The Bloom filter, conceived by Burton H. Bloom in 1970, is a space efficient probabilistic data structure that is used to test whether an element is a member of a set. False positives are possible, but false negatives are not. Elements can be… …   Wikipedia

  • Liste de personnes par nombre d'Erdős — Voici une liste non exhaustive de personnes ayant un nombre d Erdős de 0, 1 ou 2. Sommaire 1 #0 2 #1 3 #2 4 Référence …   Wikipédia en Français

  • Villechenève — 45° 48′ 49″ N 4° 24′ 25″ E / 45.8136111111, 4.40694444444 …   Wikipédia en Français

  • Polygon triangulation — In computational geometry, polygon triangulation is the decomposition of a polygon into a set of triangles.A triangulation of a polygon P is its partition into non overlapping triangles whose union is P. In the strictest sense, these triangles… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”