Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Mcdiarmid, C."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Branching processes and their applications in the analysis of tree structures and tree algorithms
Luc Devroye
Algorithms and Combinatorics
16
, 1998, pp. 249-314
Probabilistic analysis of algorithms
Alan M. Frieze
,
Bruce Reed
Algorithms and Combinatorics
16
, 1998, pp. 36-92
Probabilistic Methods for Algorithmic Discrete Mathematics
Mark Jerrum
Algorithms and Combinatorics
16
, 1998, pp. 116-165
Concentration
Colin McDiarmid
Algorithms and Combinatorics
16
, 1998, pp. 195-248
The probabilistic method
Michael Molloy
Algorithms and Combinatorics
16
, 1998, pp. 1-35
An overview of randomized algorithms
Rajeev Motwani
,
Prabhakar Raghavan
Algorithms and Combinatorics
16
, 1998, pp. 93-115
Percolation and the random cluster model: Combinatorial and algorithmic problems
Dominic Welsh
Algorithms and Combinatorics
16
, 1998, pp. 166-194
Large deviations for Quicksort
C.J.H. McDiarmid
,
R.B. Hayward
Journal of Algorithms
21
(3), 1996, pp. 476-507
Induced circuits in planar graphs
C. McDiarmid
,
B. Reed
,
A. Schrijver
,
B. Shepherd
Journal of Combinatorial Theory Series B
60
(2), 1994, pp. 169-176
Small transversals in hypergraphs
V. Chvátal
,
C. Mcdiarmid
Combinatorica
12
, 1992, pp. 19-26
On integer points in polyhedra
W. Cook
,
M. Hartmann
,
R. Kannan
,
C. Mcdiarmid
Combinatorica
12
, 1992, pp. 27-37
Non-interfering network flows
C. McDiarmid
,
B. Reed
,
A. Schrijver
,
B. Shepherd
Lecture Notes in Computer Science
621
, 1992, pp. 245-257
On random minimum length spanning trees
A.M. Frieze
,
C.J.H. McDiarmid
Combinatorica
9
, 1989, pp. 363-374
Building heaps fast
C.J.H. McDiarmid
,
B.A. Reed
Journal of Algorithms
10
, 1989, pp. 352-365
Edge-colouring random graphs
A.M. Frieze
,
B. Jackson
,
C.J.H. McDiarmid
,
B. Reed
Journal of Combinatorial Theory Series B
45
, 1988, pp. 135-149
The complexity of counting homeomorphs
G. Farr
,
C. McDiarmid
Theoretical Computer Science
36
(2,3), 1985, pp. 345-348
Determining the chromatic number of a graph
C. McDiarmid
SIAM Journal on Computing
8
(1), 1979, February, pp. 1-14