| Depth-First Search and Linear Graph Algorithms | 1972/06/01 | English | 2,474 |
| An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs | 1973/12/01 | English | 1,022 |
| Fast Pattern Matching in Strings | 1977/06/01 | English | 936 |
| The Complexity of Enumeration and Reliability Problems | 1979/08/01 | English | 738 |
| The Knowledge Complexity of Interactive Proof Systems | 1989/02/01 | English | 622 |
| A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks | 1988/04/01 | English | 559 |
| Algorithmic Aspects of Vertex Elimination on Graphs | 1976/06/01 | English | 532 |
| Suffix Arrays: A New Method for On-Line String Searches | 1993/10/01 | English | 520 |
| Genetic Algorithms and the Optimal Allocation of Trials | 1973/06/01 | English | 514 |
| The NP-Completeness of Edge-Coloring | 1981/11/01 | English | 508 |
| Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data | 2008/01/01 | English | 458 |
| On the Complexity of Timetable and Multicommodity Flow Problems | 1976/12/01 | English | 425 |
| Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms | 1974/12/01 | English | 405 |
| Fast Algorithms for Finding Nearest Common Ancestors | 1984/05/01 | English | 400 |
| Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems | 1983/11/01 | English | 397 |
| Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs | 1984/08/01 | English | 396 |
| An Analysis of Several Heuristics for the Traveling Salesman Problem | 1977/09/01 | English | 395 |
| Three Partition Refinement Algorithms | 1987/12/01 | English | 378 |
| Power Diagrams: Properties, Algorithms and Applications | 1987/02/01 | English | 368 |
| Privacy Amplification by Public Discussion | 1988/04/01 | English | 350 |
| Simple Fast Algorithms for the Editing Distance between Trees and Related Problems | 1989/12/01 | English | 343 |
| The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected | 1983/11/01 | English | 331 |
| The Discrete Geodesic Problem | 1987/08/01 | English | 327 |
| A Simple Parallel Algorithm for the Maximal Independent Set Problem | 1986/11/01 | English | 321 |
| Orthogonal Packings in Two Dimensions | 1980/11/01 | English | 317 |
| Dividing a Graph into Triconnected Components | 1973/09/01 | English | 309 |
| On the Complexity of Some Common Geometric Location Problems | 1984/02/01 | English | 307 |
| An Application of Bin-Packing to Multiprocessor Scheduling | 1978/02/01 | English | 303 |
| Finding All the Elementary Circuits of a Directed Graph | 1975/03/01 | English | 302 |
| A Linear Recognition Algorithm for Cographs | 1985/11/01 | English | 288 |