| An attack on the Needham-Schroeder public-key authentication protocol | 1995/11/01 | English | 116 |
| Weighted random sampling with a reservoir | 2006/03/01 | English | 114 |
| Voronoi diagrams from convex hulls | 1979/12/01 | English | 114 |
| Relative complexity of checking and evaluating | 1976/05/01 | English | 113 |
| Constructing the visibility graph for n-line segments in O(n2) time | 1985/05/01 | English | 111 |
| Depth-first search is inherently sequential | 1985/06/01 | English | 110 |
| A note on preemptive scheduling of periodic, real-time tasks | 1980/11/01 | English | 110 |
| The tree-to-tree editing problem | 1977/12/01 | English | 110 |
| Bipartite structure of all complex networks | 2004/06/01 | English | 108 |
| An efficient approximation for the Generalized Assignment Problem | 2006/11/01 | English | 106 |
| An O(|V|3) algorithm for finding maximum flows in networks | 1978/10/01 | English | 104 |
| A generalization of Dijkstra's algorithm | 1977/02/01 | English | 103 |
| O(n2.7799) complexity for n × n approximate matrix multiplication | 1979/06/01 | English | 101 |
| Log-logarithmic worst-case range queries are possible in space Θ(N) | 1983/08/01 | English | 99 |
| NP-completeness of some generalizations of the maximum matching problem | 1982/08/01 | English | 99 |
| Does co-NP have short interactive proofs? | 1987/05/01 | English | 95 |
| The Floyd–Warshall algorithm on graphs with negative cycles | 2010/04/01 | English | 95 |
| A linear algorithm for the domination number of a tree | 1975/11/01 | English | 95 |
| Derivation of a termination detection algorithm for distributed computations | 1983/06/01 | English | 94 |
| A note on finding the bridges of a graph | 1974/04/01 | English | 93 |
| Limits for automatic verification of finite-state concurrent systems | 1986/05/01 | English | 88 |
| The (n, k)-star graph: A generalized star graph | 1995/12/01 | English | 86 |
| Cryptographic implementation of a tree hierarchy for access control | 1988/02/01 | English | 83 |
| Dominating sets for split and bipartite graphs | 1984/07/01 | English | 83 |
| An 0(|E|loglog|V|) algorithm for finding minimum spanning trees | 1975/09/01 | English | 80 |
| The maximum k-colorable subgraph problem for chordal graphs | 1987/01/01 | English | 79 |
| Paw-free graphs | 1988/05/01 | English | 79 |
| A linear algorithm for finding the convex hull of a simple polygon | 1979/12/01 | English | 77 |
| Optimal implementations of UPGMA and other common clustering algorithms | 2007/12/01 | English | 77 |
| Intersection and union of regular languages and state complexity | 1992/09/01 | English | 76 |