Conference paper
Parallel communication with limited buffers
Nicholas Pippenger
FOCS 1984
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
FOCS 1984
Maria Klawe, Wolfgang J. Paul, et al.
STOC 1984
Nicholas Pippenger
FOCS 1976
Nicholas Pippenger
STOC 1976