William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010
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
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010
I.K. Pour, D.J. Krajnovich, et al.
SPIE Optical Materials for High Average Power Lasers 1992
Minghong Fang, Zifan Zhang, et al.
CCS 2024
Paul J. Steinhardt, P. Chaudhari
Journal of Computational Physics