| Data Types as Lattices | 1976/09/01 | English | 288 |
| How to Generate Cryptographically Strong Sequences of Pseudorandom Bits | 1984/11/01 | English | 281 |
| Optimal Search in Planar Subdivisions | 1983/02/01 | English | 279 |
| The Transitive Reduction of a Directed Graph | 1972/06/01 | English | 274 |
| Planar Formulae and Their Uses | 1982/05/01 | English | 268 |
| Parallel Merge Sort | 1988/08/01 | English | 264 |
| Maximizing a Monotone Submodular Function Subject to a Matroid Constraint | 2011/01/01 | English | 262 |
| Computational Complexity of Probabilistic Turing Machines | 1977/12/01 | English | 262 |
| A New Algorithm for Generating All the Maximal Independent Sets | 1977/09/01 | English | 260 |
| A Simple Unpredictable Pseudo-Random Number Generator | 1986/05/01 | English | 256 |
| The Complexity of Computing a Nash Equilibrium | 2009/01/01 | English | 254 |
| Approximating the Permanent | 1989/12/01 | English | 253 |
| Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question | 1975/12/01 | English | 251 |
| The Recognition of Series Parallel Digraphs | 1982/05/01 | English | 251 |
| A Powerdomain Construction | 1976/09/01 | English | 236 |
| Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph | 1972/06/01 | English | 236 |
| A Fast Parametric Maximum Flow Algorithm and Applications | 1989/02/01 | English | 235 |
| Conditions for Unique Graph Realizations | 1992/02/01 | English | 234 |
| PP is as Hard as the Polynomial-Time Hierarchy | 1991/10/01 | English | 220 |
| Hamilton Paths in Grid Graphs | 1982/11/01 | English | 219 |
| Applications of a Planar Separator Theorem | 1980/08/01 | English | 218 |
| Network Flow and Testing Graph Connectivity | 1975/12/01 | English | 217 |
| An Efficient Parallel Biconnectivity Algorithm | 1985/11/01 | English | 215 |
| The Planar Hamiltonian Circuit Problem is NP-Complete | 1976/12/01 | English | 215 |
| The Price of Stability for Network Design with Fair Cost Allocation | 2008/01/01 | English | 215 |
| Locality in Distributed Graph Algorithms | 1992/02/01 | English | 213 |
| What Can We Learn Privately? | 2011/01/01 | English | 209 |
| Nondeterministic Space is Closed under Complementation | 1988/10/01 | English | 208 |
| Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms | 1980/11/01 | English | 202 |
| Optimal Point Location in a Monotone Subdivision | 1986/05/01 | English | 201 |