Journal of the ACM Bibliography
R.
P. Brent and H. T. Kung.
Fast algorithms for manipulating formal power series. Journal of
the ACM, 25(4):581-595, October 1978.
[BibTeX entry]
Selected papers that cite this one
- D. V. Chudnovsky and G. V. Chudnovsky. On expansion of
algebraic functions in power and Puiseux series, I. Journal of
Complexity, 2(4):271-294, December 1986.
- Mark Giesbrecht. Nearly optimal
algorithms for canonical matrix forms. SIAM Journal on
Computing, 24(5):948-969, October 1995.
- Xiaohan Huang and Victor Y. Pan. Fast rectangular
matrix multiplication and applications. Journal of
Complexity, 14(2):257-299, June 1998.
- Erich Kaltofen and Victor Shoup. Subquadratic-time
factoring of polynomials over finite fields. In Proceedings of
the Twenty-Seventh Annual ACM Symposium on the Theory of
Computing, pages 398-406, Las Vegas, Nevada, 29 May-1 June 1995.
- Jerzy Karczmarczuk. Generating power of
lazy semantics. Theoretical Computer Science,
187(1-2):203-219, 15 November 1997.
Shortcuts: