# Nick Wormald

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- COLT
- 2016

We give upper and lower bounds on the information-theoretic threshold for community detection in the stochastic block modelâ€¦Â (More)

Is this relevant?

2013

2013

- Inf. Process. Lett.
- 2013

In this paper we asymptotically count d-regular k-uniform hypergraphs on n vertices, provided k is fixed and d = d(n) = o(n). Inâ€¦Â (More)

Is this relevant?

2013

2013

- IEEE Transactions on Communications
- 2013

Growth codes are a subclass of Rateless codes that have found interesting applications in data dissemination problems. Comparedâ€¦Â (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- STOC
- 2010

We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certainâ€¦Â (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- Random Struct. Algorithms
- 2007

We study the k-core of a random (multi)graph on n vertices with a given degree sequence. We let nâ†’âˆž. Then, under some regularityâ€¦Â (More)

Is this relevant?

2006

2006

- Combinatorics, Probability & Computing
- 2006

Let c be a constant and (e1, f1), (e2, f2), . . . , (ecn, fcn) be a sequence of ordered pairs of edges on vertex set [n] chosenâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- INFORMS Journal on Computing
- 1999

In this paper, we develop a greedy randomized adaptive search procedure (GRASP) for the problem of minimizing straight-lineâ€¦Â (More)

Is this relevant?

1997

1997

- 1997

This paper introduces a 'superdrop' concept for the characterisation of a sprinkler spray, where the statistical characteristicsâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Combinatorics, Probability & Computing
- 1995

The asymptotic distribution of the number of Hamilton cycles in a random regular graph is determined. The limit distribution isâ€¦Â (More)

Is this relevant?

1987

1987

- Journal of Graph Theory
- 1987

A graph is k-triangular if each edge is in at least k triangles. Triangular is a synonym for l-triangular. It is shown that theâ€¦Â (More)

Is this relevant?