( en | de | ru )

 

Disambiguation of "Martin, Russell A."

Author of the publication

copydeleteadd this publication to your clipboard
The Complexity of Approximately Counting Stable Matchings.

, , and . APPROX-RANDOM, volume 6302 of Lecture Notes in Computer Science, page 81-94. Springer, (2010)

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. You can also use the button next to the name to display some publications already assigned to the person.

Russell A Berman

Dieter Russell

Wolter Russell

Russell Kleckley

Russell Stinson

 

Other publications of authors with the same name

trong Spatial Mixing for Lattice Graphs with Fewer Colours., , and . FOCS, page 562-571. IEEE Computer Society, (2004)Pfaffian Algorithms for Sampling Routings on Regions with Free Boundary Conditions., and . RANDOM-APPROX, volume 1671 of Lecture Notes in Computer Science, page 257-268. Springer, (1999)Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs., and . Comb. Probab. Comput., 15 (3): 411-448 (2006)The Complexity of Approximately Counting Stable Matchings., , and . APPROX-RANDOM, volume 6302 of Lecture Notes in Computer Science, page 81-94. Springer, (2010)Sampling Adsorbing Staircase Walks Using a New Markov Chain Decomposition Method., and . FOCS, page 492-502. IEEE Computer Society, (2000)Fast Periodic Graph Exploration with Constant Memory., , , , and . SIROCCO, volume 4474 of Lecture Notes in Computer Science, page 26-40. Springer, (2007)Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows., , , , and . FOCS, page 711-720. IEEE Computer Society, (2002)