( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Random sampling of 3-colorings in Z2.

, , и . Random Struct. Algorithms, 24 (3): 279-302 (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Russell A Berman

Wolter Russell

Dieter Russell

Russell Kleckley

Russell Stinson

 

Другие публикации лиц с тем же именем

Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows., , , , и . SIAM J. Comput., 36 (1): 247-278 (2006)Sampling Adsorbing Staircase Walks Using a New Markov Chain Decomposition Method., и . FOCS, стр. 492-502. IEEE Computer Society, (2000)Fast periodic graph exploration with constant memory., , , , и . J. Comput. Syst. Sci., 74 (5): 808-822 (2008)trong Spatial Mixing for Lattice Graphs with Fewer Colours., , и . FOCS, стр. 562-571. IEEE Computer Society, (2004)Random sampling of 3-colorings in Z2., , и . Random Struct. Algorithms, 24 (3): 279-302 (2004)Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs., и . Comb. Probab. Comput., 15 (3): 411-448 (2006)Pfaffian Algorithms for Sampling Routings on Regions with Free Boundary Conditions., и . RANDOM-APPROX, том 1671 из Lecture Notes in Computer Science, стр. 257-268. Springer, (1999)The Complexity of Approximately Counting Stable Matchings., , и . APPROX-RANDOM, том 6302 из Lecture Notes in Computer Science, стр. 81-94. Springer, (2010)Fast Periodic Graph Exploration with Constant Memory., , , , и . SIROCCO, том 4474 из Lecture Notes in Computer Science, стр. 26-40. Springer, (2007)Strong Spatial Mixing with Fewer Colors for Lattice Graphs., , и . SIAM J. Comput., 35 (2): 486-517 (2005)