#### Filter Results:

- Full text PDF available (60)

#### Publication Year

1967

2017

- This year (1)
- Last 5 years (14)
- Last 10 years (27)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullman
- Addison-Wesley series in computer science / World…
- 1986

Addison-Wesley Pub. Co., 1974, , 470 pages. With this text, you gain an understanding of the fundamental concepts of algorithms, the very heart of computer science. It introduces the basic data structures and programming techniques often used in efficient algorithms. Covers use of lists, push-down stacks, queues, trees, and graphs. Later chapters go into… (More)

- Alfred V. Aho, Margaret J. Corasick
- Commun. ACM
- 1975

This paper describes a simple, efficient algorithm to locate all occurrences of any of a finite number of keywords in a string of text. The algorithm consists of constructing a finite state pattern matching machine from the keywords and then using the pattern matching machine to process the text string in a single pass. Construction of the pattern matching… (More)

The classic text, but it lacks topics in network flows and linear programming, as well as more recent algorithms. Revised and more elementary version of the first six chapters of The Design and Analysis of Computer Algorithms. Good examples and problems. Focus on methods rather than specific problems. Reference book devoted to NP-completeness. The second… (More)

- Alfred V. Aho
- Handbook of Theoretical Computer Science, Volume…
- 1990

- Alfred V. Aho, Yehoshua Sagiv, Thomas G. Szymanski, Jeffrey D. Ullman
- SIAM J. Comput.
- 1981

- Alfred V. Aho, M. R. Garey, Jeffrey D. Ullman
- SIAM J. Comput.
- 1972

We consider economical representations for the path information in a directed graph. A directed graph G is said to be a transitive reduction of the directed graph G provided that (i) G has a directed path from vertex u to vertex v if and only if G has a directed path from vertex u to vertex v, and (ii) there is no graph with fewer arcs than G satisfying… (More)

- Alfred V. Aho, Anton T. Dahbura, David J Lee, M. Ümit Uyar
- IEEE Trans. Communications
- 1991

- Marc Eaddy, Thomas Zimmermann, +4 authors Alfred V. Aho
- IEEE Transactions on Software Engineering
- 2008

There is a growing consensus that crosscutting concerns harm code quality. An example of a crosscutting concern is a functional requirement whose implementation is distributed across multiple software modules. We asked the question, "How much does the amount that a concern is crosscutting affect the number of defects in a program?" We conducted three… (More)