Conference paper
The bionic DBMS is coming, but what will it look like?
Ryan Johnson, Ippokratis Pandis
CIDR 2013
Two upper bounds for the total path length of binary trees are obtained. One is for node-trees, and bounds the internal (or root-to-node) path length; the other is for leaf-trees, and bounds the external (or root-to-leaf) path length. These bounds involve a quantity called the balance, which allows the bounds to adapt from the n log n behavior of a completely balanced tree to the n2 behavior of a most skewed tree. These bounds are illustrated for the case of Fibonacci trees. © 1973, ACM. All rights reserved.
Ryan Johnson, Ippokratis Pandis
CIDR 2013
Zhikun Yuen, Paula Branco, et al.
DSAA 2023
Baihan Lin, Guillermo Cecchi, et al.
IJCAI 2023
Els van Herreweghen, Uta Wille
USENIX Workshop on Smartcard Technology 1999