Graph minors. II. Algorithmic aspects of tree-width | 1986/09/01 | English | 509 |
An improved data stream summary: the count-min sketch and its applications | 2005/04/01 | English | 504 |
Cuckoo hashing | 2004/05/01 | English | 290 |
A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation | 1995/05/01 | English | 280 |
Tensor rank is NP-complete | 1990/12/01 | English | 242 |
A fast and simple randomized parallel algorithm for the maximal independent set problem | 1986/12/01 | English | 229 |
An efficient algorithm for the “stable roommates” problem | 1985/12/01 | English | 197 |
An O(logn) parallel connectivity algorithm | 1982/03/01 | English | 192 |
Greedy Strikes Back: Improved Facility Location Algorithms | 1999/04/01 | English | 190 |
Fast solution of toeplitz systems of equations and computation of Padé approximants | 1980/09/01 | English | 190 |
Isomorph-Free Exhaustive Generation | 1998/02/01 | English | 186 |
A linear-time approximation algorithm for the weighted vertex cover problem | 1981/06/01 | English | 180 |
The Byzantine generals strike again | 1982/03/01 | English | 163 |
On the Complexity of Dualization of Monotone Disjunctive Normal Forms | 1996/11/01 | English | 157 |
Vertex Cover: Further Observations and Further Improvements | 2001/11/01 | English | 153 |
Dynamic huffman coding | 1985/06/01 | English | 151 |
The NP-completeness column: an ongoing guide | 1985/09/01 | English | 149 |
A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees | 1995/07/01 | English | 148 |
A “retraction” method for planning the motion of a disc | 1985/03/01 | English | 143 |
Finding the maximum, merging, and sorting in a parallel computation model | 1981/03/01 | English | 142 |
An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm | 1997/01/01 | English | 140 |
A Survey of Fast Exponentiation Methods | 1998/04/01 | English | 138 |
Finding approximate patterns in strings | 1985/03/01 | English | 134 |
Algorithms for maximum independent sets | 1986/09/01 | English | 133 |
The theory and computation of evolutionary distances: Pattern recognition | 1980/12/01 | English | 131 |
Decomposable searching problems I. Static-to-dynamic transformation | 1980/12/01 | English | 127 |
Approximation Algorithms for Directed Steiner Problems | 1999/10/01 | English | 123 |
An Incremental Algorithm for a Generalization of the Shortest-Path Problem | 1996/09/01 | English | 118 |
Finding the convex hull of a simple polygon | 1983/12/01 | English | 116 |
A linear algorithm for computing the visibility polygon from a point | 1981/06/01 | English | 112 |