Alistair Sinclair
Alistair Sinclair (* 1960 ) is a British computer scientist. He is a professor at the University of California, Berkeley .
Sinclair studied at the University of Cambridge with a bachelor's degree in 1979 and received his doctorate in 1988 under Mark Jerrum at the University of Edinburgh (Randomized algorithms for counting and generating combinatorial structures). He taught in Edinburgh and is a professor at Berkeley .
He was visiting scholar at DIMACS (Center of Discrete Mathematics and Computer Science) at Rutgers University and at the International Computer Science Institute (ICSI) in Berkeley.
He deals with the design of randomized algorithms, combinatorial optimization, Monte Carlo methods and numerical applications in statistical physics, in stochastic processes and nonlinear dynamic systems. With Jerrum he investigated the mixing properties of Markov chains for the construction of approximation algorithms in combinatorial problems such as the computation of the permanent in polynomial time .
In 1996 he received the Gödel Prize with Mark Jerrum and in 2006 the Fulkerson Prize with Jerrum and his doctoral student Eric Vigoda (for their work A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries , Journal of the ACM, vol. 51, 2004).
Web links
Individual evidence
- ↑ Alistair Sinclair in the Mathematics Genealogy Project (English)
| personal data | |
|---|---|
| SURNAME | Sinclair, Alistair |
| BRIEF DESCRIPTION | British computer scientist |
| DATE OF BIRTH | 1960 |