| Publication | Date of Publication | Type |
|---|
| Computational thinking in programming language and compiler design (keynote) | 2023-11-14 | Paper |
| Translations on a context free grammar | 2014-03-14 | Paper |
| Complexity Theory | 2014-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3525697 | 2008-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3522572 | 2008-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5452362 | 2008-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4385510 | 1998-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4317191 | 1994-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3995058 | 1993-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3995059 | 1993-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4023826 | 1993-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3992625 | 1992-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3948568 | 1983-01-01 | Paper |
| Bounds on the size and transmission rate of communications protocols | 1982-01-01 | Paper |
| Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3664434 | 1979-01-01 | Paper |
| Awk — a pattern scanning and processing language | 1979-01-01 | Paper |
| Equivalences among Relational Expressions | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4162623 | 1978-01-01 | Paper |
| Rectilinear steiner trees: Efficient special-case algorithms | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4139632 | 1977-01-01 | Paper |
| Node listings for reducible flow graphs | 1976-01-01 | Paper |
| Bounds on the Complexity of the Longest Common Subsequence Problem | 1976-01-01 | Paper |
| On Finding Lowest Common Ancestors in Trees | 1976-01-01 | Paper |
| Efficient string matching | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4065051 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4066628 | 1975-01-01 | Paper |
| Evaluating Polynomials at Fixed Sets of Points | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4162673 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4091421 | 1974-01-01 | Paper |
| Dynamic Memories with Rapid Random and Sequential Access | 1974-01-01 | Paper |
| A Technique for Speeding up ${\text{LR}}(k)$ Parsers | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4061956 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4402005 | 1973-01-01 | Paper |
| Error detection in precedence parsers | 1973-01-01 | Paper |
| Equivalence of programs with structured variables | 1972-01-01 | Paper |
| Optimization of LR(k) parsers | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4125810 | 1972-01-01 | Paper |
| A Minimum Distance Error-Correcting Parser for Context-Free Languages | 1972-01-01 | Paper |
| Translations on a context free grammar | 1972-01-01 | Paper |
| The Transitive Reduction of a Directed Graph | 1972-01-01 | Paper |
| Optimization of Straight Line Programs | 1972-01-01 | Paper |
| Weak and Mixed Strategy Precedence Parsing | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5672156 | 1972-01-01 | Paper |
| Linear precedence functions for weak precedence grammars | 1972-01-01 | Paper |
| Principles of Optimal Page Replacement | 1971-01-01 | Paper |
| Characterizations and extensions of pushdown translations | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5672148 | 1971-01-01 | Paper |
| On the computational power of pushdown automata | 1970-01-01 | Paper |
| A characterization of two-way deterministic classes of languages | 1970-01-01 | Paper |
| Properties of syntax directed translations | 1969-01-01 | Paper |
| Syntax directed translations and the pushdown assembler | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4773298 | 1969-01-01 | Paper |
| A general theory of translation | 1969-01-01 | Paper |
| Nested Stack Automata | 1969-01-01 | Paper |
| The theory of languages | 1968-01-01 | Paper |
| Indexed Grammars—An Extension of Context-Free Grammars | 1968-01-01 | Paper |
| The theory of languages | 1968-01-01 | Paper |
| Time and tape complexity of pushdown automaton languages | 1968-01-01 | Paper |
