default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 9
Volume 9, Number 1-2, August-September 1996
- Laurent Alonso, Philippe Chassaing, René Schott:
The average complexity of a coin-weighing problem. 1-14 - József Beck:
Foundations of positional games. 15-47 - Neil J. Calkin:
Dependent sets of constant weight vectors in GF(q). 49-53 - Fan R. K. Chung, Ronald L. Graham, Shing-Tung Yau:
On sampling with Markov chains. 55-77 - Robert P. Dobrow, Robert T. Smythe:
Poisson approximations for functionals of random trees. 79-92 - Wenceslas Fernandez de la Vega:
The largest induced tree in a sparse random graph. 93-97 - Anna Gál, Avi Wigderson:
Boolean complexity classes vs. their arithmetic analogs. 99-111 - Hans Garmo:
Random railways modeled as random 3-regular graphs. 113-136 - Erhard Godehardt, Jerzy Jaworski:
On the connectivity of a random interval graph. 137-161 - Thomas Hofmeister, Hanno Lefmann:
A combinatorial design approach to MAXCUT. 163-175 - Alexander K. Kelmans:
On graphs with the maximum number of spanning trees. 177-192 - János Komlós, Gábor N. Sárközy, Endre Szemerédi:
On the square of a Hamiltonian cycle in dense graphs. 193-211 - Alexandr V. Kostochka:
An intersection theorem for systems of sets. 213-221 - James Gary Propp, David Bruce Wilson:
Exact sampling with coupled Markov chains and applications to statistical mechanics. 223-252 - Nicholas C. Wormald:
The perturbation method and triangle-free random graphs. 253-269
Volume 9, Number 3, October 1996
- Noga Alon:
Independence numbers of locally sparse graphs and a Ramsey type problem. 271-278 - William Baritompa, Mike A. Steel:
Bounds on absorption times of directionally biased random sequences. 279-293 - Olle Häggström, Ronald W. J. Meester:
Nearest neighbor and hard sphere models in continuum percolation. 295-315 - Michael Krivelevich:
Perfect fractional matchings in random hypergraphs. 317-334 - Bernd Kreuter:
Threshold functions for asymmetric Ramsey properties with respect to vertex colorings. 335-348
Volume 9, Number 4, December 1996
- Saharon Shelah:
Very weak zero one law for random graphs with order and random binary functions. 351-358 - Hui Chen, Alan M. Frieze
:
Analysis of parallel algorithms for finding a maximal independent set in a random hypergraph. 359-377 - Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski:
Analysis of a splitting process arising in probabilistic counting and other related algorithms. 379-401 - Peter Winkler, David Zuckerman:
Multiple cover time. 403-411
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 2024-10-31 20:05 CET 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:
