Fast Algorithms for Manipulating Formal Power Series
- 1 October 1978
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 25 (4) , 581-595
- https://doi.org/10.1145/322092.322099
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- All Algebraic Functions Can Be Computed FastJournal of the ACM, 1978
- Computing with Formal Power SeriesACM Transactions on Mathematical Software, 1975
- A partition formula for the integer coefficients of the theta function nomeMathematics of Computation, 1975
- The efficient calculation of powers of polynomialsJournal of Computer and System Sciences, 1973
- On the Number of Nonscalar Multiplications Necessary to Evaluate PolynomialsSIAM Journal on Computing, 1973
- On partial sums of Lagrange's series with application to the theory of queuesJournal of the Australian Mathematical Society, 1963
- The single server queueing system with Non-recurrent input-process and Erlang service timeJournal of the Australian Mathematical Society, 1963
- The transient behaviour of the queueing system Gi/M/1Journal of the Australian Mathematical Society, 1963
- Enumeration Of Labelled GraphsCanadian Journal of Mathematics, 1956
- Automatic Computations with Power SeriesJournal of the ACM, 1956