Faculty Publications - Alistair Sinclair


  • A. Sinclair, Algorithms for Random Generation and Counting: A Markov Chain Approach, Progress in Theoretical Computer Science, Boston: Birkhäuser, 1993.

Book chapters or sections

  • I. Bezakova, A. Sinclair, D. Stefankovic, and E. Vigoda, "Negative examples for sequential importance sampling of binary contingency tables," in Algorithms: Proc. 14th Annual European Symp. (ESA 2006), Y. Azar and T. Erlebach, Eds., Lecture Notes in Computer Science, Vol. 4168, Berlin, Germany: Springer-Verlag, 2006, pp. 136-147.
  • S. R. Das and A. Sinclair, "A Markov Chain Monte Carlo Method for Derivative Pricing and Risk Assessment," in The World of Risk Management, H. G. Fong, Ed., London, England, UK: World Scientific Publishing Company Ltd., 2005, pp. 131-150.
  • M. Dyer, A. Sinclair, E. Vigoda, and D. Weitz, "Mixing in time and space for lattice spin systems: A combinatorial view," in Randomization and Approximation Techniques in Computer Science: Proc. 6th Intl. Workshop (RANDOM 2002), J. D. P. Rolim and S. Vadhan, Eds., Lecture Notes in Computer Science, Vol. 2483, Berlin, Germany: Springer-Verlag, 2002, pp. 149-163.
  • A. Condon and R. M. Karp, "Algorithms for graph partitioning on the planted partition model," in Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques: Proc. RANDOM-APPROX '99, D. Hochbaum, K. Jansen, J. D. P. Rolim, and A. Sinclair, Eds., Lecture Notes in Computer Science, Vol. 1671, Berlin, Germany: Springer-Verlag, 1999, pp. 221-232.

Articles in journals or magazines

Articles in conference proceedings

Conference proceedings (edited)

Technical Reports