3 citations · 3 across the 1 of their papers we have counts for
1 paper
Erik D. Demaine, John Iacono, Stefan Langerman +1
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…