The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Russ Bubley: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Russ Bubley, Martin E. Dyer
    Path Coupling: A Technique for Proving Rapid Mixing in Markov Chains. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:223-231 [Conf]
  2. Russ Bubley, Martin E. Dyer
    Graph Orientations with No Sink and an Approximation for a Hard Case of #SAT. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:248-257 [Conf]
  3. Russ Bubley, Martin E. Dyer
    Faster Random Generation of Linear Extensions. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:350-354 [Conf]
  4. Russ Bubley, Martin E. Dyer, Catherine S. Greenhill
    Beating the 2 Delta Bound for Approximately Counting Colourings: A Computer-Assisted Proof of Rapid Mixing. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:355-363 [Conf]
  5. Russ Bubley, Martin E. Dyer, Mark Jerrum
    An elementary analysis of a procedure for sampling points in a convex body. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:12, n:3, pp:213-235 [Journal]
  6. Russ Bubley, Martin E. Dyer, Catherine S. Greenhill, Mark Jerrum
    On Approximately Counting Colorings of Small Degree Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:387-400 [Journal]
  7. Russ Bubley, Martin E. Dyer
    Faster random generation of linear extensions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:201, n:1-3, pp:81-88 [Journal]

Search in 0.003secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002