On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape Turing machines

Authors:
Z Galil;R Kannan;E Szemeredi
Affiliations:
Columbia University and Tel-Aviv University;Carnegie Mellon University;University of Chicago and the Hungarian Academy of Sciences
Venue:
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Year:
1986

Unraveling K-page graphs

Information and Control - The MIT Press scientific computation series
Four pages are necessary and sufficient for planar graphs

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
On Time Versus Space

Journal of the ACM (JACM)
Lower Bounds by Kolmogorov-Complexity (Extended Abstract)

Proceedings of the 12th Colloquium on Automata, Languages and Programming
On the pagenumber of planar graphs

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing

The page number of genus g graphs is (g)

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The pagenumber of genus g graphs is O(g)

Journal of the ACM (JACM)
Stacks versus Deques

COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics

Hi-index	0.00