The SCEAS System
Navigation Menu

Journals in DBLP

Random Struct. Algorithms
1999, volume: 15, number: 3-4

  1. Jennifer T. Chayes, Dana Randall
    Foreword. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1999, v:15, n:3-4, pp:209- [Journal]
  2. Dominic Welsh
    The Tutte polynomial. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1999, v:15, n:3-4, pp:210-228 [Journal]
  3. Michael Luby, Eric Vigoda
    Fast convergence of the Glauber dynamics for sampling independent sets. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1999, v:15, n:3-4, pp:229-241 [Journal]
  4. Colin Cooper, Alan M. Frieze
    Mixing properties of the Swendsen-Wang process on classes of graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1999, v:15, n:3-4, pp:242-261 [Journal]
  5. S. Nanda, Charles M. Newman
    Random nearest neighbor and influence graphs on Zd. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1999, v:15, n:3-4, pp:262-278 [Journal]
  6. Boris Pittel, Robert S. Weishaar
    The random bipartite nearest neighbor graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1999, v:15, n:3-4, pp:279-310 [Journal]
  7. Olle Häggström, Robin Pemantle
    On near-critical and dynamical percolation in the tree case. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1999, v:15, n:3-4, pp:311-318 [Journal]
  8. Michael Aizenman, Almut Burchard, Charles M. Newman, David Bruce Wilson
    Scaling limits for minimal and random spanning trees in two dimensions. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1999, v:15, n:3-4, pp:319-367 [Journal]
  9. Christian Borgs, Jennifer T. Chayes, Harry Kesten, Joel Spencer
    Uniform boundedness of critical crossing probabilities implies hyperscaling. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1999, v:15, n:3-4, pp:368-413 [Journal]
  10. Rémi Monasson, Riccardo Zecchina, Scott Kirkpatrick, Bart Selman, Lidror Troyansky
    2+p-SAT: Relation of typical-case complexity to the nature of the phase transition. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1999, v:15, n:3-4, pp:414-435 [Journal]
  11. Michel Talagrand
    Intersecting random half cubes. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1999, v:15, n:3-4, pp:436-449 [Journal]
  12. Richard M. Karp, Claire Kenyon, Orli Waarts
    Error-resilient DNA computation. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1999, v:15, n:3-4, pp:450-466 [Journal]
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