Labeled trees and the efficient computation of derivations

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Labeled trees and the efficient computation of derivations

Full text

Pdf (595 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation table of contents

Portland, Oregon, United States

Pages: 74 - 80

Year of Publication: 1989

ISBN:0-89791-325-6

Authors

R. Grossman	Univ. of Illinois at Chicago, Chicago
R. G. Larson	Univ. of Illinois at Chicago, Chicago

Sponsor

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 12, Citation Count: 1

Additional Information:

references cited by index terms review collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/74540.74550 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Richard P. Brent, The Parallel Evaluation of General Arithmetic Expressions, Journal of the ACM (JACM), v.21 n.2, p.201-206, April 1974 [doi>10.1145/321812.321815]
	2	B. Buchberger , George E. Collins , Rudiger Loos , Rudolf Albrecht, Computer algebra: symbolic and algebraic computation (2nd ed.), Springer-Verlag New York, Inc., New York, NY, 1983
	3	B. Buchberger and P~. Loos, Algebraic Simplification, in "Computer algebra: symbolic and algebraic computation," ed. B. Buchberger et. al., Springer, Wien, 1983, 11-43.
	4	B. F. Caviness, On Canonical Forms and Simplification, Journal of the ACM (JACM), v.17 n.2, p.385-396, April 1970 [doi>10.1145/321574.321591]
	5	R. Grossman, Evaluation of ezpressions involving higher order derivations, Center For Pure and Applied Mathematics, PAM - 367, University of California, Berkeley, submitted for publication.
	6	R. Grossman and R. G. Larson, Hopfalgebraic structures of families of trees, J. of Algebra, to appear.
	7	It. Grosssman and R. G. Larson, Solving Nonlinear Equations From Higher Order Derivations in Linear Stages, Advances in Math., to appear.
	8	R. Grossman and R. G. Laxson, Labeled Trees and the Algebra of Differential Operators, to appear in "Algorithms and Graphs," AMS, 1989.
	9	Carl G Ponder, Evaluation of "Performance Enhancements" in Algebraic Manipulation, University of California at Berkeley, Berkeley, CA, 1988
	10	Robert Endre Tarjan, Data structures and network algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983

CITED BY

Peter Crouch , Robert Grossman , Richard Larson, Computations involving differential operators and their actions on functions, Proceedings of the 1991 international symposium on Symbolic and algebraic computation, p.301-307, July 15-17, 1991, Bonn, West Germany

INDEX TERMS

Primary Classification:
I. Computing Methodologies
I.1 SYMBOLIC AND ALGEBRAIC MANIPULATION
I.1.2 Algorithms
Subjects: Algebraic algorithms

Additional Classification:
F. Theory of Computation
F.1 COMPUTATION BY ABSTRACT DEVICES
F.1.2 Modes of Computation
Subjects: Parallelism and concurrency

General Terms:
Algorithms, Theory

REVIEW

"Bernard M. E. Moret : Reviewer"

The parallel algorithm for the symbolic computation of (non-commutative) operators under composition given here is not new: the authors had proposed it in an earlier report, but only in sequential form. The point of this paper is to show how t more...

Collaborative Colleagues:

R. Grossman: colleagues

R. G. Larson: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player