The SCEAS System
Navigation Menu

Journals in DBLP

Random Struct. Algorithms
2004, volume: 25, number: 3

  1. Charles Knessl, Wojciech Szpankowski
    On the number of full levels in tries. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:25, n:3, pp:247-276 [Journal]
  2. Jean Bertoin
    Random covering of an interval and a variation of Kingman's coalescent. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:25, n:3, pp:277-292 [Journal]
  3. Christian Mazza
    Simply generated trees, B-series and Wigner processes. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:25, n:3, pp:293-310 [Journal]
  4. Jochen Geiger, Lars Kauffmann
    The shape of large Galton-Watson trees with possibly infinite variance. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:25, n:3, pp:311-335 [Journal]
  5. Timothy Prescott, Francis Edward Su
    Random walks on the torus with several generators. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:25, n:3, pp:336-345 [Journal]
  6. Martin E. Dyer, Catherine S. Greenhill
    Corrigendum: The complexity of counting graph homomorphisms. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:25, n:3, pp:346-352 [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