| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q3525697 | 2008-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5452362 | 2008-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4864231 | 1996-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4692471 | 1993-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3995058 | 1993-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3995059 | 1993-01-23 | Paper |
| From regular expressions to deterministic automata | 1986-01-01 | Paper |
| An ideal model for recursive polymorphic types | 1986-01-01 | Paper |
| Control Flow Aspects of Semantics-Directed Compiling | 1983-01-01 | Paper |
| Properties of a Notation for Combining Functions | 1983-01-01 | Paper |
| Instruction Sets for Evaluating Arithmetic Expressions | 1983-01-01 | Paper |
| Pebble games for studying storage sharing | 1982-01-01 | Paper |
| Useless Actions Make a Difference | 1982-01-01 | Paper |
| Circular expressions: elimination of static environments | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3940836 | 1982-01-01 | Paper |
| Computing Sequences with Addition Chains | 1981-01-01 | Paper |
| Variations on the Common Subexpression Problem | 1980-01-01 | Paper |
| Constructing Call-by-Value Continuation Semantics | 1980-01-01 | Paper |
| Efficient Computation of Expressions with Common Subexpressions | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4190091 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4193237 | 1978-01-01 | Paper |
| Assignment Commands with Array References | 1978-01-01 | Paper |
| Conditional Expressions with Equality Tests | 1978-01-01 | Paper |
| The Complexity of Trie Index Construction | 1977-01-01 | Paper |
| On the Complexity of Mean Flow Time Scheduling | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4131658 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4139632 | 1977-01-01 | Paper |
| The Complexity of Flowshop and Jobshop Scheduling | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4099211 | 1976-01-01 | Paper |
| Algorithms minimizing mean flow time: Schedule-length properties | 1976-01-01 | Paper |
| Correct Computation Rules for Recursive Languages | 1976-01-01 | Paper |
| Storage requirements for deterministic polynomial time recognizable languages | 1976-01-01 | Paper |
| Scheduling Graphs on Two Processors | 1976-01-01 | Paper |
| Code Generation for a One-Register Machine | 1976-01-01 | Paper |
| A characterization ofLL(1) grammars | 1976-01-01 | Paper |
| Complete Register Allocation Problems | 1975-01-01 | Paper |
| Scheduling independent tasks to reduce mean finishing time | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4051615 | 1974-01-01 | Paper |
| Testing for the Church-Rosser Property | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4199563 | 1974-01-01 | Paper |
| A note on implementing parallel assignment instructions | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4066569 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4125732 | 1972-01-01 | Paper |
| The Generation of Optimal Code for Arithmetic Expressions | 1970-01-01 | Paper |
