Conference paper
Probabilistic simulations
Nicholas Pippenger
STOC 1982
The assertion of the title is formulated and proved. The result is then used to construct graphs with a linear number of edges that, even after the deletion of almost all of their edges or almost all of their vertices, continue to contain all small trees. © 1987 Akadémiai Kiadó.
Nicholas Pippenger
STOC 1982
Nicholas Pippenger
FOCS 1979
Roy Adler, Bruce Kitchens, et al.
IEEE Trans. Inf. Theory
Nicholas Pippenger
IEEE Trans. Inf. Theory