Random generation of 2×2×...×2×Jcontingency tables
Theoretical Computer Science
Approximate/perfect samplers for closed Jackson networks
WSC '05 Proceedings of the 37th conference on Winter simulation
Path coupling without contraction
Journal of Discrete Algorithms
Path coupling using stopping times and counting independent sets and colorings in hypergraphs
Random Structures & Algorithms
A worst-case time upper bound for counting the number of independent sets
CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
A novel method for counting models on grid Boolean formulas
MCPR'10 Proceedings of the 2nd Mexican conference on Pattern recognition: Advances in pattern recognition
Path coupling using stopping times
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
A Threshold for a Polynomial Solution of #2SAT
Fundamenta Informaticae - Latin American Workshop on Logic Languages, Algorithms and New Methods of Reasoning (LANMR)
Hi-index | 0.00 |