A recognition algorithm for pushdown store systems. - Alfred V. Aho; John E. Hopcroft; Jeffrey D. Ullman (ACM National Conference, 1968)

Automaton Analogs of Syntax Directed Translation Schemata - Alfred V. Aho; Jeffrey D. Ullman (SWAT, 1968)

Indexed Grammars - An Extension of Context-Free Grammars. - Alfred V. Aho (J. ACM, 1968)

The Theory of Languages. - Alfred V. Aho; Jeffrey D. Ullman (Math. Syst. Theory, 1968)

R68-27 Programming Languages for Automata. - Alfred V. Aho (IEEE Trans. Computers, 1968)

Time and Tape Complexity of Pushdown Automaton Languages - Alfred V. Aho; John E. Hopcroft; Jeffrey D. Ullman (Inf. Control., 1968)

Nested Stack Automata. - Alfred V. Aho (J. ACM, 1969)

Syntax Directed Translations and the Pushdown Assembler. - Alfred V. Aho; Jeffrey D. Ullman (J. Comput. Syst. Sci., 1969)

Properties of Syntax Directed Translations. - Alfred V. Aho; Jeffrey D. Ullman (J. Comput. Syst. Sci., 1969)

A General Theory of Translation. - Alfred V. Aho; John E. Hopcroft; Jeffrey D. Ullman (Math. Syst. Theory, 1969)

A formal approach to code optimization. - Alfred V. Aho; Ravi Sethi; Jeffrey D. Ullman (Symposium on Compiler Optimization, 1970)

Transformations on Straight Line Programs-Preliminary Version - Alfred V. Aho; Jeffrey D. Ullman (STOC, 1970)

A Characterization of Two-Way Deterministic Classes of Languages. - Alfred V. Aho; Jeffrey D. Ullman (J. Comput. Syst. Sci., 1970)

On the Computational Power of Pushdown Automata. - Alfred V. Aho; Jeffrey D. Ullman; John E. Hopcroft (J. Comput. Syst. Sci., 1970)

The Care and Feeding of LR(k) Grammars - Alfred V. Aho; Jeffrey D. Ullman (STOC, 1971)

Principles of Optimal Page Replacement. - Alfred V. Aho; Peter J. Denning; Jeffrey D. Ullman (J. ACM, 1971)

Characterizations and Extensions of Pushdown Translations. - Alfred V. Aho; Jeffrey D. Ullman (Math. Syst. Theory, 1971)

Translations on a Context-Free Grammar - Alfred V. Aho; Jeffrey D. Ullman (Inf. Control., 1971)

The theory of parsing, translation, and compiling. 1: Parsing - Alfred V. Aho; Jeffrey D. Ullman (Prentice-Hall, 1972)

Weak and Mixed Strategy Precedence Parsing. - Alfred V. Aho; Peter J. Denning; Jeffrey D. Ullman (J. ACM, 1972)

Equivalence of Programs with Structured Variables. - Alfred V. Aho; Jeffrey D. Ullman (J. Comput. Syst. Sci., 1972)

Optimization of LR(k) Parsers. - Alfred V. Aho; Jeffrey D. Ullman (J. Comput. Syst. Sci., 1972)

The Transitive Reduction of a Directed Graph. - Alfred V. Aho; M. R. Garey; Jeffrey D. Ullman (SIAM J. Comput., 1972)

A Minimum Distance Error-Correcting Parser for Context-Free Languages. - Alfred V. Aho; Thomas G. Peterson (SIAM J. Comput., 1972)

Optimization of Straight Line Programs. - Alfred V. Aho; Jeffrey D. Ullman (SIAM J. Comput., 1972)

The theory of parsing, translation, and compiling. 2: Compiling. - Alfred V. Aho; Jeffrey D. Ullman (Prentice-Hall, 1973)

Error Detection in Precedence Parsers. - Alfred V. Aho; Jeffrey D. Ullman (Math. Syst. Theory, 1973)

A Technique for Speeding up LR(k) Parsers. - Alfred V. Aho; Jeffrey D. Ullman (SIAM J. Comput., 1973)

The Design and Analysis of Computer Algorithms. - Alfred V. Aho; John E. Hopcroft; Jeffrey D. Ullman (Addison-Wesley, 1974)

Bounds on the Complexity of the Longest Common Subsequence Problem (Extended Abstract) - Alfred V. Aho; Daniel S. Hirschberg; Jeffrey D. Ullman (SWAT, 1974)

LR Parsing. - Alfred V. Aho; Stephen C. Johnson (ACM Comput. Surv., 1974)

Dynamic Memories with Rapid Random and Sequential Access. - Alfred V. Aho; Jeffrey D. Ullman (IEEE Trans. Computers, 1974)

Efficient String Matching: An Aid to Bibliographic Search. - Alfred V. Aho; Margaret J. Corasick (Commun. ACM, 1975)

Deterministic Parsing of Ambiguous Grammars. - Alfred V. Aho; Stephen C. Johnson; Jeffrey D. Ullman (Commun. ACM, 1975)

Evaluating Polynomials at Fixed Sets of Points. - Alfred V. Aho; Kenneth Steiglitz; Jeffrey D. Ullman (SIAM J. Comput., 1975)

Bounds on the Complexity of the Longest Common Subsequence Problem. - Alfred V. Aho; Daniel S. Hirschberg; Jeffrey D. Ullman (J. ACM, 1976)

Optimal Code Generation for Expression Trees. - Alfred V. Aho; Stephen C. Johnson (J. ACM, 1976)

Node Listings for Reducible Flow Graphs. - Alfred V. Aho; Jeffrey D. Ullman (J. Comput. Syst. Sci., 1976)

On Finding Lowest Common Ancestors in Trees. - Alfred V. Aho; John E. Hopcroft; Jeffrey D. Ullman (SIAM J. Comput., 1976)

The Theory of Joins in Relational Data Bases (Extended Abstract) - Alfred V. Aho; Catriel Beeri; Jeffrey D. Ullman (FOCS, 1977)

How Hard is Compiler Code Generation? - Alfred V. Aho; Ravi Sethi (ICALP, 1977)

Code Generation for Machines with Multiregister Operations. - Alfred V. Aho; Stephen C. Johnson; Jeffrey D. Ullman (POPL, 1977)

Code Generation for Expressions with Common Subexpressions. - Alfred V. Aho; Stephen C. Johnson; Jeffrey D. Ullman (J. ACM, 1977)

Rectilinear steiner trees: Efficient special-case algorithms. - Alfred V. Aho; Michael R. Garey; Frank K. Hwang (Networks, 1977)

Tools For Automatic Compiler Generation (Panel Discussion). - Alfred V. Aho; Susan L. Graham (ACM Annual Conference (1), 1978)

Tools For Automatic Compiler Generation (Panel Discussion). - Alfred V. Aho; Stephen C. Johnson (ACM Annual Conference (1), 1978)

Efficient Optimization of a Class of Relational Expressions (Abstract). - Alfred V. Aho; Yehoshua Sagiv; Jeffrey D. Ullman (SIGMOD Conference, 1978)

Modeling Communications Protocols by Automata - Alfred V. Aho; Jeffrey D. Ullman; Mihalis Yannakakis (FOCS, 1979)

The Universality of Data Retrieval Languages. - Alfred V. Aho; Jeffrey D. Ullman (POPL, 1979)

Equivalences Among Relational Expressions. - Alfred V. Aho; Yehoshua Sagiv; Jeffrey D. Ullman (SIAM J. Comput., 1979)

Awk-A Pattern Scanning and Processing Language. - Alfred V. Aho; Brian W. Kernighan; Peter J. Weinberger (Softw. Pract. Exp., 1979)

The Theory of Joins in Relational Databases. - Alfred V. Aho; Catriel Beeri; Jeffrey D. Ullman (ACM Trans. Database Syst., 1979)

Efficient Optimization of a Class of Relational Expressions. - Alfred V. Aho; Yehoshua Sagiv; Jeffrey D. Ullman (ACM Trans. Database Syst., 1979)

Optimal Partial-Match Retrieval When Fields Are Independently Specified. - Alfred V. Aho; Jeffrey D. Ullman (ACM Trans. Database Syst., 1979)

Translator Writing Systems: Where Do they Now Stand? - Alfred V. Aho (Computer, 1980)

Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions. - Alfred V. Aho; Yehoshua Sagiv; Thomas G. Szymanski; Jeffrey D. Ullman (SIAM J. Comput., 1981)

High level language programming environments. - Marvin V. Zelkowitz; W. Richards Adrion; Alfred V. Aho; Daniel G. Bobrow; Thomas Cheatham; John C. Cherniavsky; Susan L. Gerhart; Gordon Lyon; John Nestor; Terry A. Straeter (ACM SIGSOFT Softw. Eng. Notes, 1981)

Data Structures and Algorithms. - Alfred V. Aho; John E. Hopcroft; Jeffrey D. Ullman (Addison-Wesley, 1983)

On Notions of Information Transfer in VLSI Circuits - Alfred V. Aho; Jeffrey D. Ullman; Mihalis Yannakakis (STOC, 1983)

The UNIX system: Foreword. - Alfred V. Aho (AT&T Bell Lab. Tech. J., 1984)

Efficient Tree Pattern Matching: An Aid to Code Generation. - Alfred V. Aho; Mahadevan Ganapathi (POPL, 1985)

Compilers: Principles, Techniques, and Tools. - Alfred V. Aho; Ravi Sethi; Jeffrey D. Ullman (Addison-Wesley, 1986)

Storing a Dynamic Sparse Table - Alfred V. Aho; David Lee 001 (FOCS, 1986)

The AWK Programming Language - Alfred V. Aho; Brian W. Kernighan; Peter J. Weinberger (Addison-Wesley, 1988)

Maintaining Cross References in Manuscripts. - Alfred V. Aho; Ravi Sethi (Softw. Pract. Exp., 1988)

Code Generation Using Tree Matching and Dynamic Programming. - Alfred V. Aho; Mahadevan Ganapathi; Steven W. K. Tjiang (ACM Trans. Program. Lang. Syst., 1989)

Algorithms for Finding Patterns in Strings. - Alfred V. Aho (Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A), 1990)

An optimization technique for protocol conformance test generation based on UIO sequences and rural Chinese postman tours. - Alfred V. Aho; Anton T. Dahbura; David Lee 001; M. Ümit Uyar (IEEE Trans. Commun., 1991)

Foundations of Computer Science, C Edition - Alfred V. Aho; Jeffrey D. Ullman (Computer Science Press / W. H. Freeman, 1992)

Feature Interactions in the Global Information Infrastructure (Panel). - Alfred V. Aho; Nancy D. Griffeth (SIGSOFT FSE, 1995)

Informatik - Datenstrukturen und Konzepte der Abstraktion. - Alfred V. Aho; Jeffrey D. Ullman (International Thomson, 1996)

Accessing Information from Globally Distributed Knowledge Repositories. - Alfred V. Aho (PODS, 1996)

Columbia Digital News System An Environment for Briefing and Search over Multimedia Information. - Alfred V. Aho; Shih-Fu Chang; Kathleen R. McKeown; Dragomir R. Radev; John R. Smith; Kazi A. Zaman (ADL, 1997)

Columbia Digital News Project: An Environment for Briefing and Search over Multimedia Information. - Alfred V. Aho; Shih-Fu Chang; Kathleen R. McKeown; Dragomir R. Radev; John R. Smith; Kazi A. Zaman (Int. J. Digit. Libr., 1997)

Emerging opportunities for theoretical computer science. - Alfred V. Aho; David S. Johnson 001; Richard M. Karp; S. Rao Kosaraju; Catherine C. McGeoch; Christos H. Papadimitriou; Pavel A. Pevzner (SIGACT News, 1997)

SCF3/Sculptor with Chisel: Requirements Engineering for Communications Services. - Alfred V. Aho; Sean Gallagher; Nancy D. Griffeth; Cynthia Schell; Deborah Swayne (FIW, 1998)

Hierarchical networks and the LSA N-squared problem in OSPF routing. - Alfred V. Aho; David Lee 001 (GLOBECOM, 2000)

Reminiscences on Influential Papers. - Kenneth A. Ross; Alfred V. Aho; Anastassia Ailamaki (SIGMOD Rec., 2002)

Graph Representation. - Alfred V. Aho; Mark Goldberg; Josef Lauri; Richard B. Borie; R. Gary Parker; Craig A. Tovey (Handbook of Graph Theory, 2003)

Statement Annotations for Fine-Grained Advising. - Marc Eaddy; Alfred V. Aho (RAM-SE, 2006)

A Layered Software Architecture for Quantum Computing Design Tools. - Krysta M. Svore; Alfred V. Aho; Andrew W. Cross; Isaac L. Chuang; Igor L. Markov (Computer, 2006)

A flow-map model for analyzing pseudothresholds in fault-tolerant quantum computing. - Krysta M. Svore; Andrew W. Cross; Isaac L. Chuang; Alfred V. Aho (Quantum Inf. Comput., 2006)

Debugging Aspect-Enabled Programs. - Marc Eaddy; Alfred V. Aho; Weiping Hu; Paddy McDonald; Julian Burger (SC@ETAPS, 2007)

CERBERUS: Tracing Requirements to Source Code Using Information Retrieval, Dynamic Analysis, and Program Analysis. - Marc Eaddy; Alfred V. Aho; Giuliano Antoniol; Yann-Gaël Guéhéneuc (ICPC, 2008)

Teaching the compilers course. - Alfred V. Aho (ACM SIGCSE Bull., 2008)

Do Crosscutting Concerns Cause Defects? - Marc Eaddy; Thomas Zimmermann 001; Kaitin D. Sherwood; Vibhav Garg; Gail C. Murphy; Nachiappan Nagappan; Alfred V. Aho (IEEE Trans. Software Eng., 2008)

Complexity Theory. - Alfred V. Aho (Computer Science, The Hardware, Software and Heart of It, 2011)

Ubiquity symposium: Computation and Computational Thinking. - Alfred V. Aho (Ubiquity, 2011)

Computation and Computational Thinking. - Alfred V. Aho (Comput. J., 2012)

A front row seat to Communications' editorial transformation. - Alfred V. Aho; Georg Gottlob (Commun. ACM, 2014)

Android Malware Static Analysis Techniques. - Suzanna Schmeelk; Junfeng Yang; Alfred V. Aho (CISR, 2015)

Learning Java in a New York City immigrant engineer retraining program. - Suzanna Schmeelk; Fred Fontaine; Larisa Ackerman; Alfred V. Aho (FIE, 2017)

Computational thinking in programming language and compiler design (keynote). - Alfred V. Aho (STOC, 2021)

Abstractions, their algorithms, and their compilers. - Alfred V. Aho; Jeffrey D. Ullman (Commun. ACM, 2022)