default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 13
Volume 13, Number 1, August 1998
- Guy Even, Oded Goldreich
, Michael Luby, Noam Nisan, Boban Velickovic:
Efficient approximation of product distributions. 1-16 - Hsien-Kuei Hwang:
A Poisson * Negative Binomial Convolution Law for Random Polynomials over Finite Fields. 17-47 - Detlef Sieling:
Variable orderings and the size of OBDDs for random partially symmetric Boolean functions. 49-70 - Diane Hernek:
Random generation of 2×n contingency tables. 71-79 - Elchanan Mossel:
Recursive reconstruction on periodic trees. 81-97
Volume 13, Number 2, September 1998
- Devdatt P. Dubhashi, Desh Ranjan:
Balls and bins: A study in negative dependence. 99-124 - C. R. Subramanian, Martin Fürer, C. E. Veni Madhavan:
Algorithms for coloring semi-random graphs. 125-158 - Micah Adler, Soumen Chakrabarti, Michael Mitzenmacher, Lars Eilstrup Rasmussen:
Parallel randomized load balancing. 159-188
Volume 13, Number 3-4, October-December 1998
- Alois Panholzer, Helmut Prodinger:
A generating functions approach for the analysis of grand averages for multiple QUICKSELECT. 189-209 - Ljuben R. Mutafchiev:
The largest tree in certain models of random forests. 211-228 - Joel Spencer, Katherine St. John:
Random unary predicates: Almost sure theories and countable models. 229-248 - Pontus Andersson:
On the asymptotic distributions of subgraph counts in a random tournament. 249-260 - Rainer Kemp:
On the joint distribution of the nodes in uniform multidimensional binary trees. 261-283 - Martin E. Dyer, Catherine S. Greenhill:
A more rapidly mixing Markov chain for graph colorings. 285-317 - Zhi-Dong Bai, Hsien-Kuei Hwang, Wen-Qi Liang:
Normal approximations of the number of records in geometrically distributed random variables. 319-334 - Alexandr V. Kostochka, Vojtech Rödl:
Partial Steiner systems and matchings in hypergraphs. 335-347 - Petr Savický, Alan R. Woods:
The number of Boolean functions computed by formulas of a given size. 349-382 - Bernd Kreuter:
Small sublattices in random subsets of Boolean lattices. 383-407 - József Balogh, Gábor Pete:
Random disease on the square grid. 409-422 - Bernhard Gittenberger:
Convergence of branching processes to the local time of a Bessel process. 423-438 - Daniel Panario, L. Bruce Richmond:
Analysis of Ben-Or's polynomial irreducibility test. 439-456 - Noga Alon, Michael Krivelevich, Benny Sudakov:
Finding a large hidden clique in a random graph. 457-466 - Svante Janson:
New versions of Suen's correlation inequality. 467-483 - Tomasz Luczak:
Random trees and random graphs. 485-500 - Jerzy Jaworski:
Predecessors in a random mapping. 501-519 - Béla Bollobás:
Paul Erdös and probability theory. 521-533
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-04-04 23:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
