Storage requirements for deterministic polynomialtime recognizable languages

Recognition and parsing of context-free languages in time n3

D. H. Younger · Information and Control · 1967 · 949 citations

Computing, Computer Science, Computational Linguistics +13

Memory bounds for recognition of context-free and context-sensitive languages

Philip Lewis, Richard E. Stearns, Juris Hartmanis · 1965 · 220 citations

Computing, Computer Science, Algorithms +15

Comparative schematology

Michael S. Paterson, Carl Hewitt · DSpace@MIT (Massachusetts Institute of Technology) · 1970 · 219 citations · Full text

Computing, Computer Science, Formal Methods +11

An observation on time-storage trade off

Stephen Cook · Journal of Computer and System Sciences · 1974 · 202 citations

Computing, Computer Science, Algorithms +14

Complete Register Allocation Problems

Ravi Sethi · SIAM Journal on Computing · 1975 · 201 citations

Computing, Computer Engineering, Computer Science +12