Chlebus, B., Diks, K., Rytter, W., Szymacha, T., Goos, G., Hartmanis, J., . . . Mirkowska, G. (1989). Parallel complexity of lexicographically first problems for tree-structured graphs. Mathematical Foundations of Computer Science 1989 : Porabka-Kozubnik, Poland August 28 – September 1, 1989 Proceedings, 379, 185. https://doi.org/10.1007/3-540-51486-4_66
Παραπομπή σε μορφή Chicago (17η εκδ.)Chlebus, Bogdan, et al. "Parallel Complexity of Lexicographically First Problems for Tree-structured Graphs." Mathematical Foundations of Computer Science 1989 : Porabka-Kozubnik, Poland August 28 – September 1, 1989 Proceedings 379 (1989): 185. https://doi.org/10.1007/3-540-51486-4_66.
Παραπομπή σε μορφή MLA (9th εκδ.)Chlebus, Bogdan, et al. "Parallel Complexity of Lexicographically First Problems for Tree-structured Graphs." Mathematical Foundations of Computer Science 1989 : Porabka-Kozubnik, Poland August 28 – September 1, 1989 Proceedings, vol. 379, 1989, p. 185, https://doi.org/10.1007/3-540-51486-4_66.