Journals in DBLP
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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ]