Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 23
Volume 23, Number 1, August 2003
- Uriel Feige, Yuri Rabinovich:
Deterministic approximation of the cover time. 1-22 - Oded Goldreich
, Luca Trevisan:
Three theorems regarding testing graph properties. 23-57 - Yann Ollivier:
Rate of convergence of crossover operators. 58-72 - Cristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski:
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction. 73-91 - Eli Ben-Sasson, Nicola Galesi:
Space complexity of random formulae in resolution. 92-109
Volume 23, Number 2, September 2003
- Jeong Han Kim:
Perfect matchings in random uniform hypergraphs. 111-132 - Leslie Ann Goldberg, Mark Jerrum, Mike Paterson:
The computational complexity of two-state spin systems. 133-154 - Ilan Adler, Hyun-Soo Ahn, Richard M. Karp, Sheldon M. Ross:
Coalescing times for IID random variables with applications to population biology. 155-166 - Martin E. Dyer, Alan M. Frieze:
Randomly coloring graphs with lower bounds on girth and maximum degree. 167-179 - Ali Shokoufandeh, Yi Zhao:
Proof of a tiling conjecture of Komlós. 180-205 - Geoffrey R. Grimmett, Svante Janson:
On smallest triangles. 206-223
Volume 23, Number 3, October 2003
- Tibor Szabó, Van H. Vu:
Turán's theorem in sparse random graphs. 225-234 - Tzvika Hartman, Ran Raz:
On the distribution of the number of roots of polynomials and explicit weak designs. 235-263 - Brendan Nagle, Vojtech Rödl:
Regularity properties for triple systems. 264-332 - Elchanan Mossel, Ryan O'Donnell:
On the noise sensitivity of monotone functions. 333-350
Volume 23, Number 4, December 2003
- Richard A. Duke, Paul Erdös, Vojtech Rödl:
On large intersecting subfamilies of uniform setfamilies. 351-356 - Luc Devroye, Ralph Neininger:
Random suffix search trees. 357-396 - Jirí Matousek, Milos Stojakovic:
On restricted min-wise independence of permutations. 397-408 - Noga Alon, Tao Jiang, Zevi Miller, Dan Pritikin:
Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints. 409-433 - Robert P. Dobrow, James Allen Fill:
Speeding up the FMMR perfect sampling algorithm: A case study revisited. 434-452
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 2021-03-03 23:00 CET 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:
