1. B. Awerbuch, A Israeli and Y. Shiloach, "Finding Euler circuits in logarithmic parallel time," Proc. ACM Symp. on Theory of Computing 1984 pp. 249–257
2. M. Atallah and U. Vishkin, "Finding Euler tours in parallel," J. CSS, 29, 1984, pp. 330–337.
3. J. L. Baer and D. P. Bovet, "Compilation of arithmetic expressions for parallel computations," Information Processing 68 — North-Holland Publishing Company — Amsterdam, 1969, pp 340–346.
4. I. Bar-on and U. Vishkin, "Optimal parallel generation of a computation tree form," Proc. on para. comp. IEEE(1984), 490–495.
5. E. Dekel and S. Peng, "Optimal Parallel Algorithms for Binary Trees," TR — 213, Univ. of Texas at Dallas, Aug. 1985.