### Abstract

In 1985, Sleator and Tarjan introduced the splay tree, a self-adjusting binary search tree algorithm. Splay trees were conjectured to perform within a constant factor as any offline rotation-based search tree algorithm on every sufficiently long sequence - any binary search tree algorithm that has this property is said to be dynamically optimal. However, currently neither splay trees nor any other tree algorithm is known to be dynamically optimal. Here we 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 if any binary search tree algorithm is dynamically optimal.

Original language | English (US) |
---|---|

Title of host publication | Space-Efficient Data Structures, Streams, and Algorithms - Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday |

Publisher | Springer Verlag |

Pages | 236-250 |

Number of pages | 15 |

Volume | 8066 LNCS |

ISBN (Print) | 9783642402722 |

DOIs | |

State | Published - 2013 |

Event | Conference on Space-Efficient Data Structures, Streams, and Algorithms - Waterloo, ON, Canada Duration: Aug 15 2013 → Aug 16 2013 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 8066 LNCS |

ISSN (Print) | 03029743 |

ISSN (Electronic) | 16113349 |

### Other

Other | Conference on Space-Efficient Data Structures, Streams, and Algorithms |
---|---|

Country | Canada |

City | Waterloo, ON |

Period | 8/15/13 → 8/16/13 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science(all)
- Theoretical Computer Science

### Cite this

*Space-Efficient Data Structures, Streams, and Algorithms - Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday*(Vol. 8066 LNCS, pp. 236-250). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8066 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-642-40273-9_16

**In pursuit of the dynamic optimality conjecture.** / Iacono, John.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Space-Efficient Data Structures, Streams, and Algorithms - Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday.*vol. 8066 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8066 LNCS, Springer Verlag, pp. 236-250, Conference on Space-Efficient Data Structures, Streams, and Algorithms, Waterloo, ON, Canada, 8/15/13. https://doi.org/10.1007/978-3-642-40273-9_16

}

TY - GEN

T1 - In pursuit of the dynamic optimality conjecture

AU - Iacono, John

PY - 2013

Y1 - 2013

N2 - In 1985, Sleator and Tarjan introduced the splay tree, a self-adjusting binary search tree algorithm. Splay trees were conjectured to perform within a constant factor as any offline rotation-based search tree algorithm on every sufficiently long sequence - any binary search tree algorithm that has this property is said to be dynamically optimal. However, currently neither splay trees nor any other tree algorithm is known to be dynamically optimal. Here we 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 if any binary search tree algorithm is dynamically optimal.

AB - In 1985, Sleator and Tarjan introduced the splay tree, a self-adjusting binary search tree algorithm. Splay trees were conjectured to perform within a constant factor as any offline rotation-based search tree algorithm on every sufficiently long sequence - any binary search tree algorithm that has this property is said to be dynamically optimal. However, currently neither splay trees nor any other tree algorithm is known to be dynamically optimal. Here we 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 if any binary search tree algorithm is dynamically optimal.

UR - http://www.scopus.com/inward/record.url?scp=84894143514&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84894143514&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-40273-9_16

DO - 10.1007/978-3-642-40273-9_16

M3 - Conference contribution

SN - 9783642402722

VL - 8066 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 236

EP - 250

BT - Space-Efficient Data Structures, Streams, and Algorithms - Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday

PB - Springer Verlag

ER -