Polynomial-time counting and sampling of two-rowed contingency tables

A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing

Improved bounds for sampling contingency tables

Random Structures & Algorithms

Random walks on the vertices of transportation polytopes with constant number of sources

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms

Approximate counting by dynamic programming

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing

A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant

Journal of Computer and System Sciences - STOC 2002

Random generation of 2×2×...×2×Jcontingency tables

Theoretical Computer Science

Approximately counting integral flows and cell-bounded contingency tables

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

Approximately Counting Integral Flows and Cell-Bounded Contingency Tables

SIAM Journal on Computing