Anil Maheshwari, Andrzej Lingas. A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree. In Patrice Enjalbert, Ernst W. Mayr, Klaus W. Wagner, editors, STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings. Volume 775 of Lecture Notes in Computer Science, pages 487-495, Springer, 1994.
@inproceedings{MaheshwariL94:0,
title = {A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree},
author = {Anil Maheshwari and Andrzej Lingas},
year = {1994},
researchr = {https://researchr.org/publication/MaheshwariL94%3A0},
cites = {0},
citedby = {0},
pages = {487-495},
booktitle = {STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings},
editor = {Patrice Enjalbert and Ernst W. Mayr and Klaus W. Wagner},
volume = {775},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-57785-8},
}