• Publications
  • Influence
Introduction to Automata Theory, Languages and Computation
This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments. Expand
The Design and Analysis of Computer Algorithms
This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs. Expand
An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs
The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to $(m + n)\sqrt n $.
Data Structures and Algorithms
The basis of this book is the material contained in the first six chapters of the earlier work, The Design and Analysis of Computer Algorithms, and has added material on algorithms for external storage and memory management. Expand
Dividing a Graph into Triconnected Components
An algorithm for dividing a graph into triconnected components is presented and is both theoretically optimal to within a constant factor and efficient in practice. Expand
The Directed Subgraph Homeomorphism Problem
The set of pattern graphs for which the directed subgraph homeomorphism problem is NP-complete is characterized. A polynomial time algorithm is given for the remaining cases. The restricted problemExpand
Snapshot Ensembles: Train 1, get M for free
This paper proposes a method to obtain the seemingly contradictory goal of ensembling multiple neural networks at no additional training cost by training a single neural network, converging to several local minima along its optimization path and saving the model parameters. Expand
Formal languages and their relation to automata
The theory of formal languages as a coherent theory is presented and its relationship to automata theory is made explicit, including the Turing machine and certain advanced topics in language theory. Expand
Introduction to automata theory, languages, and computation, 2nd edition
The introduction to formal languages and automata wasolutionary rather than rcvolrrtionary and addressed Initially, I felt that giving solutions to exercises was undesirable hecause it lirrritcd the Chapter 1 fntroduction to the Theory of Computation. Expand
An n log n algorithm for minimizing states in a finite automaton
An algorithm is given for minimizing the number of states in a finite automaton or for determining if two finite automata are equivalent and the running time is bounded by k n log n. Expand