Alistair Sinclair
Alistair Sinclair (born 1960) is a British computer scientist and computational theorist.Sinclair received his B.A. in mathematics from St. John’s College, Cambridge in 1979, and his Ph.D. in computer science from the University of Edinburgh in 1988 under the supervision of Mark Jerrum. He is professor at the Computer Science division at the University of California, Berkeley and has held faculty positions at University of Edinburgh and visiting positions at DIMACS and the International Computer Science Institute in Berkeley.
Sinclair’s research interests include the design and analysis of randomized algorithms, computational applications of stochastic processes and nonlinear dynamical systems, Monte Carlo methods in statistical physics and combinatorial optimization. With his advisor Mark Jerrum, Sinclair investigated the mixing behaviour of Markov chains to construct approximation algorithms for counting problems such as the computing the permanent, with applications in diverse fields such as matching algorithms, geometric algorithms, mathematical programming, statistics, physics-inspired applications and dynamical systems. This work has been highly influential in theoretical computer science and was recognised with the Gödel Prize in 1996. A refinement of these methods led to a fully polynomial time randomised approximation algorithm for computing the permanent, for which Sinclair and his co-authors received the Fulkerson Prize in 2006.
Sinclair's initial forms part of the name of the GNRS conjecture on metric embeddings of minor-closed graph families. Provided by Wikipedia
Showing 1 - 10 results of 10 for search 'Sinclair, Alistair', query time: 0.05s
Refine Results
In addition to media from the THWS, media from other Bavarian libraries are also displayed.
These are marked with the "Interlibrary loan" label and can be ordered by clicking on them.
These are marked with the "Interlibrary loan" label and can be ordered by clicking on them.
-
1
What is philosophy? an introduction by Sinclair, Alistair
Published 2008Call Number: Loading…Get full text
Located: Loading…
-
2
Algorithms for random generation and counting a Markov chain approach by Sinclair, Alistair
Published 1993Call Number: Loading…
Located: Loading… -
3
Approximate counting, uniform generation and rapidly mixing Markov chains by Sinclair, Alistair
Published 1987Call Number: Loading…
Located: Loading… -
4
Algorithms for random generation and counting a Markov chain approach by Sinclair, Alistair
Published 1993Call Number: Loading…Indexes
Located: Loading…
-
5
When is a graphical sequence stable? by Jerrum, Mark 1955-, MacKay, Brendan, Sinclair, Alistair
Published 1989Call Number: Loading…
Located: Loading… -
6
Randomised algorithms for counting and generating combinatorial structures by Sinclair, Alistair
Published 1988Call Number: Loading…
Located: Loading… -
7
Fast uniform generation of regular graphs by Jerrum, Mark 1955-, Sinclair, Alistair
Published 1988Call Number: Loading…
Located: Loading… -
8
What is philosophy? an introduction by Sinclair, Alistair
Published 2008Call Number: Loading…
Located: Loading… -
9
The answers lie within us towards a science of the human spirit by Sinclair, Alistair
Published 1998Call Number: Loading…
Located: Loading… -
10
Polynomial-time approximation algorithms for the Ising model by Jerrum, Mark 1955-, Sinclair, Alistair
Published 1990Call Number: Loading…
Located: Loading…