|
|
|
Books
- 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
- 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
- F. Martinelli, A. Sinclair, and D. Weitz, "Glauber dynamics on trees: Boundary conditions and mixing time," Communications in Mathematical Physics, vol. 250, no. 2, pp. 301-334, Sep. 2004.
- M. Jerrum, A. Sinclair, and E. Vigoda, "A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries," J. ACM, vol. 51, no. 4, pp. 671-697, July 2004.
- Y. Rabani, Y. Rabinovich, and A. Sinclair, "A computational view of population genetics," Random Structures & Algorithms, vol. 12, no. 4, pp. 313-334, July 1998.
- M. Jerrum and A. Sinclair, "Polynomial-time approximation algorithms for the Ising model," SIAM J. on Computing, vol. 22, no. 5, pp. 1087-1116, Oct. 1993.
Articles in conference proceedings
- Y. Rabinovich, A. Sinclair, and A. Wigderson, "Quadratic dynamical systems," in Proc. 33rd Annual Symp. on Foundations of Computer Science, Los Alamitos, CA: IEEE Computer Society Press, 1992, pp. 304-313.
Technical Reports
|
|
|
