16430 search results - page 204 / 3286 » On Computable Tree Functions |
165
click to vote
ICALP
2007
Springer
16 years 17 days ago
2007
Springer
A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By d...
155
click to vote
ESA
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We show that optimal alphabetic binary trees can be constructed in O(n) time if the elements of the initial sequence are drawn from a domain that can be sorted in linear ...
148
click to vote
CPC
2004
15 years 6 months ago
2004
Heap ordered trees are planted plane trees, labelled in such a way that the labels always increase from the root to a leaf. We study two parameters, assuming that p of the n nodes ...
139
click to vote
SIAMCOMP
2000
15 years 6 months ago
2000
We modify the k-d tree on [0, 1]d by always cutting the longest edge instead of rotating through the coordinates. This modification makes the expected time behavior of lowerdimensi...