APA-Zitierstil (7. Ausg.)

Tarjan, R., & Vishkin, U. (1984). Finding biconnected componemts and computing tree functions in logarithmic parallel time. 25th Annual Symposium onFoundations of Computer Science, 1984, 12-20. https://doi.org/10.1109/SFCS.1984.715896

Chicago-Zitierstil (17. Ausg.)

Tarjan, R.E, und U. Vishkin. "Finding Biconnected Componemts and Computing Tree Functions in Logarithmic Parallel Time." 25th Annual Symposium OnFoundations of Computer Science, 1984 1984: 12-20. https://doi.org/10.1109/SFCS.1984.715896.

MLA-Zitierstil (9. Ausg.)

Tarjan, R.E, und U. Vishkin. "Finding Biconnected Componemts and Computing Tree Functions in Logarithmic Parallel Time." 25th Annual Symposium OnFoundations of Computer Science, 1984, 1984, pp. 12-20, https://doi.org/10.1109/SFCS.1984.715896.