| Publication | Date of Publication | Type |
|---|
| Simple Proofs of Lower Bounds for Polynomial Evaluation | 2021-07-06 | Paper |
| Determining plurality | 2018-11-05 | Paper |
| Average-case lower bounds for the plurality problem | 2018-11-05 | Paper |
| Average-case analysis of some plurality algorithms | 2018-11-05 | Paper |
| Calendrical Calculations | 2018-01-23 | Paper |
| K-M-P string matching revisited | 2016-06-09 | Paper |
| Analysis of Boyer and Moore's \texttt{MJRTY} algorithm | 2014-04-11 | Paper |
| Improved bounds for cops-and-robber pursuit | 2011-08-02 | Paper |
| Indian Calendrical Calculations | 2011-07-27 | Paper |
| Bounds for cops and robber pursuit | 2010-09-02 | Paper |
| The worst-case chip problem | 2009-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5386123 | 2008-04-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5471353 | 2006-06-06 | Paper |
| Index assignment for multichannel communication under failure | 2005-05-11 | Paper |
| Quicksort with Unreliable Comparisons: A Probabilistic Analysis | 2005-04-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3153941 | 2002-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3148836 | 2002-09-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2757839 | 2001-12-04 | Paper |
| Cliques, the Cauchy inequality, and information theory. | 2001-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252377 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398762 | 1998-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398776 | 1998-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4367587 | 1997-11-27 | Paper |
| The Average-Case Complexity of Determining the Majority | 1997-08-03 | Paper |
| The complexity of pursuit on a graph | 1997-02-28 | Paper |
| Generalized Kraft’s Inequality and Discrete k-Modal Search | 1996-08-18 | Paper |
| Multidimensional Divide-and-Conquer Maximin Recurrences | 1995-09-20 | Paper |
| Efficient management of dynamic tables | 1994-05-26 | Paper |
| Determining the majority | 1994-01-31 | Paper |
| A Fibonacci Version of Kraft’s Inequality Applied to Discrete Unimodal Search | 1993-10-10 | Paper |
| “Lion and Man”: Upper and Lower Bounds | 1993-02-25 | Paper |
| Scheduling on a hypercube | 1992-06-28 | Paper |
| Optimum lopsided binary trees | 1992-06-25 | Paper |
| Probabilistic analysis of a grouping algorithm | 1991-01-01 | Paper |
| Stochastic rearrangement rules for self-organizing data structures | 1991-01-01 | Paper |
| More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case | 1991-01-01 | Paper |
| More Nearly Optimal Algorithms for Unbounded Searching, II:The Transfinite Case | 1991-01-01 | Paper |
| Solution of a Divide-and-Conquer Maximin Recurrence | 1989-01-01 | Paper |
| Recurrence relations based on minimization and maximization | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3773360 | 1985-01-01 | Paper |
| The complexity of drawing trees nicely | 1983-01-01 | Paper |
| Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching | 1983-01-01 | Paper |
| The Travelling Salesman Problem and Minimum Matching in the Unit Square | 1983-01-01 | Paper |
| Probabilistic analysis of divide‐and‐conquer heuristics for minimum weighted euclidean matching | 1983-01-01 | Paper |
| Aspects of insertion in random trees | 1982-01-01 | Paper |
| A Naturally Occurring Function Continuous Only at Irrationals | 1982-01-01 | Paper |
| On a Greedy Heuristic for Complete Matching | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3936208 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4181975 | 1979-01-01 | Paper |
| Understanding the complexity of interpolation search | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3856143 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4144192 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4144193 | 1977-01-01 | Paper |
| Efficient generation of the binary reflected gray code and its applications | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4131233 | 1976-01-01 | Paper |
| Backtrack programming techniques | 1975-01-01 | Paper |
| A nonrecursive list moving algorithm | 1973-01-01 | Paper |
| Binary Search Trees of Bounded Balance | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4125767 | 1972-01-01 | Paper |
| On the time required to detect cycles and connectivity in graphs | 1972-01-01 | Paper |
| Infix to Prefix Translation: The Insufficiency of a Pushdown Stack | 1972-01-01 | Paper |
| On the Optimality of Some Set Algorithms | 1972-01-01 | Paper |
