| Analysis of Boyer and Moore's MJRTY algorithm | 4 | 0.45 | 2013 |
| Modulo intervals: a proposed notation | 0 | 0.34 | 2012 |
| Improved bounds for cops-and-robber pursuit | 0 | 0.34 | 2011 |
| Bounds for cops and robber pursuit | 2 | 0.41 | 2010 |
| Average-case analysis of some plurality algorithms | 5 | 0.81 | 2009 |
| Determining plurality | 3 | 0.53 | 2008 |
| Average-case lower bounds for the plurality problem | 2 | 0.45 | 2008 |
| Line drawing, leap years, and Euclid | 3 | 0.58 | 2004 |
| The worst-case chip problem | 6 | 0.59 | 2004 |
| Quicksort with Unreliable Comparisons: A Probabilistic Analysis | 2 | 0.42 | 2004 |
| Index assignment for multichannel communication under failure | 26 | 1.56 | 2000 |
| A potential-based amortized analysis of the union-find data structure | 3 | 0.44 | 2000 |
| Optimal multichannel communication under failure | 0 | 0.34 | 1999 |
| The Average-Case Complexity of Determining the Majority | 35 | 2.73 | 1997 |
| K-M-P string matching revisited | 1 | 0.37 | 1997 |
| K-M-P string matching revisited | 1 | 0.37 | 1997 |
| Generalized Kraft'S Inequality And Discrete K-Modal Search | 5 | 0.58 | 1996 |
| The complexity of pursuit on a graph | 48 | 3.52 | 1995 |
| Multidimensional Divide-and-Conquer Maximin Recurrences | 4 | 0.58 | 1995 |
| Efficient management of dynamic tables | 1 | 0.44 | 1994 |
| Determining the majority | 31 | 2.89 | 1993 |
| A Fibonacci version of Kraft's inequality applied discrete unimodal search | 8 | 0.70 | 1993 |
| Calendrical calculations, II: three historical calendars | 3 | 0.67 | 1993 |
| Ordinal Arithmetic with List Structures | 3 | 0.46 | 1992 |
| "Lion and Man": Upper and Lower Bounds | 26 | 2.50 | 1992 |
| Graph drawing by force-directed placement | 1316 | 133.04 | 1991 |
| Scheduling on a hypercube | 1 | 0.46 | 1991 |
| Stochastic Rearrangement Rules for Self-Organizing Data Structures | 4 | 0.55 | 1991 |
| More nearly optimal algorithms for unbounded searching, part I: the finite case | 6 | 1.15 | 1991 |
| More nearly optimal algorithms for unbounded searching, part II: the transfinite case | 4 | 0.74 | 1991 |
| Probabilistic Analysis of a Grouping Algorithm | 0 | 0.34 | 1991 |
| Calendrical Calculations | 14 | 2.96 | 1990 |
| Optimum lopsided binary trees | 18 | 1.52 | 1989 |
| Solution of a divide-and-conquer maximin recurrence | 12 | 1.16 | 1989 |
| The Traveling Salesman Problem And Minimum Matching In The Unit Square | 15 | 4.41 | 1983 |
| Divide And Conquer Heuristics For Minimum Weighted Euclidean Matching | 10 | 8.59 | 1983 |
| Probabilistic Analysis Of Divide-And-Conquer Heuristics For Minimum Weighted Euclidean Matching | 8 | 3.65 | 1983 |
| The complexity of drawing trees nicely | 42 | 14.96 | 1982 |
| Aspects of insertion in random trees. | 1 | 0.37 | 1982 |
| On A Greedy Heuristic For Complete Matching | 40 | 14.07 | 1981 |
| A Comment On The Evaluation Of Polish Postfix Expressions | 0 | 0.34 | 1981 |
| Heuristics for weighted perfect matching | 17 | 10.18 | 1980 |
| Understanding the complexity of interpolation search | 26 | 10.42 | 1977 |
| Efficient generation of the binary reflected gray code and its applications | 110 | 34.69 | 1976 |
| Backtrack programming techniques | 133 | 85.28 | 1975 |
| A nonrecursive list moving algorithm | 3 | 2.82 | 1973 |
| Automating introductory computer science courses | 2 | 0.88 | 1973 |
| Binary search trees of bounded balance | 159 | 127.76 | 1972 |
| Establishing lower bounds on algorithms: a survey | 2 | 6.08 | 1972 |
| Simple Proofs of Lower Bounds for Polynomial Evaluation. | 0 | 0.34 | 1972 |
