Alfred V. Aho

According to our database1, Alfred V. Aho authored at least 95 papers between 1967 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Awards

IEEE Fellow

IEEE Fellow 1988, "For contributions to programming language translation, to data structures and algorithms, and to data systems.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Learning Java in a New York City immigrant engineer retraining program.
Proceedings of the 2017 IEEE Frontiers in Education Conference, 2017

2015
Android Malware Static Analysis Techniques.
Proceedings of the 10th Annual Cyber and Information Security Research Conference, 2015

2014
A front row seat to Communications' editorial transformation.
Commun. ACM, 2014

2012
Computation and Computational Thinking.
Comput. J., 2012

2011
Ubiquity symposium: Computation and Computational Thinking.
Ubiquity, 2011

Complexity Theory.
Proceedings of the Computer Science, The Hardware, Software and Heart of It, 2011

2008
Do Crosscutting Concerns Cause Defects?
IEEE Trans. Software Eng., 2008

Teaching the compilers course.
SIGCSE Bulletin, 2008

CERBERUS: Tracing Requirements to Source Code Using Information Retrieval, Dynamic Analysis, and Program Analysis.
Proceedings of the 16th IEEE International Conference on Program Comprehension, 2008

2007
Debugging Aspect-Enabled Programs.
Proceedings of the Software Composition, 6th International Symposium, 2007

2006
A flow-map model for analyzing pseudothresholds in fault-tolerant quantum computing.
Quantum Information & Computation, 2006

A Layered Software Architecture for Quantum Computing Design Tools.
IEEE Computer, 2006

Statement Annotations for Fine-Grained Advising.
Proceedings of the RAM-SE'06-ECOOP'06 Workshop on Reflection, 2006

2003
Graph Representation.
Proceedings of the Handbook of Graph Theory., 2003

2002
Reminiscences on Influential Papers.
SIGMOD Record, 2002

2000
Hierarchical networks and the LSA N-squared problem in OSPF routing.
Proceedings of the Global Telecommunications Conference, 2000. GLOBECOM 2000, San Francisco, CA, USA, 27 November, 2000

1998
SCF3/Sculptor with Chisel: Requirements Engineering for Communications Services.
Proceedings of the Feature Interactions in Telecommunications and Software Systems V, September 29, 1998

1997
Emerging opportunities for theoretical computer science.
SIGACT News, 1997

Columbia Digital News Project: An Environment for Briefing and Search over Multimedia Information.
Int. J. on Digital Libraries, 1997

Columbia Digital News System An Environment for Briefing and Search over Multimedia Information.
Proceedings of the 4th International Forum on Research and Technology Advances in Digital Libraries (ADL '97), 1997

1996
Accessing Information from Globally Distributed Knowledge Repositories.
Proceedings of the Fifteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1996

Informatik - Datenstrukturen und Konzepte der Abstraktion.
Informatik Lehrbuchreihe, International Thomson, ISBN: 978-3-8266-0242-9, 1996

1995
Feature Interactions in the Global Information Infrastructure (Panel).
Proceedings of the SIGSOFT '95, 1995

1992
Foundations of Computer Science, C Edition
Computer Science Press / W. H. Freeman, ISBN: 0716782332, 1992

1991
An optimization technique for protocol conformance test generation based on UIO sequences and rural Chinese postman tours.
IEEE Trans. Communications, 1991

1990
Algorithms for Finding Patterns in Strings.
Proceedings of the Handbook of Theoretical Computer Science, 1990

1989
Code Generation Using Tree Matching and Dynamic Programming.
ACM Trans. Program. Lang. Syst., 1989

1988
Maintaining Cross References in Manuscripts.
Softw., Pract. Exper., 1988

The AWK Programming Language
Addison-Wesley, 1988

1986
Storing a Dynamic Sparse Table
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

Compilers: Principles, Techniques, and Tools.
Addison-Wesley series in computer science / World student series edition, Addison-Wesley, ISBN: 0201101947, 1986

1985
Efficient Tree Pattern Matching: An Aid to Code Generation.
Proceedings of the Conference Record of the Twelfth Annual ACM Symposium on Principles of Programming Languages, 1985

1983
On Notions of Information Transfer in VLSI Circuits
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

Data Structures and Algorithms.
Addison-Wesley, ISBN: 0-201-00023-7, 1983

1981
Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions.
SIAM J. Comput., 1981

1980
Translator Writing Systems: Where Do they Now Stand?
IEEE Computer, 1980

1979
Optimal Partial-Match Retrieval When Fields Are Independently Specified.
ACM Trans. Database Syst., 1979

Efficient Optimization of a Class of Relational Expressions.
ACM Trans. Database Syst., 1979

The Theory of Joins in Relational Databases.
ACM Trans. Database Syst., 1979

Awk-A Pattern Scanning and Processing Language.
Softw., Pract. Exper., 1979

Equivalences Among Relational Expressions.
SIAM J. Comput., 1979

The Universality of Data Retrieval Languages.
Proceedings of the Conference Record of the Sixth Annual ACM Symposium on Principles of Programming Languages, 1979

Modeling Communications Protocols by Automata
Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

1978
Efficient Optimization of a Class of Relational Expressions (Abstract).
Proceedings of the 1978 ACM SIGMOD International Conference on Management of Data, Austin, Texas, USA, May 31, 1978

Tools For Automatic Compiler Generation (Panel Discussion).
Proceedings of the Proceedings 1978 ACM Annual Conference, 1978

Tools For Automatic Compiler Generation (Panel Discussion).
Proceedings of the Proceedings 1978 ACM Annual Conference, 1978

1977
Rectilinear steiner trees: Efficient special-case algorithms.
Networks, 1977

Code Generation for Machines with Multiregister Operations.
Proceedings of the Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, 1977

How Hard is Compiler Code Generation?
Proceedings of the Automata, 1977

The Theory of Joins in Relational Data Bases (Extended Abstract)
Proceedings of the 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October, 1977

1976
On Finding Lowest Common Ancestors in Trees.
SIAM J. Comput., 1976

Node Listings for Reducible Flow Graphs.
J. Comput. Syst. Sci., 1976

Optimal Code Generation for Expression Trees.
J. ACM, 1976

Bounds on the Complexity of the Longest Common Subsequence Problem.
J. ACM, 1976

Code Generation for Expressions with Common Subexpressions.
Proceedings of the Conference Record of the Third ACM Symposium on Principles of Programming Languages, 1976

1975
Evaluating Polynomials at Fixed Sets of Points.
SIAM J. Comput., 1975

Efficient String Matching: An Aid to Bibliographic Search.
Commun. ACM, 1975

Node Listings for Reducible Flow Graphs
Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 1975

Optimal Code Generation for Expression Trees
Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 1975

1974
Dynamic Memories with Rapid Random and Sequential Access.
IEEE Trans. Computers, 1974

LR Parsing.
ACM Comput. Surv., 1974

Bounds on the Complexity of the Longest Common Subsequence Problem (Extended Abstract)
Proceedings of the 15th Annual Symposium on Switching and Automata Theory, 1974

The Design and Analysis of Computer Algorithms.
Addison-Wesley, ISBN: 0-201-00029-6, 1974

1973
A Technique for Speeding up LR(k) Parsers.
SIAM J. Comput., 1973

Error Detection in Precedence Parsers.
Mathematical Systems Theory, 1973

On Finding Lowest Common Ancestors in Trees
Proceedings of the 5th Annual ACM Symposium on Theory of Computing, April 30, 1973

Deterministic Parsing of Ambiguous Grammars.
Proceedings of the Conference Record of the ACM Symposium on Principles of Programming Languages, 1973

The theory of parsing, translation, and compiling. 2: Compiling.
Prentice-Hall, ISBN: 0139145648, 1973

1972
Optimization of Straight Line Programs.
SIAM J. Comput., 1972

A Minimum Distance Error-Correcting Parser for Context-Free Languages.
SIAM J. Comput., 1972

The Transitive Reduction of a Directed Graph.
SIAM J. Comput., 1972

Optimization of LR(k) Parsers.
J. Comput. Syst. Sci., 1972

Equivalence of Programs with Structured Variables.
J. Comput. Syst. Sci., 1972

Weak and Mixed Strategy Precedence Parsing.
J. ACM, 1972

A Technique for Speeding Up LR(k) Parsers
Proceedings of the 4th Annual ACM Symposium on Theory of Computing, 1972

The theory of parsing, translation, and compiling. 1: Parsing
Prentice-Hall, ISBN: 0139145567, 1972

1971
Characterizations and Extensions of Pushdown Translations.
Mathematical Systems Theory, 1971

Principles of Optimal Page Replacement.
J. ACM, 1971

The Care and Feeding of LR(k) Grammars
Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, 1971

1970
On the Computational Power of Pushdown Automata.
J. Comput. Syst. Sci., 1970

A Characterization of Two-Way Deterministic Classes of Languages.
J. Comput. Syst. Sci., 1970

Transformations on Straight Line Programs-Preliminary Version
Proceedings of the 2nd Annual ACM Symposium on Theory of Computing, 1970

Equivalence of Programs with Structured Variables
Proceedings of the 11th Annual Symposium on Switching and Automata Theory, 1970

1969
A General Theory of Translation.
Mathematical Systems Theory, 1969

Properties of Syntax Directed Translations.
J. Comput. Syst. Sci., 1969

Syntax Directed Translations and the Pushdown Assembler.
J. Comput. Syst. Sci., 1969

Nested Stack Automata.
J. ACM, 1969

Translations on a Context Free Grammar
Proceedings of the 1st Annual ACM Symposium on Theory of Computing, 1969

A Characterization of Two-Way Deterministic Classes of Languages
Proceedings of the 10th Annual Symposium on Switching and Automata Theory, 1969

1968
Time and Tape Complexity of Pushdown Automaton Languages
Information and Control, September, 1968

R68-27 Programming Languages for Automata.
IEEE Trans. Computers, 1968

The Theory of Languages.
Mathematical Systems Theory, 1968

Indexed Grammars - An Extension of Context-Free Grammars.
J. ACM, 1968

Automaton Analogs of Syntax Directed Translation Schemata
Proceedings of the 9th Annual Symposium on Switching and Automata Theory, 1968

1967
Indexed Grammars-An Extension of Context Free Grammars
Proceedings of the 8th Annual Symposium on Switching and Automata Theory, 1967


  Loading...