| Publication | Date of Publication | Type |
|---|
Lower bounds for dynamic algorithms
Algorithm Theory — SWAT '94 | 2022-12-09 | Paper |
| scientific article; zbMATH DE number 7272489 (Why is no real title available?) | 2020-11-10 | Paper |
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM | 2019-07-19 | Paper |
Products of finite state machines with full coverage
Automata, Languages and Programming | 2019-03-29 | Paper |
| scientific article; zbMATH DE number 6876063 (Why is no real title available?) | 2018-05-29 | Paper |
An intuitive and simple bounding argument for Quicksort
Information Processing Letters | 2014-04-14 | Paper |
Generalizing a theorem of Wilber on rotations in binary search trees to encompass unordered binary trees
Algorithmica | 2012-04-26 | Paper |
On the Matter of Dynamic Optimality in an Extended Model for Tree Access Operations
Lecture Notes in Computer Science | 2011-08-12 | Paper |
The number of tests required to search an unordered table
Information Processing Letters | 2009-04-28 | Paper |
Adaptive sorting: an information theoretic perspective
Acta Informatica | 2008-04-03 | Paper |
On the efficiency of pairing heaps and related data structures
Journal of the ACM | 2005-01-25 | Paper |
| scientific article; zbMATH DE number 1962852 (Why is no real title available?) | 2003-08-11 | Paper |
| scientific article; zbMATH DE number 1775417 (Why is no real title available?) | 2002-08-01 | Paper |
Lower bounds for fully dynamic connectivity problems in graphs
Algorithmica | 1999-07-05 | Paper |
| New techniques for designing qualitatively independent systems | 1999-03-07 | Paper |
Optimal Biweighted Binary Trees and the Complexity of Maintaining Partial Sums
SIAM Journal on Computing | 1998-09-21 | Paper |
Products of finite state machines with full coverage
Theoretical Computer Science | 1997-02-28 | Paper |
On the Complexity of Dualization of Monotone Disjunctive Normal Forms
Journal of Algorithms | 1996-12-08 | Paper |
Weighted Binary Trees for Concurrent Searching
Journal of Algorithms | 1996-06-27 | Paper |
Three Stacks
Journal of Algorithms | 1994-09-08 | Paper |
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
Journal of Computer and System Sciences | 1994-06-29 | Paper |
Surpassing the information theoretic bound with fusion trees
Journal of Computer and System Sciences | 1994-03-24 | Paper |
A Note on Finding a Strict Saddlepoint
The American Mathematical Monthly | 1992-06-27 | Paper |
| scientific article; zbMATH DE number 4113218 (Why is no real title available?) | 1989-01-01 | Paper |
Refined complexity analysis for heap operations
Journal of Computer and System Sciences | 1987-01-01 | Paper |
On the Size of Separating Systems and Families of Perfect Hash Functions
SIAM Journal on Algebraic Discrete Methods | 1984-01-01 | Paper |
Storing a Sparse Table with <i>0</i> (1) Worst Case Access Time
Journal of the ACM | 1984-01-01 | Paper |
Hash functions for priority queues
Information and Control | 1984-01-01 | Paper |
Algorithms for computing evolutionary similarity measures with length independent gap penalties
Bulletin of Mathematical Biology | 1984-01-01 | Paper |
The Complexity of Maintaining an Array and Computing Its Partial Sums
Journal of the ACM | 1982-01-01 | Paper |
The complexity of partial match retrieval in a dynamic setting
Journal of Algorithms | 1982-01-01 | Paper |
Lower Bounds on the Complexity of Some Optimal Data Structures
SIAM Journal on Computing | 1981-01-01 | Paper |
Inherent complexity trade-offs for range query problems
Theoretical Computer Science | 1981-01-01 | Paper |
A Lower Bound on the Complexity of Orthogonal Range Queries
Journal of the ACM | 1981-01-01 | Paper |
Query time versus redundancy trade-offs for range queries
Journal of Computer and System Sciences | 1981-01-01 | Paper |
The spanning bound as a measure of range query complexity
Journal of Algorithms | 1981-01-01 | Paper |
Observations concerning the complexity of a class of on-line algebraic problems
IEEE Transactions on Computers | 1981-01-01 | Paper |
On the complexity of computing the measure of ∪[a <sub>i</sub> ,b <sub>i</sub> ]
Communications of the ACM | 1978-01-01 | Paper |
New Bounds on the Complexity of the Shortest Path Problem
SIAM Journal on Computing | 1976-01-01 | Paper |
How good is the information theory bound in sorting?
Theoretical Computer Science | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3607502 (Why is no real title available?) | 1975-01-01 | Paper |
On computing the length of longest increasing subsequences
Discrete Mathematics | 1975-01-01 | Paper |
A symmetric relationship for a class of partitions
Journal of Combinatorial Theory. Series A | 1975-01-01 | Paper |
Some Arithmetical Packing Problems
Journal of the London Mathematical Society | 1975-01-01 | Paper |
Recurrence relations based on minimization
Journal of Mathematical Analysis and Applications | 1974-01-01 | Paper |
| The Distribution of Absolutely Irreducible Polynomials in Several Indeterminates | 1972-01-01 | Paper |
Congruence formulas obtained by counting irreducibles
Pacific Journal of Mathematics | 1971-01-01 | Paper |
Arithmetical convolution products and generalizations
Duke Mathematical Journal | 1970-01-01 | Paper |
