| # | Title | Journal | Year | Citations |
|---|
| 1 | Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer | SIAM Journal on Computing | 1997 | 4,912 |
| 2 | Depth-First Search and Linear Graph Algorithms | SIAM Journal on Computing | 1972 | 4,625 |
| 3 | Fast Pattern Matching in Strings | SIAM Journal on Computing | 1977 | 2,203 |
| 4 | Sparse Approximate Solutions to Linear Systems | SIAM Journal on Computing | 1995 | 2,176 |
| 5 | The Knowledge Complexity of Interactive Proof Systems | SIAM Journal on Computing | 1989 | 2,164 |
| 6 | An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs | SIAM Journal on Computing | 1973 | 2,113 |
| 7 | A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks | SIAM Journal on Computing | 1988 | 2,061 |
| 8 | Identity-Based Encryption from the Weil Pairing | SIAM Journal on Computing | 2003 | 2,051 |
| 9 | The Complexity of Enumeration and Reliability Problems | SIAM Journal on Computing | 1979 | 1,549 |
| 10 | Suffix Arrays: A New Method for On-Line String Searches | SIAM Journal on Computing | 1993 | 1,468 |
| 11 | Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data | SIAM Journal on Computing | 2008 | 1,172 |
| 12 | The Nonstochastic Multiarmed Bandit Problem | SIAM Journal on Computing | 2002 | 1,106 |
| 13 | A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth | SIAM Journal on Computing | 1996 | 1,103 |
| 14 | A Pseudorandom Generator from any One-way Function | SIAM Journal on Computing | 1999 | 1,090 |
| 15 | How to Generate Cryptographically Strong Sequences of Pseudorandom Bits | SIAM Journal on Computing | 1984 | 1,013 |
| 16 | Simple Fast Algorithms for the Editing Distance between Trees and Related Problems | SIAM Journal on Computing | 1989 | 956 |
| 17 | Quantum Complexity Theory | SIAM Journal on Computing | 1997 | 946 |
| 18 | Finding the k Shortest Paths | SIAM Journal on Computing | 1998 | 944 |
| 19 | Three Partition Refinement Algorithms | SIAM Journal on Computing | 1987 | 936 |
| 20 | Genetic Algorithms and the Optimal Allocation of Trials | SIAM Journal on Computing | 1973 | 935 |
| 21 | Algorithmic Aspects of Vertex Elimination on Graphs | SIAM Journal on Computing | 1976 | 924 |
| 22 | Strengths and Weaknesses of Quantum Computing | SIAM Journal on Computing | 1997 | 906 |
| 23 | Fast Algorithms for Finding Nearest Common Ancestors | SIAM Journal on Computing | 1984 | 874 |
| 24 | The NP-Completeness of Edge-Coloring | SIAM Journal on Computing | 1981 | 859 |
| 25 | A Simple Parallel Algorithm for the Maximal Independent Set Problem | SIAM Journal on Computing | 1986 | 856 |
| 26 | On the Complexity of Timetable and Multicommodity Flow Problems | SIAM Journal on Computing | 1976 | 839 |
| 27 | Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs | SIAM Journal on Computing | 1984 | 793 |
| 28 | A Simple Unpredictable Pseudo-Random Number Generator | SIAM Journal on Computing | 1986 | 784 |
| 29 | Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms | SIAM Journal on Computing | 1974 | 748 |
| 30 | Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems | SIAM Journal on Computing | 1983 | 720 |
| 31 | The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory | SIAM Journal on Computing | 1998 | 720 |
| 32 | An Analysis of Several Heuristics for the Traveling Salesman Problem | SIAM Journal on Computing | 1977 | 706 |
| 33 | Privacy Amplification by Public Discussion | SIAM Journal on Computing | 1988 | 694 |
| 34 | How to Construct Pseudorandom Permutations from Pseudorandom Functions | SIAM Journal on Computing | 1988 | 685 |
| 35 | Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack | SIAM Journal on Computing | 2003 | 685 |
| 36 | Finding All the Elementary Circuits of a Directed Graph | SIAM Journal on Computing | 1975 | 670 |
| 37 | Dividing a Graph into Triconnected Components | SIAM Journal on Computing | 1973 | 658 |
| 38 | On the Power of Quantum Computation | SIAM Journal on Computing | 1997 | 657 |
| 39 | Distributed Anonymous Mobile Robots: Formation of Geometric Patterns | SIAM Journal on Computing | 1999 | 642 |
| 40 | Parallel Merge Sort | SIAM Journal on Computing | 1988 | 631 |
| 41 | Optimal Search in Planar Subdivisions | SIAM Journal on Computing | 1983 | 625 |
| 42 | Power Diagrams: Properties, Algorithms and Applications | SIAM Journal on Computing | 1987 | 625 |
| 43 | Locality in Distributed Graph Algorithms | SIAM Journal on Computing | 1992 | 625 |
| 44 | Robust Characterizations of Polynomials with Applications to Program Testing | SIAM Journal on Computing | 1996 | 614 |
| 45 | A General Approximation Technique for Constrained Forest Problems | SIAM Journal on Computing | 1995 | 611 |
| 46 | Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question | SIAM Journal on Computing | 1975 | 604 |
| 47 | Computational Complexity of Probabilistic Turing Machines | SIAM Journal on Computing | 1977 | 596 |
| 48 | Data Types as Lattices | SIAM Journal on Computing | 1976 | 587 |
| 49 | Nonmalleable Cryptography | SIAM Journal on Computing | 2000 | 587 |
| 50 | The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected | SIAM Journal on Computing | 1983 | 569 |
