The SCEAS System
Navigation Menu

Journals in DBLP

Random Struct. Algorithms
1990, volume: 1, number: 3

  1. Paul Erdös, Prasad Tetali
    Representations of Integers as the Sum of k Terms. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1990, v:1, n:3, pp:245-262 [Journal]
  2. Graham Brightwell, Peter Winkler
    Maximum itting Time for Random Wlaks on Graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1990, v:1, n:3, pp:263-276 [Journal]
  3. Alexandr V. Kostochka
    Matchings in Random Spanning Subgraphs of Cubelike Graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1990, v:1, n:3, pp:277-286 [Journal]
  4. Tomasz Luczak
    Component Behavior Near the Critical Point of the Random Graph Process. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1990, v:1, n:3, pp:287-310 [Journal]
  5. Boris Pittel
    On Tree Census and the Giant Component in Sparse Random Graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1990, v:1, n:3, pp:311-342 [Journal]
  6. Zoltán Szabó
    An Application of Lovász's Local Lemma - A New Lower Bound for the van der Waerden Number. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1990, v:1, n:3, pp:343-360 [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