### Abstract

We present a general transformation for combining a constant number of binary search tree data structures (BSTs) into a single BST whose running time is within a constant factor of the minimum of any "well-behaved" bound on the running time of the given BSTs, for any online access sequence. (A BST has a well-behaved bound with f(n) overhead if it spends at most O(f(n)) time per access and its bound satisfies a weak sense of closure under subsequences.) In particular, we obtain a BST data structure that is O(log log n) competitive, satisfies the working set bound (and thus satisfies the static finger bound and the static optimality bound), satisfies the dynamic finger bound, satisfies the unified bound with an additive O(log log n) factor, and performs each access in worst-case O(log n) time.

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

Title of host publication | Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings |

Pages | 388-399 |

Number of pages | 12 |

Edition | PART 1 |

DOIs | |

State | Published - Jul 23 2013 |

Event | 40th International Colloquium on Automata, Languages, and Programming, ICALP 2013 - Riga, Latvia Duration: Jul 8 2013 → Jul 12 2013 |

### Publication series

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

Number | PART 1 |

Volume | 7965 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 40th International Colloquium on Automata, Languages, and Programming, ICALP 2013 |
---|---|

Country | Latvia |

City | Riga |

Period | 7/8/13 → 7/12/13 |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings*(PART 1 ed., pp. 388-399). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7965 LNCS, No. PART 1). https://doi.org/10.1007/978-3-642-39206-1_33