1. O. Berkman, personal communication, 1992.
2. O. Berkman, D. Breslauer, Z. Galil, B. Schieber, U. Vishkin, “Highly parallelizable problems”, Proceedings of the 21st Annual ACM Symposium on Theory of Computing 1989, pp. 309–319.
3. O. Berkman, B. Schieber, U. Vishkin, “Some doubly logarithmic optimal parallel algorithms based on finding all nearest smaller values”, UMIACS-TR-88-79, University of Maryland, Institute for Advanced Computer Studies, 1988.
4. O. Berkman, U. Vishkin, “Recursive *-tree parallel data-structure”, Proceedings of the 30th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, 1989, pp. 196–202, also UMIACS-TR-90-40, University of Maryland, Institute for Advanced Computer Studies, 1990.
5. O. Berkman, U. Vishkin, “Almost fully-parallel parentheses matching”, UMIACS-TR-91-103, University of Maryland, Institute for Advanced Computer Studies, 1991.