| Publication | Date of Publication | Type |
|---|
The macro model for data compression (extended abstract)
Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 | 2014-03-14 | Paper |
Hash table reorganization
Journal of Algorithms | 1985-01-01 | Paper |
Data compression via textual substitution
Journal of the ACM | 1982-01-01 | Paper |
The Complexity of Finding Cycles in Periodic Functions
SIAM Journal on Computing | 1982-01-01 | Paper |
Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
SIAM Journal on Computing | 1981-01-01 | Paper |
Chaining Span-Dependent Jump Instructions
ACM Transactions on Programming Languages and Systems | 1980-01-01 | Paper |
Assembling code for machines with span-dependent instructions
Communications of the ACM | 1978-01-01 | Paper |
Lower Bounds and Reductions Between Grammar Problems
Journal of the ACM | 1978-01-01 | Paper |
Corrigendum: `` Lower Bounds and Reductions Between Grammar Problems''
Journal of the ACM | 1978-01-01 | Paper |
A fast algorithm for computing longest common subsequences
Communications of the ACM | 1977-01-01 | Paper |
Succinctness of Descriptions of Unambiguous Context-Free Languages
SIAM Journal on Computing | 1977-01-01 | Paper |
Economy of description by parsers, DPDA's, and PDA's
Theoretical Computer Science | 1977-01-01 | Paper |
Operations on sparse relations
Communications of the ACM | 1977-01-01 | Paper |
Concerning bounded-right-context grammars
Theoretical Computer Science | 1977-01-01 | Paper |
Evaluating Relational Expressions with Dense and Sparse Arguments
SIAM Journal on Computing | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3569814 (Why is no real title available?) | 1976-01-01 | Paper |
On the equivalence, containment, and covering problems for the regular and context-free languages
Journal of Computer and System Sciences | 1976-01-01 | Paper |
Noncanonical Extensions of Bottom-Up Parsing Techniques
SIAM Journal on Computing | 1976-01-01 | Paper |
The covering problem for linear context-free grammars
Theoretical Computer Science | 1976-01-01 | Paper |
Complexity metatheorems for context-free grammar problems
Journal of Computer and System Sciences | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3562527 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3557229 (Why is no real title available?) | 1975-01-01 | Paper |
On the complexity of LR(k) testing
Communications of the ACM | 1975-01-01 | Paper |
Program Schemes with Pushdown Stores
SIAM Journal on Computing | 1972-01-01 | Paper |
