The SCEAS System
Navigation Menu

Journals in DBLP

Random Struct. Algorithms
1998, volume: 13, number: 3-4

  1. Alois Panholzer, Helmut Prodinger
    A generating functions approach for the analysis of grand averages for multiple QUICKSELECT. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:13, n:3-4, pp:189-209 [Journal]
  2. Ljuben R. Mutafchiev
    The largest tree in certain models of random forests. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:13, n:3-4, pp:211-228 [Journal]
  3. Joel Spencer, Katherine St. John
    Random unary predicates: Almost sure theories and countable models. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:13, n:3-4, pp:229-248 [Journal]
  4. Pontus Andersson
    On the asymptotic distributions of subgraph counts in a random tournament. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:13, n:3-4, pp:249-260 [Journal]
  5. Rainer Kemp
    On the joint distribution of the nodes in uniform multidimensional binary trees. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:13, n:3-4, pp:261-283 [Journal]
  6. Martin E. Dyer, Catherine S. Greenhill
    A more rapidly mixing Markov chain for graph colorings. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:13, n:3-4, pp:285-317 [Journal]
  7. Zhi-Dong Bai, Hsien-Kuei Hwang, Wen-Qi Liang
    Normal approximations of the number of records in geometrically distributed random variables. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:13, n:3-4, pp:319-334 [Journal]
  8. Alexandr V. Kostochka, Vojtech Rödl
    Partial Steiner systems and matchings in hypergraphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:13, n:3-4, pp:335-347 [Journal]
  9. Petr Savický, Alan R. Woods
    The number of Boolean functions computed by formulas of a given size. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:13, n:3-4, pp:349-382 [Journal]
  10. Bernd Kreuter
    Small sublattices in random subsets of Boolean lattices. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:13, n:3-4, pp:383-407 [Journal]
  11. József Balogh, Gábor Pete
    Random disease on the square grid. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:13, n:3-4, pp:409-422 [Journal]
  12. Bernhard Gittenberger
    Convergence of branching processes to the local time of a Bessel process. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:13, n:3-4, pp:423-438 [Journal]
  13. Daniel Panario, L. Bruce Richmond
    Analysis of Ben-Or's polynomial irreducibility test. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:13, n:3-4, pp:439-456 [Journal]
  14. Noga Alon, Michael Krivelevich, Benny Sudakov
    Finding a large hidden clique in a random graph. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:13, n:3-4, pp:457-466 [Journal]
  15. Svante Janson
    New versions of Suen's correlation inequality. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:13, n:3-4, pp:467-483 [Journal]
  16. Tomasz Luczak
    Random trees and random graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:13, n:3-4, pp:485-500 [Journal]
  17. Jerzy Jaworski
    Predecessors in a random mapping. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:13, n:3-4, pp:501-519 [Journal]
  18. Béla Bollobás
    Paul Erdös and probability theory. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:13, n:3-4, pp:521-533 [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