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
Maria Klawe, Wolfgang J. Paul, et al.
STOC 1984
Ronald Fagin, Jurg Nievergelt, et al.
ACM Transactions on Database Systems (TODS)
Nicholas Pippenger, Leslie G. Valiant
Journal of the ACM