Alistair Sinclair

2009
50	EE	Lorenz Minder, Alistair Sinclair: The extended k-tree algorithm. SODA 2009: 586-595
2008
49	EE	Elitza N. Maneva, Alistair Sinclair: On the satisfiability threshold and clustering of solutions of random 3-SAT formulas. Theor. Comput. Sci. 407(1-3): 359-369 (2008)
2007
48	EE	Steve Chien, Alistair Sinclair: Convergence to approximate Nash equilibria in congestion games. SODA 2007: 169-178
47	EE	Elitza N. Maneva, Alistair Sinclair: On the Satisfiability Threshold and Clustering of Solutions of Random 3-SAT Formulas CoRR abs/0710.0805: (2007)
46	EE	Fabio Martinelli, Alistair Sinclair, Dror Weitz: Fast mixing for independent sets, colorings, and other models on trees. Random Struct. Algorithms 31(2): 134-172 (2007)
45	EE	Steve Chien, Alistair Sinclair: Algebras with Polynomial Identities and Computing the Determinant. SIAM J. Comput. 37(1): 252-266 (2007)
2006
44	EE	Ivona Bezáková, Alistair Sinclair, Daniel Stefankovic, Eric Vigoda: Negative Examples for Sequential Importance Sampling of Binary Contingency Tables. ESA 2006: 136-147
43	EE	Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair: Embedding k-Outerplanar Graphs into l 1. SIAM J. Discrete Math. 20(1): 119-136 (2006)
2005
42	EE	Thomas P. Hayes, Alistair Sinclair: A general lower bound for mixing of single-site dynamics on graphs. FOCS 2005: 511-520
2004
41	EE	Steve Chien, Alistair Sinclair: Algebras with Polynomial Identities and Computing the Determinant. FOCS 2004: 352-361
40	EE	Elchanan Mossel, Yuval Peres, Alistair Sinclair: Shuffling by Semi-Random Transpositions. FOCS 2004: 572-581
39	EE	Fabio Martinelli, Alistair Sinclair, Dror Weitz: Fast mixing for independent sets, colorings and other models on trees. SODA 2004: 456-465
38	EE	Claire Kenyon, Yuval Rabani, Alistair Sinclair: Low distortion maps between point sets. STOC 2004: 272-280
37	EE	Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair: Cuts, Trees and l1-Embeddings of Graphs. Combinatorica 24(2): 233-269 (2004)
36	EE	Mark Jerrum, Alistair Sinclair, Eric Vigoda: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. J. ACM 51(4): 671-697 (2004)
35	EE	Martin E. Dyer, Alistair Sinclair, Eric Vigoda, Dror Weitz: Mixing in time and space for lattice spin systems: A combinatorial view. Random Struct. Algorithms 24(4): 461-479 (2004)
34	EE	Ben Morris, Alistair Sinclair: Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions. SIAM J. Comput. 34(1): 195-226 (2004)
2003
33	EE	Fabio Martinelli, Alistair Sinclair, Dror Weitz: The Ising Model on Trees: Boundary Conditions and Mixing Time. FOCS 2003: 628-639
32	EE	Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair: Embedding k-outerplanar graphs into l1. SODA 2003: 527-536
31	EE	Steve Chien, Lars Eilstrup Rasmussen, Alistair Sinclair: Clifford algebras and approximating the permanent. J. Comput. Syst. Sci. 67(2): 263-290 (2003)
30	EE	Joachim von zur Gathen, Igor Shparlinski, Alistair Sinclair: Finding Points on Curves over Finite Fields. SIAM J. Comput. 32(6): 1436-1448 (2003)
2002
29	EE	Martin E. Dyer, Alistair Sinclair, Eric Vigoda, Dror Weitz: Mixing in Time and Space for Lattice Spin Systems: A Combinatorial View. RANDOM 2002: 149-163
28	EE	Steve Chien, Lars Eilstrup Rasmussen, Alistair Sinclair: Clifford algebras and approximating the permanent. STOC 2002: 222-231
2001
27	EE	Mark Jerrum, Alistair Sinclair, Eric Vigoda: A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. STOC 2001: 712-721
26	EE	Michael Luby, Dana Randall, Alistair Sinclair: Markov Chain Algorithms for Planar Lattice Structures. SIAM J. Comput. 31(1): 167-192 (2001)
1999
25		Dorit S. Hochbaum, Klaus Jansen, José D. P. Rolim, Alistair Sinclair: Randomization, Approximation, and Combinatorial Algorithms and Techniques, Third International Workshop on Randomization and Approximation Techniques in Computer Science, and Second International Workshop on Approximation Algorithms for Combinatorial Optimization Problems RANDOM-APPROX'99, Berkeley, CA, USA, August 8-11, 1999, Proceedings Springer 1999
24	EE	Ben Morris, Alistair Sinclair: Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions. FOCS 1999: 230-240
23	EE	Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair: Cuts, Trees and l1-Embeddings of Graphs. FOCS 1999: 399-409
22		Ashwin Nayak, Alistair Sinclair, Uri Zwick: Spatial Codes and the Hardness of String Folding Problems. Journal of Computational Biology 6(1): 13-36 (1999)
1998
21	EE	Yuval Rabani, Alistair Sinclair, Rolf Wanka: Local Divergence of Markov Chains and the Analysis of Iterative Load Balancing Schemes. FOCS 1998: 694-705
20		Ashwin Nayak, Alistair Sinclair, Uri Zwick: Spatial Codes and the Hardness of String Folding Problems (Extended Abstract). SODA 1998: 639-648
19		Claire Kenyon, Yuval Rabani, Alistair Sinclair: Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing. J. Algorithms 27(2): 218-235 (1998)
18		Yuval Rabani, Yuri Rabinovich, Alistair Sinclair: A computational view of population genetics. Random Struct. Algorithms 12(4): 313-334 (1998)
1996
17		Claire Kenyon, Yuval Rabani, Alistair Sinclair: Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing (Preliminary Version). SODA 1996: 351-358
1995
16		Michael Luby, Dana Randall, Alistair Sinclair: Markov Chain Algorithms for Planar Lattice Structures (Extended Abstract). FOCS 1995: 150-159
15	EE	Yuval Rabani, Yuri Rabinovich, Alistair Sinclair: A computational view of population genetics. STOC 1995: 83-92
1994
14		Dana Randall, Alistair Sinclair: Testable Algorithms for Self-Avoiding Walks. SODA 1994: 593-602
1993
13		Michael Luby, Alistair Sinclair, David Zuckerman: Optimal Speedup of Las Vegas Algorithms. ISTCS 1993: 128-133
12	EE	Claire Kenyon, Dana Randall, Alistair Sinclair: Matchings in lattice graphs. STOC 1993: 738-746
11		Michael Luby, Alistair Sinclair, David Zuckerman: Optimal Speedup of Las Vegas Algorithms. Inf. Process. Lett. 47(4): 173-180 (1993)
10		Mark Jerrum, Alistair Sinclair: Polynomial-Time Approximation Algorithms for the Ising Model. SIAM J. Comput. 22(5): 1087-1116 (1993)
1992
9		Yuri Rabinovich, Alistair Sinclair, Avi Wigderson: Quadratic Dynamical Systems (Preliminary Version) FOCS 1992: 304-313
8		Alistair Sinclair: Improved Bounds for Mixing Rates of Marked Chains and Multicommodity Flow. LATIN 1992: 474-487
7		Alistair Sinclair: Improved Bounds for Mixing Rates of Marcov Chains and Multicommodity Flow. Combinatorics, Probability & Computing 1: 351-370 (1992)
1990
6		Mark Jerrum, Alistair Sinclair: Polynomial-Time Approximation Algorithms for Ising Model (Extended Abstract). ICALP 1990: 462-475
5		Mark Jerrum, Alistair Sinclair: Fast Uniform Generation of Regular Graphs. Theor. Comput. Sci. 73(1): 91-100 (1990)
1989
4		Alistair Sinclair, Mark Jerrum: Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains Inf. Comput. 82(1): 93-133 (1989)
3		Mark Jerrum, Alistair Sinclair: Approximating the Permanent. SIAM J. Comput. 18(6): 1149-1178 (1989)
1988
2		Mark Jerrum, Alistair Sinclair: Conductance and the Rapid Mixing Property for Markov Chains: the Approximation of the Permanent Resolved (Preliminary Version) STOC 1988: 235-244
1987
1		Alistair Sinclair, Mark Jerrum: Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains. WG 1987: 134-148

Coauthor Index

1	Ivona Bezáková	[44]
2	Chandra Chekuri	[32] [43]
3	Steve Chien	[28] [31] [41] [45] [48]
4	Martin E. Dyer	[29] [35]
5	Joachim von zur Gathen	[30]
6	Anupam Gupta	[23] [32] [37] [43]
7	Thomas P. Hayes	[42]
8	Dorit S. Hochbaum	[25]
9	Klaus Jansen	[25]
10	Mark Jerrum	[1] [2] [3] [4] [5] [6] [10] [27] [36]
11	Michael Luby	[11] [13] [16] [26]
12	Elitza N. Maneva	[47] [49]
13	Fabio Martinelli	[33] [39] [46]
14	Claire Mathieu (Claire Kenyon, Claire Kenyon-Mathieu)	[12] [17] [19] [38]
15	Lorenz Minder	[50]
16	Ben Morris (Ben J. Morris)	[24] [34]
17	Elchanan Mossel	[40]
18	Ashwin Nayak	[20] [22]
19	Ilan Newman	[23] [32] [37] [43]
20	Yuval Peres	[40]
21	Yuval Rabani	[15] [17] [18] [19] [21] [38]
22	Yuri Rabinovich	[9] [15] [18] [23] [32] [37] [43]
23	Dana Randall	[12] [14] [16] [26]
24	Lars Eilstrup Rasmussen	[28] [31]
25	José D. P. Rolim	[25]
26	Igor Shparlinski	[30]
27	Daniel Stefankovic	[44]
28	Eric Vigoda	[27] [29] [35] [36] [44]
29	Rolf Wanka	[21]
30	Dror Weitz	[29] [33] [35] [39] [46]
31	Avi Wigderson	[9]
32	David Zuckerman	[11] [13]
33	Uri Zwick	[20] [22]

Colors in the list of coauthors