| 2008 |
|---|
| 78 | EE | Marc Eaddy,
Alfred V. Aho,
Giuliano Antoniol,
Yann-Gaël Guéhéneuc:
CERBERUS: Tracing Requirements to Source Code Using Information Retrieval, Dynamic Analysis, and Program Analysis.
ICPC 2008: 53-62 |
| 77 | EE | Marc Eaddy,
Thomas Zimmermann,
Kaitin D. Sherwood,
Vibhav Garg,
Gail C. Murphy,
Nachiappan Nagappan,
Alfred V. Aho:
Do Crosscutting Concerns Cause Defects?
IEEE Trans. Software Eng. 34(4): 497-515 (2008) |
| 2007 |
|---|
| 76 | EE | Marc Eaddy,
Alfred V. Aho,
Weiping Hu,
Paddy McDonald,
Julian Burger:
Debugging Aspect-Enabled Programs.
Software Composition 2007: 200-215 |
| 2006 |
|---|
| 75 | | Marc Eaddy,
Alfred V. Aho:
Statement Annotations for Fine-Grained Advising.
RAM-SE 2006: 89-99 |
| 74 | EE | Krysta Marie Svore,
Alfred V. Aho,
Andrew W. Cross,
Isaac L. Chuang,
Igor L. Markov:
A Layered Software Architecture for Quantum Computing Design Tools.
IEEE Computer 39(1): 74-83 (2006) |
| 2002 |
|---|
| 73 | EE | Kenneth A. Ross,
Alfred V. Aho,
Anastassia Ailamaki:
Reminiscences on Influential Papers.
SIGMOD Record 31(4): 97 (2002) |
| 1998 |
|---|
| 72 | | Alfred V. Aho,
Sean Gallagher,
Nancy D. Griffeth,
Cynthia Schell,
Deborah Swayne:
SCF3/Sculptor with Chisel: Requirements Engineering for Communications Services.
FIW 1998: 45-63 |
| 1997 |
|---|
| 71 | EE | Alfred V. Aho,
Shih-Fu Chang,
Kathleen McKeown,
Dragomir R. Radev,
John R. Smith,
Kazi A. Zaman:
Columbia Digital News System An Environment for Briefing and Search over Multimedia Information.
ADL 1997: 82-94 |
| 70 | EE | Alfred V. Aho,
Shih-Fu Chang,
Kathleen McKeown,
Dragomir R. Radev,
John R. Smith,
Kazi A. Zaman:
Columbia Digital News Project: An Environment for Briefing and Search over Multimedia Information.
Int. J. on Digital Libraries 1(4): 377-385 (1997) |
| 1996 |
|---|
| 69 | EE | Alfred V. Aho:
Accessing Information from Globally Distributed Knowledge Repositories.
PODS 1996: 1-4 |
| 1995 |
|---|
| 68 | EE | Alfred V. Aho,
Nancy D. Griffeth:
Feature Interactions in the Global Information Infrastructure (Panel).
SIGSOFT FSE 1995: 2-4 |
| 1990 |
|---|
| 67 | | Alfred V. Aho:
Algorithms for Finding Patterns in Strings.
Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 255-300 |
| 1989 |
|---|
| 66 | EE | Alfred V. Aho,
Mahadevan Ganapathi,
Steven W. K. Tjiang:
Code Generation Using Tree Matching and Dynamic Programming.
ACM Trans. Program. Lang. Syst. 11(4): 491-516 (1989) |
| 1988 |
|---|
| 65 | | Alfred V. Aho,
Brian W. Kernighan,
Peter J. Weinberger:
The AWK Programming Language
Addison-Wesley 1988 |
| 64 | | Alfred V. Aho,
Ravi Sethi:
Maintaining Cross References in Manuscripts.
Softw., Pract. Exper. 18(1): 1-13 (1988) |
| 1986 |
|---|
| 63 | | Alfred V. Aho,
Ravi Sethi,
Jeffrey D. Ullman:
Compilers: Princiles, Techniques, and Tools.
Addison-Wesley 1986 |
| 62 | | Alfred V. Aho,
David Lee:
Storing a Dynamic Sparse Table
FOCS 1986: 55-60 |
| 1985 |
|---|
| 61 | | Alfred V. Aho,
Mahadevan Ganapathi:
Efficient Tree Pattern Matching: An Aid to Code Generation.
POPL 1985: 334-340 |
| 1983 |
|---|
| 60 | | Alfred V. Aho,
John E. Hopcroft,
Jeffrey D. Ullman:
Data Structures and Algorithms.
Addison-Wesley 1983 |
| 59 | | Alfred V. Aho,
Jeffrey D. Ullman,
Mihalis Yannakakis:
On Notions of Information Transfer in VLSI Circuits
STOC 1983: 133-139 |
| 1981 |
|---|
| 58 | | Alfred V. Aho,
Yehoshua Sagiv,
Thomas G. Szymanski,
Jeffrey D. Ullman:
Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions.
SIAM J. Comput. 10(3): 405-421 (1981) |
| 1979 |
|---|
| 57 | | Alfred V. Aho,
Jeffrey D. Ullman,
Mihalis Yannakakis:
Modeling Communications Protocols by Automata
FOCS 1979: 267-273 |
| 56 | EE | Alfred V. Aho,
Jeffrey D. Ullman:
The Universality of Data Retrieval Languages.
POPL 1979: 110-120 |
| 55 | EE | Alfred V. Aho,
Jeffrey D. Ullman:
Optimal Partial-Match Retrieval When Fields Are Independently Specified.
ACM Trans. Database Syst. 4(2): 168-179 (1979) |
| 54 | EE | Alfred V. Aho,
Catriel Beeri,
Jeffrey D. Ullman:
The Theory of Joins in Relational Databases.
ACM Trans. Database Syst. 4(3): 297-314 (1979) |
| 53 | EE | Alfred V. Aho,
Yehoshua Sagiv,
Jeffrey D. Ullman:
Efficient Optimization of a Class of Relational Expressions.
ACM Trans. Database Syst. 4(4): 435-454 (1979) |
| 52 | | Alfred V. Aho,
Yehoshua Sagiv,
Jeffrey D. Ullman:
Equivalences Among Relational Expressions.
SIAM J. Comput. 8(2): 218-246 (1979) |
| 51 | | Alfred V. Aho,
Brian W. Kernighan,
Peter J. Weinberger:
Awk-A Pattern Scanning and Processing Language.
Softw., Pract. Exper. 9(4): 267-279 (1979) |
| 1978 |
|---|
| 50 | EE | Alfred V. Aho,
Steven C. Johnson:
Tools For Automatic Compiler Generation (Panel Discussion).
ACM Annual Conference (1) 1978: 476 |
| 49 | EE | Alfred V. Aho,
Susan L. Graham:
Tools For Automatic Compiler Generation (Panel Discussion).
ACM Annual Conference (1) 1978: 476-477 |
| 48 | EE | Alfred V. Aho,
Yehoshua Sagiv,
Jeffrey D. Ullman:
Efficient Optimization of a Class of Relational Expressions (Abstract).
SIGMOD Conference 1978: 39 |
| 1977 |
|---|
| 47 | | Alfred V. Aho,
Catriel Beeri,
Jeffrey D. Ullman:
The Theory of Joins in Relational Data Bases (Extended Abstract)
FOCS 1977: 107-113 |
| 46 | | Alfred V. Aho,
Ravi Sethi:
How Hard is Compiler Code Generation?
ICALP 1977: 1-15 |
| 45 | | Alfred V. Aho,
Stephen C. Johnson,
Jeffrey D. Ullman:
Code Generation for Machines with Multiregister Operations.
POPL 1977: 21-28 |
| 44 | EE | Alfred V. Aho,
Stephen C. Johnson,
Jeffrey D. Ullman:
Code Generation for Expressions with Common Subexpressions.
J. ACM 24(1): 146-160 (1977) |
| 1976 |
|---|
| 43 | | Alfred V. Aho,
Stephen C. Johnson,
Jeffrey D. Ullman:
Code Generation for Expressions with Common Subexpressions.
POPL 1976: 19-31 |
| 42 | EE | Alfred V. Aho,
Daniel S. Hirschberg,
Jeffrey D. Ullman:
Bounds on the Complexity of the Longest Common Subsequence Problem.
J. ACM 23(1): 1-12 (1976) |
| 41 | EE | Alfred V. Aho,
Stephen C. Johnson:
Optimal Code Generation for Expression Trees.
J. ACM 23(3): 488-501 (1976) |
| 40 | | Alfred V. Aho,
Jeffrey D. Ullman:
Node Listings for Reducible Flow Graphs.
J. Comput. Syst. Sci. 13(3): 286-299 (1976) |
| 39 | | Alfred V. Aho,
John E. Hopcroft,
Jeffrey D. Ullman:
On Finding Lowest Common Ancestors in Trees.
SIAM J. Comput. 5(1): 115-132 (1976) |
| 1975 |
|---|
| 38 | | Alfred V. Aho,
Jeffrey D. Ullman:
Node Listings for Reducible Flow Graphs
STOC 1975: 177-185 |
| 37 | | Alfred V. Aho,
Stephen C. Johnson:
Optimal Code Generation for Expression Trees
STOC 1975: 207-217 |
| 36 | | Alfred V. Aho,
Margaret J. Corasick:
Efficient String Matching: An Aid to Bibliographic Search.
Commun. ACM 18(6): 333-340 (1975) |
| 35 | | Alfred V. Aho,
Stephen C. Johnson,
Jeffrey D. Ullman:
Deterministic Parsing of Ambiguous Grammars.
Commun. ACM 18(8): 441-452 (1975) |
| 34 | | Alfred V. Aho,
Kenneth Steiglitz,
Jeffrey D. Ullman:
Evaluating Polynomials at Fixed Sets of Points.
SIAM J. Comput. 4(4): 533-539 (1975) |
| 1974 |
|---|
| 33 | | Alfred V. Aho,
John E. Hopcroft,
Jeffrey D. Ullman:
The Design and Analysis of Computer Algorithms.
Addison-Wesley 1974 |
| 32 | | Alfred V. Aho,
Daniel S. Hirschberg,
Jeffrey D. Ullman:
Bounds on the Complexity of the Longest Common Subsequence Problem (Extended Abstract)
FOCS 1974: 104-109 |
| 31 | | Alfred V. Aho,
Stephen C. Johnson:
LR Parsing.
ACM Comput. Surv. 6(2): 99-124 (1974) |
| 1973 |
|---|
| 30 | | Alfred V. Aho,
Steven C. Johnson,
Jeffrey D. Ullman:
Deterministic Parsing of Ambiguous Grammars.
POPL 1973: 1-21 |
| 29 | | Alfred V. Aho,
John E. Hopcroft,
Jeffrey D. Ullman:
On Finding Lowest Common Ancestors in Trees
STOC 1973: 253-265 |
| 28 | | Alfred V. Aho,
Jeffrey D. Ullman:
Error Detection in Precedence Parsers.
Mathematical Systems Theory 7(2): 97-113 (1973) |
| 27 | | Alfred V. Aho,
Jeffrey D. Ullman:
A Technique for Speeding up LR(k) Parsers.
SIAM J. Comput. 2(2): 106-127 (1973) |
| 1972 |
|---|
| 26 | | Alfred V. Aho,
Jeffrey D. Ullman:
A Technique for Speeding Up LR(k) Parsers
STOC 1972: 251-263 |
| 25 | EE | Alfred V. Aho,
Peter J. Denning,
Jeffrey D. Ullman:
Weak and Mixed Strategy Precedence Parsing.
J. ACM 19(2): 225-243 (1972) |
| 24 | | Alfred V. Aho,
Jeffrey D. Ullman:
Equivalence of Programs with Structured Variables.
J. Comput. Syst. Sci. 6(2): 125-137 (1972) |
| 23 | | Alfred V. Aho,
Jeffrey D. Ullman:
Optimization of LR(k) Parsers.
J. Comput. Syst. Sci. 6(6): 573-602 (1972) |
| 22 | | Alfred V. Aho,
Jeffrey D. Ullman:
Optimization of Straight Line Programs.
SIAM J. Comput. 1(1): 1-19 (1972) |
| 21 | | Alfred V. Aho,
M. R. Garey,
Jeffrey D. Ullman:
The Transitive Reduction of a Directed Graph.
SIAM J. Comput. 1(2): 131-137 (1972) |
| 20 | | Alfred V. Aho,
Thomas G. Peterson:
A Minimum Distance Error-Correcting Parser for Context-Free Languages.
SIAM J. Comput. 1(4): 305-312 (1972) |
| 1971 |
|---|
| 19 | | Alfred V. Aho,
Jeffrey D. Ullman:
The Care and Feeding of LR(k) Grammars
STOC 1971: 159-170 |
| 18 | | Alfred V. Aho,
Jeffrey D. Ullman:
Translations on a Context-Free Grammar
Information and Control 19(5): 439-475 (1971) |
| 17 | EE | Alfred V. Aho,
Peter J. Denning,
Jeffrey D. Ullman:
Principles of Optimal Page Replacement.
J. ACM 18(1): 80-93 (1971) |
| 16 | | Alfred V. Aho,
Jeffrey D. Ullman:
Characterizations and Extensions of Pushdown Translations.
Mathematical Systems Theory 5(2): 172-192 (1971) |
| 1970 |
|---|
| 15 | | Alfred V. Aho,
Jeffrey D. Ullman:
Equivalence of Programs with Structured Variables
FOCS 1970: 25-31 |
| 14 | | Alfred V. Aho,
Jeffrey D. Ullman:
Transformations on Straight Line Programs-Preliminary Version
STOC 1970: 136-148 |
| 13 | | Alfred V. Aho,
Jeffrey D. Ullman,
John E. Hopcroft:
On the Computational Power of Pushdown Automata.
J. Comput. Syst. Sci. 4(2): 129-136 (1970) |
| 12 | | Alfred V. Aho,
Jeffrey D. Ullman:
A Characterization of Two-Way Deterministic Classes of Languages.
J. Comput. Syst. Sci. 4(6): 523-538 (1970) |
| 1969 |
|---|
| 11 | | Alfred V. Aho,
Jeffrey D. Ullman:
A Characterization of Two-Way Deterministic Classes of Languages
FOCS 1969: 231-239 |
| 10 | | Alfred V. Aho,
Jeffrey D. Ullman:
Translations on a Context Free Grammar
STOC 1969: 93-112 |
| 9 | EE | Alfred V. Aho:
Nested Stack Automata.
J. ACM 16(3): 383-406 (1969) |
| 8 | | Alfred V. Aho,
Jeffrey D. Ullman:
Syntax Directed Translations and the Pushdown Assembler.
J. Comput. Syst. Sci. 3(1): 37-56 (1969) |
| 7 | | Alfred V. Aho,
Jeffrey D. Ullman:
Properties of Syntax Directed Translations.
J. Comput. Syst. Sci. 3(3): 319-334 (1969) |
| 6 | | Alfred V. Aho,
John E. Hopcroft,
Jeffrey D. Ullman:
A General Theory of Translation.
Mathematical Systems Theory 3(3): 193-221 (1969) |
| 1968 |
|---|
| 5 | | Alfred V. Aho,
Jeffrey D. Ullman:
Automaton Analogs of Syntax Directed Translation Schemata
FOCS 1968: 143-159 |
| 4 | | Alfred V. Aho,
John E. Hopcroft,
Jeffrey D. Ullman:
Time and Tape Complexity of Pushdown Automaton Languages
Information and Control 13(3): 186-206 (1968) |
| 3 | EE | Alfred V. Aho:
Indexed Grammars - An Extension of Context-Free Grammars.
J. ACM 15(4): 647-671 (1968) |
| 2 | | Alfred V. Aho,
Jeffrey D. Ullman:
The Theory of Languages.
Mathematical Systems Theory 2(2): 97-125 (1968) |
| 1967 |
|---|
| 1 | | Alfred V. Aho:
Indexed Grammars-An Extension of Context Free Grammars
FOCS 1967: 21-31 |
