On Dynamic Algorithms for Algebraic Problems

Journal of Algorithms

Volumn 22, Issue 2, 1997, Pages 347-371

  Reif, John H ^a   Tate, Stephen R ^b  

^a Duke University   (United States)

^b Center for Advanced Research and Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (24)

1. P. K. Agarwal, D. Eppstein, and J. Matoušek, Dynamic half-space reporting, geometric optimization, and minimum spanning trees, in "Proceedings, 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, 1992," pp. 80-89.
2. A. Aho, J. Hopcroft, and J. Ullman, "The Design and Analysis of Computer Algorithms," Addison-Wesley, Reading, MA, 1974.
3. E. G. Belaga, Some problems in the computation of polynomials, Dokl. Akad. Nauk. SSSR 123 (1958), 775-777.
4. D. Bini and V. Pan, "Polynomial and Matrix Computations." Vol. 1, "Fundamental Algorithms," Birkäuser, Boston, 1994.
5. A. Borodin and I. Munro, "The Computational Complexity of Algebraic and Numeric Problems," American Elsevier, New York, 1975.
6. Y. Chiang and R. Tamassia, "Dynamic Algorithms in Computational Geometry," Technical Report CS-91-24, Brown University Department of Computer Science, 1991.
7. J. M. Cooley and J. W. Tukey, An algorithm for the machine calculation of complex fourier series, Math. Comput. 19 (1965), 297-301.
8. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic expression, J. Symbolic Comput. 9, No. 3 (1990), 251-280.
9. D. Eppstein, Z. Galil, G. F. Italiano, and A. Nissenzweig, Sparsification - A technique for speeding up dynamic graph algorithms, in "Proceedings, 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, 1992," pp. 60-69.
10. M. L. Fredman, "The complexity of maintaining an array and computing its partial sums," J. Assoc. Comput. Mech. 29, No. 1 (1982), 250-260.
11. G. N. Frederickson, Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees, in "Proceedings, 32nd Annual Symposium on Foundations of Computer Science, San Juan, 1991," pp. 632-641.
12. G. N. Frederickson, A data structure for dynamically maintaining rooted trees, in "Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, Austin, TX, 1993," pp. 175-184.
13. J. Granata, M. Conner, and R. Tolimieri, Recursive fast algorithms and the role of the tensor product, IEEE Trans. Signal Process. 40, No. 12 (1992), 2921-2930.
14. D. Heller, A survey of parallel algorithms in numerical linear algebra, SIAM Rev. 20, No. 4 (1978), 740-776.
15. R. E. Ladner and M. J. Fischer, Parallel prefix computation, J. Assoc. Comput. Mech. 27, No. 4 (1980), 831-838.
16. F. T. Leighton, "Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes," Morgan Kaufmann, San Mateo, CA, 1992.
17. T. S. Motzkin, Evaluation of polynomials and evaluation of rational functions, Bull. Amer. Math. Soc. 61 (1955), 163.
18. F. P. Preparata and J. Vuillemin, The cube-connected cycles: A versatile network for parallel computation, Comm. ACM 24, No. 5 (1981), 300-309.
19. M. O. Rabin and S. Winograd, "Fast Evaluation of Polynomials by Rational Preparation," IBM Technical Report RC 3645, Yorktown Heights, NY, 1971.
20. D. D. Sleator and R. E. Tarjan, A data structure for dynamic trees, J. Comput. System Sci. 26 (1983), 362-391.
21. K. J. Supowit, New techniques for some dynamic closest-point and farthest-point problems, in "Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, 1990," pp. 84-90.
22. M. Tompa, Time-space tradeoffs for computing functions, using connectivity properties of their circuits, J. Comput. System Sci. 20 (1980), 118-132.
23. J. Ullman, "Computational Aspects of VLSI," Comput. Sci. Press, Rockville, MD, 1984.
24. L. Valiant, The complexity of computing the permanent, Theoret. Comput. Sci. 8 (1979), 189-201.