Search the dblp DataBase
Alistair Sinclair :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Alistair Sinclair , Mark Jerrum Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains [Citation Graph (1, 0)][DBLP ] Inf. Comput., 1989, v:82, n:1, pp:93-133 [Journal ] Mark Jerrum , Alistair Sinclair Approximating the Permanent. [Citation Graph (1, 0)][DBLP ] SIAM J. Comput., 1989, v:18, n:6, pp:1149-1178 [Journal ] Ivona Bezáková , Alistair Sinclair , Daniel Stefankovic , Eric Vigoda Negative Examples for Sequential Importance Sampling of Binary Contingency Tables. [Citation Graph (0, 0)][DBLP ] ESA, 2006, pp:136-147 [Conf ] Steve Chien , Alistair Sinclair Algebras with Polynomial Identities and Computing the Determinant. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:352-361 [Conf ] Anupam Gupta , Ilan Newman , Yuri Rabinovich , Alistair Sinclair Cuts, Trees and l1 -Embeddings of Graphs. [Citation Graph (0, 0)][DBLP ] FOCS, 1999, pp:399-409 [Conf ] Thomas P. Hayes , Alistair Sinclair A general lower bound for mixing of single-site dynamics on graphs. [Citation Graph (0, 0)][DBLP ] FOCS, 2005, pp:511-520 [Conf ] Fabio Martinelli , Alistair Sinclair , Dror Weitz The Ising Model on Trees: Boundary Conditions and Mixing Time. [Citation Graph (0, 0)][DBLP ] FOCS, 2003, pp:628-639 [Conf ] Michael Luby , Dana Randall , Alistair Sinclair Markov Chain Algorithms for Planar Lattice Structures (Extended Abstract). [Citation Graph (0, 0)][DBLP ] FOCS, 1995, pp:150-159 [Conf ] Ben Morris , Alistair Sinclair Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions. [Citation Graph (0, 0)][DBLP ] FOCS, 1999, pp:230-240 [Conf ] Elchanan Mossel , Yuval Peres , Alistair Sinclair Shuffling by Semi-Random Transpositions. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:572-581 [Conf ] Yuval Rabani , Alistair Sinclair , Rolf Wanka Local Divergence of Markov Chains and the Analysis of Iterative Load Balancing Schemes. [Citation Graph (0, 0)][DBLP ] FOCS, 1998, pp:694-705 [Conf ] Yuri Rabinovich , Alistair Sinclair , Avi Wigderson Quadratic Dynamical Systems (Preliminary Version) [Citation Graph (0, 0)][DBLP ] FOCS, 1992, pp:304-313 [Conf ] Mark Jerrum , Alistair Sinclair Polynomial-Time Approximation Algorithms for Ising Model (Extended Abstract). [Citation Graph (0, 0)][DBLP ] ICALP, 1990, pp:462-475 [Conf ] Michael Luby , Alistair Sinclair , David Zuckerman Optimal Speedup of Las Vegas Algorithms. [Citation Graph (0, 0)][DBLP ] ISTCS, 1993, pp:128-133 [Conf ] Alistair Sinclair Improved Bounds for Mixing Rates of Marked Chains and Multicommodity Flow. [Citation Graph (0, 0)][DBLP ] LATIN, 1992, pp:474-487 [Conf ] Martin E. Dyer , Alistair Sinclair , Eric Vigoda , Dror Weitz Mixing in Time and Space for Lattice Spin Systems: A Combinatorial View. [Citation Graph (0, 0)][DBLP ] RANDOM, 2002, pp:149-163 [Conf ] Chandra Chekuri , Anupam Gupta , Ilan Newman , Yuri Rabinovich , Alistair Sinclair Embedding k-outerplanar graphs into l1. [Citation Graph (0, 0)][DBLP ] SODA, 2003, pp:527-536 [Conf ] Claire Kenyon , Yuval Rabani , Alistair Sinclair Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing (Preliminary Version). [Citation Graph (0, 0)][DBLP ] SODA, 1996, pp:351-358 [Conf ] Fabio Martinelli , Alistair Sinclair , Dror Weitz Fast mixing for independent sets, colorings and other models on trees. [Citation Graph (0, 0)][DBLP ] SODA, 2004, pp:456-465 [Conf ] Ashwin Nayak , Alistair Sinclair , Uri Zwick Spatial Codes and the Hardness of String Folding Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP ] SODA, 1998, pp:639-648 [Conf ] Dana Randall , Alistair Sinclair Testable Algorithms for Self-Avoiding Walks. [Citation Graph (0, 0)][DBLP ] SODA, 1994, pp:593-602 [Conf ] Steve Chien , Lars Eilstrup Rasmussen , Alistair Sinclair Clifford algebras and approximating the permanent. [Citation Graph (0, 0)][DBLP ] STOC, 2002, pp:222-231 [Conf ] Mark Jerrum , Alistair Sinclair Conductance and the Rapid Mixing Property for Markov Chains: the Approximation of the Permanent Resolved (Preliminary Version) [Citation Graph (0, 0)][DBLP ] STOC, 1988, pp:235-244 [Conf ] Mark Jerrum , Alistair Sinclair , Eric Vigoda A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:712-721 [Conf ] Claire Kenyon , Yuval Rabani , Alistair Sinclair Low distortion maps between point sets. [Citation Graph (0, 0)][DBLP ] STOC, 2004, pp:272-280 [Conf ] Claire Kenyon , Dana Randall , Alistair Sinclair Matchings in lattice graphs. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:738-746 [Conf ] Yuval Rabani , Yuri Rabinovich , Alistair Sinclair A computational view of population genetics. [Citation Graph (0, 0)][DBLP ] STOC, 1995, pp:83-92 [Conf ] Alistair Sinclair , Mark Jerrum Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains. [Citation Graph (0, 0)][DBLP ] WG, 1987, pp:134-148 [Conf ] Anupam Gupta , Ilan Newman , Yuri Rabinovich , Alistair Sinclair Cuts, Trees and l1 -Embeddings of Graphs. [Citation Graph (0, 0)][DBLP ] Combinatorica, 2004, v:24, n:2, pp:233-269 [Journal ] Alistair Sinclair Improved Bounds for Mixing Rates of Marcov Chains and Multicommodity Flow. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 1992, v:1, n:, pp:351-370 [Journal ] Michael Luby , Alistair Sinclair , David Zuckerman Optimal Speedup of Las Vegas Algorithms. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1993, v:47, n:4, pp:173-180 [Journal ] Mark Jerrum , Alistair Sinclair , Eric Vigoda A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. [Citation Graph (0, 0)][DBLP ] J. ACM, 2004, v:51, n:4, pp:671-697 [Journal ] Claire Kenyon , Yuval Rabani , Alistair Sinclair Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1998, v:27, n:2, pp:218-235 [Journal ] Ashwin Nayak , Alistair Sinclair , Uri Zwick Spatial Codes and the Hardness of String Folding Problems. [Citation Graph (0, 0)][DBLP ] Journal of Computational Biology, 1999, v:6, n:1, pp:13-36 [Journal ] Steve Chien , Lars Eilstrup Rasmussen , Alistair Sinclair Clifford algebras and approximating the permanent. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 2003, v:67, n:2, pp:263-290 [Journal ] Martin E. Dyer , Alistair Sinclair , Eric Vigoda , Dror Weitz Mixing in time and space for lattice spin systems: A combinatorial view. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2004, v:24, n:4, pp:461-479 [Journal ] Yuval Rabani , Yuri Rabinovich , Alistair Sinclair A computational view of population genetics. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1998, v:12, n:4, pp:313-334 [Journal ] Joachim von zur Gathen , Igor Shparlinski , Alistair Sinclair Finding Points on Curves over Finite Fields. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2003, v:32, n:6, pp:1436-1448 [Journal ] Mark Jerrum , Alistair Sinclair Polynomial-Time Approximation Algorithms for the Ising Model. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1993, v:22, n:5, pp:1087-1116 [Journal ] Michael Luby , Dana Randall , Alistair Sinclair Markov Chain Algorithms for Planar Lattice Structures. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2001, v:31, n:1, pp:167-192 [Journal ] Ben Morris , Alistair Sinclair Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2004, v:34, n:1, pp:195-226 [Journal ] Steve Chien , Alistair Sinclair Algebras with Polynomial Identities and Computing the Determinant. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2007, v:37, n:1, pp:252-266 [Journal ] Chandra Chekuri , Anupam Gupta , Ilan Newman , Yuri Rabinovich , Alistair Sinclair Embedding k -Outerplanar Graphs into l 1 . [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2006, v:20, n:1, pp:119-136 [Journal ] Mark Jerrum , Alistair Sinclair Fast Uniform Generation of Regular Graphs. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1990, v:73, n:1, pp:91-100 [Journal ] Steve Chien , Alistair Sinclair Convergence to approximate Nash equilibria in congestion games. [Citation Graph (0, 0)][DBLP ] SODA, 2007, pp:169-178 [Conf ] Elitza N. Maneva , Alistair Sinclair On the Satisfiability Threshold and Clustering of Solutions of Random 3-SAT Formulas [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] Liftings of Tree-Structured Markov Chains - (Extended Abstract). [Citation Graph (, )][DBLP ] Delaying Satisfiability for Random 2SAT. [Citation Graph (, )][DBLP ] Strong and Pareto Price of Anarchy in Congestion Games. [Citation Graph (, )][DBLP ] The extended k -tree algorithm. [Citation Graph (, )][DBLP ] Sherali-adams relaxations of the matching polytope. [Citation Graph (, )][DBLP ] Mixing time for the solid-on-solid model. [Citation Graph (, )][DBLP ] Mobile Geometric Graphs, and Detection and Communication Problems in Mobile Wireless Networks [Citation Graph (, )][DBLP ] Mobile Geometric Graphs: Detection, Coverage and Percolation [Citation Graph (, )][DBLP ] Mixing Time for the Solid-on-Solid Model [Citation Graph (, )][DBLP ] Search in 0.004secs, Finished in 0.453secs