Jean Vuillemin
- 1 min read
- 2 chapters
Related on Lably
Through Data structure
Contributions
Vuillemin invented the binomial heap[B] and Cartesian tree data structures.[C] With Ron Rivest, he proved the Aanderaa–Rosenberg conjecture, according to which any deterministic algorithm that tests a nontrivial monotone property of graphs, using queries that test whether pairs of vertices are adjacent, must perform a quadratic number of adjacency queries.[A]
In the 1980s, Vuillemin was the director of a project to develop a workstation using VLSI technology, under which the Le Lisp programming language was developed. With Franco P. Preparata, he also introduced the cube-connected cycles as a network topology in parallel computing.[D]
Sign in to keep reading
One more chapter is free with a Lably account.
Education and career
Vuillemin earned an engineering degree at the École Polytechnique in 1968, a doctorate (troisième cycle) at the University of Paris in 1969, a Ph.D. from Stanford University in 1972 under the supervision of Zohar Manna, and a state doctorate from Paris Diderot University in 1974.
He became an assistant professor at the University of California, Berkeley in 1974, but then returned to France in 1975 for a position at the University of Paris-Sud. He moved to the École Polytechnique in 1982, to the Ecole de Management Léonard De Vinci in 1994, and to the École normale supérieure in 1997.