Author pages are created from data sourced from our academic publisher partnerships and public sources.
- Publications
- Influence
Share This Author
A Critical Point for Random Graphs with a Given Degree Sequence
- Michael Molloy, B. Reed
- MathematicsRandom Struct. Algorithms
- 1 March 1995
TLDR
Graph Colouring and the Probabilistic Method
- B. Reed
- Computer Science
- 20 November 2001
TLDR
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
- Michael Molloy, B. Reed
- MathematicsCombinatorics, Probability and Computing
- 1 September 1998
TLDR
Mick gets some (the odds are on his side) (satisfiability)
- V. Chvátal, B. Reed
- MathematicsProceedings., 33rd Annual Symposium on…
- 24 October 1992
TLDR
A Bound on the Strong Chromatic Index of a Graph,
- Michael Molloy, B. Reed
- MathematicsJ. Comb. Theory, Ser. B
- 1 March 1997
We show that the strong chromatic index of a graph with maximum degree�; is at most (2��)�2, for some�>0. This answers a question of Erdo�s and Ne�et�il.
Finding odd cycle transversals
- B. Reed, Kaleigh Smith, A. Vetta
- MathematicsOper. Res. Lett.
- 1 July 2004
Further algorithmic aspects of the local lemma
- Michael Molloy, B. Reed
- Computer ScienceSTOC '98
- 23 May 1998
TLDR
Acyclic Coloring of Graphs
- N. Alon, C. McDiarmid, B. Reed
- MathematicsRandom Struct. Algorithms
- 1 September 1991
TLDR
Minima in branching random walks
- L. Addario-Berry, B. Reed
- Mathematics
- 16 December 2007
Given a branching random walk, let $M_n$ be the minimum position of any member of the $n$th generation. We calculate $\\mathbfEM_n$ to within O(1) and prove exponential tail bounds for…
The height of a random binary search tree
- B. Reed
- Computer ScienceJACM
- 1 May 2003
TLDR
...
1
2
3
4
5
...