Parallel Shortcutting of Rooted Trees

Journal of Algorithms

Volumn 23, Issue 1, 1997, Pages 139-159

  Thorup, Mikkel ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0013214417     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0829     Document Type: Article

References (21)

1. W. Ackermann, Zum Hilbertchen aufbau der reellen zahlen, Math. Ann. 99 (1928), 118-133.
2. N. Alon and B. Schieber, "Optimal Preprocessing for Answering On-Line Product Queries," Technical Report 71/87, The Moise and Frida Eskenasy Institute of Computer Science, Tel Aviv University, 1987.
3. O. Berkman and U. Vishkin, Recursive star-tree parallel data structure, SIAM J. Comput. 22, No. 2 (1993), 221-242.
4. H. Bodlaender, G. Tel, and N. Santoro, Trade-offs in non-reversing diameter, Nordic J. Comput. 1, No. 1 (1994), 111-134.
5. M. L. Bonet and S. R. Buss, On the deduction rule and the number of proof lines, in "Proceedings, 6th Annual IEEE Symposium on Logic in Computer Science," pp. 286-297, IEEE Press, New York, 1991.
6. R. P. Brent, The parallel evaluation of general arithmetic expressions, Assoc. Comput. Mach. 21, No. 2 (1974), 201-208.
7. B. Chazelle, Computing on a free tree via complexity preserving mappings, Algorithmica 2, No. 3 (1987), 337-361.
8. C. C. Y. Chen and S. K. Das, Breadth-first traversal of trees and integer sorting in parallel, Inform. Process. Lett. 41, No. 1 (1992), 39-49.
9. R. Cole and U. Vishkin, The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time, Algorithmica 3, (1988), 329-346.
10. S. Cook, C. Dwork, and R. Reischuk, Upper and lower time bounds for parallel random access machines without simultaneous writes, SIAM J. Comput. 15, No. 1 (1980), 87-97.
11. B. Dixon, "Minimum Spanning Tree Verification, Fast Priority Queues, and Massively Parallel Factoring." Ph.D. thesis, Dept. of Computer Science, Princeton University, 1993.
12. D. Harel and R. E. Tarjan, Fast algorithms for finding nearest common ancestors, SIAM J. Comput. 13 (1984), 338-355.
13. R. Karp and V. Ramachandran, Parallel algorithms for shared-memory machines, in "Handbook of Theoretical Computer Science," Vol. A, "Algorithms and Complexity" (J. van Leeuwen, Ed.), pp. 869-942, Elsevier, Amsterdam, 1990.
14. J. A. La Poutré, "New Techniques for the Union-Find Problem," Technical Report RUU-CS-89-19, Utrecht University, 1989.
15. N. Santoro, (Time X space)-efficient implementations of hierarchical conceptual models, in "Proceedings, 14th International Workshop on Graph-Theoretic Concepts in Computer Science" (J. van Leeuwen, Ed.), Lecture Notes in Computer Science, Vol. 334, pp. 180-189, Springer-Verlag, Berlin, 1988.
16. B. Schieber and U. Vishkin, On finding lowest common ancestors; Simplification and parallelization, SIAM J. Comput. 17, No. 6 (1988), 1253-1262.
17. R. E. Tarjan, Efficiency of a good but not linear set union algorithm, J. Assoc. Comput. Mach. 22 (1975), 215-225.
18. M. Thorup, On shortcutting digraphs, in "Proceedings, 18th International Workshop on Graph-Theoretic Concepts in Computer Science," (E. Mayr, Ed.), Lecture Notes in Computer Science, Vol. 657, pp. 205-211, Springer-Verlag, Berlin, 1993.
19. M. Thorup, "Topics in Computation," Ph.D. thesis, Faculty of Mathematical Sciences, University of Oxford, 1993.
20. M. Thorup, Shortcutting planar digraphs, Combin. Probab. Comput. 4 (1995), 287-315.
21. A. C. Yao, Space-time tradeoff for answering range queries, in "Proceedings, 14th Annual ACM Symposium on Theory of Computing," pp. 128-136, ACM Press, New York, 1982.