Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 11
Volume 11, Number 1, August 1997
- Ravi Kannan, László Lovász, Miklós Simonovits:
Random walks and an O*(n5) volume algorithm for convex bodies. 1-50 - Dudley Stark:
Total variation asymptotics for independent process approximations of logarithmic multisets and selections. 51-80 - Michael Cramer:
Stochastic analysis of the Merge-Sort algorithm. 81-96
Volume 11, Number 2, September 1997
- Brendan D. McKay, Nicholas C. Wormald:
The degree sequence of a random graph. I. The models. 97-117 - Devdatt P. Dubhashi:
Simple proofs of occupancy tail bounds. 119-123 - Hanna D. Robalewska:
Random graphs generated by the Star 2-Process. 125-149 - Guy Louchard:
Probabilistic analysis of column-convex and directed diagonally-convex animals. 151-178 - Noga Alon, Gregory Z. Gutin:
Properly colored Hamilton cycles in edge-colored complete graphs. 179-186 - Alexander I. Barvinok:
Approximate counting via random optimization. 187-198
Volume 11, Number 3, October 1997
- Fan R. K. Chung, Ronald L. Graham:
Stratified random walks on the n-cube. 199-222 - Philippe Flajolet, Xavier Gourdon, Conrado Martinez
:
Patterns in random binary search trees. 223-244 - Yoshiharu Kohayakawa, Bernd Kreuter:
Threshold functions for asymmetric Ramsey properties involving cycles. 245-276 - Tomasz Luczak, Lubos Thoma:
Convergence of probabilities for the second order monadic properties of a random mapping. 277-295
Volume 11, Number 4, December 1997
- Michael Luby:
Foreword. 297 - Nabil Kahale:
A semidefinite bound for mixing rates of Markov chains. 299-313 - Oded Goldreich, Avi Wigderson:
Tiny families of functions with random properties: A quality-size trade-off for hashing. 315-343 - David Zuckerman:
Randomness-optimal oblivious sampling. 345-367 - Monika Rauch Henzinger, Mikkel Thorup:
Sampling to provide or to bound: With applications to fully dynamic graph algorithms. 369-379 - Christoph Dürr, Huong Lê Thanh, Miklos Santha:
A decision procedure for well-formed linear quantum cellular automata. 381-394 - Lars Eilstrup Rasmussen:
Approximately counting cliques. 395-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 2020-10-20 22:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
