| Improving Software Quality as Customers Perceive It. | 2 | 0.51 | 2016 |
| Technology Directions in Enterprise Communications | 0 | 0.34 | 2006 |
| New directions in services management. | 2 | 0.48 | 2000 |
| Control Software for Virtual-Circuit Switches: Call Processing | 1 | 0.35 | 1992 |
| Parallelism as a Structuring Technique: Call Processing using the Estrel Language | 1 | 0.39 | 1992 |
| Object-Oriented Redesign Using C++: Experience with Parser Generators | 0 | 0.34 | 1990 |
| Adding New Code to a Running C++ Program | 8 | 2.36 | 1990 |
| Maintaining cross reference in manuscripts | 1 | 0.88 | 1988 |
| From regular expressions to deterministic automata | 131 | 22.00 | 1986 |
| An ideal model for recursive polymorphic types | 142 | 40.03 | 1986 |
| The global storage needs of a subcomputation | 11 | 3.09 | 1984 |
| Preprocessing Embedded Actions | 0 | 0.34 | 1984 |
| Control Flow Aspects of Semantics-Directed Compiling | 28 | 4.37 | 1983 |
| Instruction Sets for Evaluating Arithmetic Expressions | 3 | 0.44 | 1983 |
| Properties of a Notation for Combining Functions | 9 | 2.24 | 1982 |
| Control flow aspects of semantics directed compiling (Summary) | 8 | 1.31 | 1982 |
| A semantic model of types for applicative languages | 37 | 22.42 | 1982 |
| Useless Actions Make a Difference: Strict Serializability of Database Updates | 6 | 2.76 | 1982 |
| Circular Expressions: Elimination of Static Environments | 10 | 2.64 | 1982 |
| Pebble Games For Studying Storage Sharing | 12 | 1.65 | 1982 |
| A model of concurrent database transactions (summary) | 4 | 4.50 | 1981 |
| Computing Sequences With Addition Chains | 70 | 13.55 | 1981 |
| Uniform Syntax for Type Expressions and Declarators | 0 | 0.34 | 1981 |
| Circular Expressions: Elimination of Static Environments | 6 | 2.35 | 1981 |
| Variations on the Common Subexpression Problem | 193 | 78.51 | 1980 |
| A case study in specifying the semantics of a programming language | 2 | 0.44 | 1980 |
| Efficient Computation of Expressions with Common Subexpressions | 6 | 11.05 | 1980 |
| Off-line and on-line algorithms for deducing equalities | 10 | 7.00 | 1978 |
| Assignment Commands with Array References | 19 | 19.28 | 1978 |
| Conditional Expressions with Equality Tests | 6 | 2.81 | 1978 |
| On the Complexity of Mean Flow Time Scheduling | 4 | 0.49 | 1977 |
| Worst Case Analysis of Two Scheduling Algorithms | 38 | 13.44 | 1977 |
| How Hard is Compiler Code Generation? | 4 | 1.75 | 1977 |
| A comparison of instruction sets for stack machines | 4 | 1.00 | 1977 |
| A Level Algorithm for Preemptive Scheduling | 51 | 26.01 | 1977 |
| The Complexity of Trie Index Construction | 38 | 18.51 | 1977 |
| Scheduling Graphs on Two Processors | 35 | 48.53 | 1976 |
| Assignment commands and array structures | 2 | 9.23 | 1976 |
| Code Generation for a One-Register Machine | 49 | 18.77 | 1976 |
| The Complexity of Flowshop and Jobshop Scheduling | 645 | 99.11 | 1976 |
| A generalized bound on LPT sequencing | 15 | 7.56 | 1976 |
| Task Sequencing in a Batch Environment with Setup Times | 7 | 1.21 | 1976 |
| Correct computation rules for recursive languages | 13 | 8.18 | 1976 |
| Complexity of Trie Index Construction (Extended Abstract) | 9 | 6.56 | 1976 |
| Algorithms Minimizing Mean Flow Time: Schedule-Length Properties. | 12 | 25.27 | 1976 |
| Analysis of a level algorithm for preemptive scheduling | 7 | 3.05 | 1975 |
| Correct Computation Rules for Recursive Languages (Extended Abstract) | 2 | 0.90 | 1975 |
| Complete Register Allocation Problems | 127 | 69.77 | 1975 |
| Errata: `` Testing for the Church-Rosser Property'' | 4 | 2.11 | 1975 |
| Algorithms for Minimizing Mean Flow Time | 16 | 26.78 | 1974 |
