Sampling contingency tables

Towards a polynomial-time randomized algorithm for closed product-form networks

ACM Transactions on Modeling and Computer Simulation (TOMACS)

The risk profile problem for stock portfolio optimization (extended abstract)

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing

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

An O(n2) bound for the relaxation time of a Markov chain on cladograms

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

Fast Unimodular Counting

Combinatorics, Probability and Computing

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

Simulatable auditing

Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients

Journal of Algebraic Combinatorics: An International Journal

Enumerating contingency tables via random permanents

Combinatorics, Probability and Computing

NML computation algorithms for tree-structured multinomial Bayesian networks

EURASIP Journal on Bioinformatics and Systems Biology

On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries

COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics

Restoring compromised privacy in micro-data disclosure

ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security

What does a random contingency table look like?

Combinatorics, Probability and Computing

Approximately Counting Integral Flows and Cell-Bounded Contingency Tables

SIAM Journal on Computing

On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries

Journal of Combinatorial Optimization

Uniformly generating origin destination tables

Information Theory, Combinatorics, and Search Theory

Counting subsets of contingency tables

Computational Statistics