Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997
Two algorithms are presented and analyzed, which compute the distance between any pair of leaves of a complete tree. The first algorithm is quite efficient, running in time 0(log2 distance) on a uniform-cost RAM. The second algorithm is somewhat less efficient, though it too runs on a uniform-cost RAM in time O(log2 distance); it is presented mainly because its validity depends on an interesting numerological descriptor of complete trees. © 1980, Taylor & Francis Group, LLC
Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997
Elizabeth A. Sholler, Frederick M. Meyer, et al.
SPIE AeroSense 1997
L Auslander, E Feig, et al.
Advances in Applied Mathematics
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences