John Iacono

TL;DR: It is shown that any data structure that is key-independently optimal is expected to execute any access sequence where the key values are assigned arbitrarily to unordered data as fast as any offline binary search tree algorithm, within a multiplicative constant.

TL;DR: In this article, the authors introduce a new data structuring paradigm in which operations can be performed on a data structure not only in the present but also in the past, called retroactive data structures, the historical sequence of operations performed on the data structure is not fixed.

TL;DR: The xDict attains the optimal tradeoff between insertions and queries, even in the broader external-memory model, for the range where inserts cost between ε with 0 < ε < 1.

TL;DR: It is shown that for a multilevel memory hierarchy, a simple cache-oblivious structure almost replicates the performance of an optimal parameterized k-level DAM structure, and it is demonstrated that as k grows, the search costs of the optimal k- level DAM search structure and the optimal cache-OBlivious search structure rapidly converge.

TL;DR: In this article, the authors survey the progress that has been made in the almost thirty years since the conjecture was first formulated, and present a binary search tree algorithm that is dynamically optimal.