We are currently experiencing cases of mixed-up (and therefore incorrect) metadata for some newly indexed journal issues. We are aware of the problem and we are working on a fix. Thanks for understanding and we apologize for the inconvenience.
Random Structures and Algorithms, Volume 8
Volume 8, Number 1, January 1996 share record
short URL:
https://dblp.org/rec/journals/rsa/Fill96 James Allen Fill :
On the distribution of binary search trees under the random permutation model. 1-25 export record
dblp key:
journals/rsa/SrivastavS96 share record
short URL:
https://dblp.org/rec/journals/rsa/SrivastavS96 share record
short URL:
https://dblp.org/rec/journals/rsa/Howard96 share record
short URL:
https://dblp.org/rec/journals/rsa/SimonsY96 Volume 8, Number 2, March 1996 share record
short URL:
https://dblp.org/rec/journals/rsa/Furedi96 Zoltán Füredi :
Scrambling permutations and entropy of hypergraphs. 97-104 share record
short URL:
https://dblp.org/rec/journals/rsa/Jong96 Peter de Jong :
A central limit theorem with applications to random hypergraphs. 105-120 share record
short URL:
https://dblp.org/rec/journals/rsa/McDiarmid96 Colin McDiarmid :
A random bit-flipping method for seeking agreement. 121-130 share record
short URL:
https://dblp.org/rec/journals/rsa/Fundia96 Andrés D. Fundia :
Derandomizing Chebyshev's inequality to find independent sets in uncrowded hypergraphs. 131-147 share record
short URL:
https://dblp.org/rec/journals/rsa/Kahn96 Jeff Kahn :
A linear programming perspective on the Frankl - Rödl - Pippenger theorem. 149-157 share record
short URL:
https://dblp.org/rec/journals/rsa/Molloy96 Michael Molloy :
A gap between the appearances of a k-core and a (k+1)-chromatic graph. 159-160 Volume 8, Number 3, May 1996 share record
short URL:
https://dblp.org/rec/journals/rsa/RodlT96 share record
short URL:
https://dblp.org/rec/journals/rsa/FillH96 share record
short URL:
https://dblp.org/rec/journals/rsa/Vega96 share record
short URL:
https://dblp.org/rec/journals/rsa/BergE96 J. van den Berg ,
A. Ermakov :
A new lower bound for the critical probability of site percolation on the square lattice. 199-212 share record
short URL:
https://dblp.org/rec/journals/rsa/Roos96 share record
short URL:
https://dblp.org/rec/journals/rsa/Sidorenko96 Volume 8, Number 4, July 1996 share record
short URL:
https://dblp.org/rec/journals/rsa/KestenP96 Harry Kesten ,
Boris Pittel :
A local limit theorem for the number of nodes, the height, and the number of final leaves in a critical branching process tree. 243-299 export record
dblp key:
journals/rsa/Hildebrand96 share record
short URL:
https://dblp.org/rec/journals/rsa/Hildebrand96 share record
short URL:
https://dblp.org/rec/journals/rsa/Hwang96 maintained by
at
Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar
James Allen Fill:
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2018-04-18 20:58 CEST by the dblp team