| Conjugate coding | 1983/01/01 | English | 606 |
| Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services | 2002/06/01 | English | 344 |
| Big Omicron and big Omega and big Theta | 1976/04/01 | English | 255 |
| Introduction to automata theory, languages, and computation, 2nd edition | 2001/03/01 | English | 177 |
| Approximation Algorithms for NP-Hard Problems | 1997/06/01 | English | 154 |
| Invitation to data reduction and problem kernelization | 2007/03/01 | English | 133 |
| The circuit value problem is log space complete for
P | 1975/01/01 | English | 117 |
| Topology control and routing in ad hoc networks | 2002/06/01 | English | 114 |
| Guest Column: NP-complete problems and physical reality | 2005/03/01 | English | 108 |
| Algorithmic problems in power management | 2005/06/01 | English | 99 |
| Coin flipping by telephone a protocol for solving impossible problems | 1983/01/01 | English | 95 |
| Introduction to the Theory of Computation | 1996/03/01 | English | 91 |
| The monotone and planar circuit value problems are log space complete for P | 1977/07/01 | English | 86 |
| Quantum search algorithms | 2004/06/01 | English | 72 |
| Guest Column | 2017/06/12 | English | 70 |
| Dynamic networks | 2011/03/21 | English | 68 |
| Experimental quantum cryptography: the dawn of a new era for quantum cryptography: the experimental prototype is working] | 1989/11/01 | English | 60 |
| Planar 3-colorability is polynomial complete | 1973/07/01 | English | 55 |
| A survey of buffer management policies for packet switches | 2010/03/01 | English | 48 |
| Improved string matching with k mismatches | 1986/03/01 | English | 46 |
| Trusting the cloud | 2009/06/20 | English | 43 |
| Postscript about NP-hard problems | 1974/04/01 | English | 42 |
| Computing variance for interval data is NP-hard | 2002/06/01 | English | 42 |
| On-line bipartite matching made simple | 2008/03/01 | English | 41 |
| On the time required to recognize properties of graphs | 1973/10/01 | English | 39 |
| An NP-hard problem in bipartite graphs | 1975/01/01 | English | 37 |
| Algorithms on Stings, Trees, and Sequences | 1997/12/01 | English | 36 |
| Guest column | 2013/06/03 | English | 35 |
| Toward a cloud computing research agenda | 2009/06/20 | English | 33 |
| Routing in distributed networks | 2001/03/01 | English | 33 |