1. Alok Aggarwal and James Park. Notes on searching in multidimensional monotone arrays. In 29th Annual Symposium on Foundations of Computer Science, pages 497–512. IEEE Computer Society Press, 1988.
2. O. Berkman, Baruch Schieber, and U. Vishkin. Some doubly logarithmic optimal parallel algorithms based on finding all nearest smaller values. Technical Report UMIACS-TR-88-79, University of Maryland Institute for Advanced Computer Studies, October 1988. To appear in J. Algorithms.
3. O. Berkman and U. Vishkin. Recursive star-tree parallel data-structure. Technical Report UMIACS-TR-90-40, University of Maryland Institute for Advanced Computer Studies, March 1990.
4. Shing-Chong Chang, Joseph JáJá, and Kwan Woo Ryu. Optimal parallel algorithms for one-layer routing. Technical Report UMIACS-TR-89-46, University of Maryland Institute for Advanced Computer Studies, April 1989.
5. R. Cole and U. Vishkin. Faster optimal prefix sums and list ranking. Information and Control, 81:334–352, 1989.