| Publication | Date of Publication | Type |
|---|
Simple proofs of lower bounds for polynomial evaluation
Complexity of Computer Computations | 2021-07-06 | Paper |
Determining plurality
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Average-case analysis of some plurality algorithms
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Average-case lower bounds for the plurality problem
ACM Transactions on Algorithms | 2018-11-05 | Paper |
| Calendrical Calculations | 2018-01-23 | Paper |
K-M-P string matching revisited
Information Processing Letters | 2016-06-09 | Paper |
Analysis of Boyer and Moore's \texttt{MJRTY} algorithm
Information Processing Letters | 2014-04-11 | Paper |
Improved bounds for cops-and-robber pursuit
Computational Geometry | 2011-08-02 | Paper |
Indian Calendrical Calculations
Ancient Indian Leaps into Mathematics | 2011-07-27 | Paper |
Bounds for cops and robber pursuit
Computational Geometry | 2010-09-02 | Paper |
The worst-case chip problem
Information Processing Letters | 2009-07-09 | Paper |
| scientific article; zbMATH DE number 5265455 (Why is no real title available?) | 2008-04-18 | Paper |
| Average-case analysis of the chip problem | 2006-06-06 | Paper |
Index assignment for multichannel communication under failure
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
Quicksort with Unreliable Comparisons: A Probabilistic Analysis
Combinatorics, Probability and Computing | 2005-04-18 | Paper |
| scientific article; zbMATH DE number 1825108 (Why is no real title available?) | 2002-11-10 | Paper |
| scientific article; zbMATH DE number 1804761 (Why is no real title available?) | 2002-09-23 | Paper |
| scientific article; zbMATH DE number 1678386 (Why is no real title available?) | 2001-12-04 | Paper |
Cliques, the Cauchy inequality, and information theory.
The Mathematical Intelligencer | 2001-11-18 | Paper |
| scientific article; zbMATH DE number 1305488 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1178964 (Why is no real title available?) | 1998-07-26 | Paper |
| scientific article; zbMATH DE number 1178941 (Why is no real title available?) | 1998-07-26 | Paper |
| scientific article; zbMATH DE number 1092351 (Why is no real title available?) | 1997-11-27 | Paper |
The Average-Case Complexity of Determining the Majority
SIAM Journal on Computing | 1997-08-03 | Paper |
The complexity of pursuit on a graph
Theoretical Computer Science | 1997-02-28 | Paper |
Generalized Kraft’s Inequality and Discrete <i>k</i>-Modal Search
SIAM Journal on Computing | 1996-08-18 | Paper |
Multidimensional Divide-and-Conquer Maximin Recurrences
SIAM Journal on Discrete Mathematics | 1995-09-20 | Paper |
Efficient management of dynamic tables
Information Processing Letters | 1994-05-26 | Paper |
Determining the majority
Information Processing Letters | 1994-01-31 | Paper |
A Fibonacci Version of Kraft’s Inequality Applied to Discrete Unimodal Search
SIAM Journal on Computing | 1993-10-10 | Paper |
“Lion and Man”: Upper and Lower Bounds
ORSA Journal on Computing | 1993-02-25 | Paper |
Scheduling on a hypercube
Information Processing Letters | 1992-06-28 | Paper |
Optimum lopsided binary trees
Journal of the ACM | 1992-06-25 | Paper |
Stochastic rearrangement rules for self-organizing data structures
Algorithmica | 1991-01-01 | Paper |
Probabilistic analysis of a grouping algorithm
Algorithmica | 1991-01-01 | Paper |
More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case
SIAM Journal on Computing | 1991-01-01 | Paper |
More Nearly Optimal Algorithms for Unbounded Searching, II:The Transfinite Case
SIAM Journal on Computing | 1991-01-01 | Paper |
Solution of a Divide-and-Conquer Maximin Recurrence
SIAM Journal on Computing | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4033102 (Why is no real title available?) | 1985-01-01 | Paper |
Recurrence relations based on minimization and maximization
Journal of Mathematical Analysis and Applications | 1985-01-01 | Paper |
Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching
SIAM Journal on Computing | 1983-01-01 | Paper |
The Travelling Salesman Problem and Minimum Matching in the Unit Square
SIAM Journal on Computing | 1983-01-01 | Paper |
Probabilistic analysis of divide‐and‐conquer heuristics for minimum weighted euclidean matching
Networks | 1983-01-01 | Paper |
The complexity of drawing trees nicely
Acta Informatica | 1983-01-01 | Paper |
A Naturally Occurring Function Continuous Only at Irrationals
The American Mathematical Monthly | 1982-01-01 | Paper |
Aspects of insertion in random trees
Computing | 1982-01-01 | Paper |
On a Greedy Heuristic for Complete Matching
SIAM Journal on Computing | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3752234 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3619326 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3573250 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3573251 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3657166 (Why is no real title available?) | 1977-01-01 | Paper |
Understanding the complexity of interpolation search
Information Processing Letters | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3560263 (Why is no real title available?) | 1976-01-01 | Paper |
Efficient generation of the binary reflected gray code and its applications
Communications of the ACM | 1976-01-01 | Paper |
Backtrack programming techniques
Communications of the ACM | 1975-01-01 | Paper |
Binary Search Trees of Bounded Balance
SIAM Journal on Computing | 1973-01-01 | Paper |
A nonrecursive list moving algorithm
Communications of the ACM | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3551889 (Why is no real title available?) | 1972-01-01 | Paper |
On the Optimality of Some Set Algorithms
Journal of the ACM | 1972-01-01 | Paper |
On the time required to detect cycles and connectivity in graphs
Mathematical Systems Theory | 1972-01-01 | Paper |
Infix to Prefix Translation: The Insufficiency of a Pushdown Stack
SIAM Journal on Computing | 1972-01-01 | Paper |
