This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B. von Braunmuehl and R. Verbeek, “A Recognition Algorithm for DCFLs Optimal in Time and Space”, IEEE Symp. on Foundations of Computer Science, 21 (1980) 411–420.
S. A. Cook, “Deterministic CFL's Are Accepted Simultaneously in Polynomial Time and Log Squared Space”, ACM Symp. on Theory of Computing, 11 (1979) 338–345.
S. A. Cook and R. Sethi, “Storage Requirements for Deterministic Polynomial Time Recognizable Languages”, J. Comp. and Sys. Sci., 13 (1976) 25–37.
O. Gabber and Z. Galil, “Explicit Construction of Linear Size Superconcentrators”, J. Comp. and Sys. Sci., 22 (1981) 407–420.
J. Hartmanis and R. E. Stearns, “On the Computational Complexity of Algorithms”, Trans. AMS, 117 (1965) 285–306.
J. E. Hopcroft, W. J. Paul and L. G. Valiant, “On Time versus Space”, J. ACM, 24 (1977) 332–337.
T. Lengauer and R. E. Tarjan, “Upper and Lower Bounds on Time-Space Tradeoffs”, ACM Symp. on Theory of Computing, 11 (1979) 262–277.
P.M. Lewis, R. E. Stearns and J. Hartmanis, “Memory Bounds for the Recognition of Context-Free and Context-Sensitive Languages”, IEEE Symp. on Switching Theory and Logical Design, 6 (1965) 191–202.
R. J. Lipton and R. E. Tarjan, “A Separator Theorem for Planar Graphs”, SIAM J. Appl. Math., 36 (1979) 177–189.
R. J. Lipton and R. E. Tarjan, “Applications of a Planar Separator Theorem”, SIAM J. Comp., 9 (1980) 615–627.
G. A. Margulis, “Explicit Construction of Concentrators”, Prob. Info. Trans., 9 (1973) 325–332.
K. Mehlhorn, “Pebbling Mountain Ranges and Its Application to DCFL-Recognition”, Internat. Coll. on Automata, Languages, and Programming, 7 (1980) 422–434.
M. S. Paterson and C. E. Hewitt, “Comparative Schematology”, Proj. MAC Conf. on Concurrent Systems and Parallel Computation, (1970) 119–127.
W. J. Paul, R. E. Tarjan and J. R. Celoni, “Space Bounds for a Game on Graphs”, Math. Sys. Theory, 10 (1977) 239–251.
W. J. Paul and R. Reischuk, “On Alternation II”, Acta Inf., 14 (1980) 391–403.
N. Pippenger, “Superconcentrators”, SIAM J. Comp., 6 (1977) 298–304.
N. Pippenger, “Fast Simulation of Combinational Logic Networks by Machines without Random-Access Storage”, Allerton Conf. on Communication, Control, and Computing, 15 (1977).
N. Pippenger, “Comparative Schematology and Pebbling with Auxiliary Pushdowns”, ACM Symp. on Theory of Computing, 12 (1980) 351–356.
N. Pippenger, “Pebbling”, IBM Japan Symp. on Mathematical Foundations of Computer Science, 5 (1980).
N. Pippenger, “Pebbling with an Auxiliary Pushdown”, J. Comp. and Sys. Sci., 23 (1981) 151–165.
R. Sethi, “Complete Register Allocation Problems”, SIAM J. Comp., 4 (1975) 226–248.
L. G. Valiant, “Graph-Theoretic Properties in Computational Complexity”, J. Comp. and Sys. Sci., 13 (1976) 278–285.
R. Verbeek, “Time-Space Trade-Offs for General Recursion”, IEEE Symp. on Foundations of Computer Science, 22 (1981) 228–234.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pippenger, N. (1982). Advances in pebbling. In: Nielsen, M., Schmidt, E.M. (eds) Automata, Languages and Programming. ICALP 1982. Lecture Notes in Computer Science, vol 140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012787
Download citation
DOI: https://doi.org/10.1007/BFb0012787
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11576-2
Online ISBN: 978-3-540-39308-5
eBook Packages: Springer Book Archive