On the public citation graph
On computing reciprocals of power series
0 signed · 75 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/zamm.19330130111openalex-snapshot
Iterative Berechung der reziproken Matrix
inferredcites →https://doi.org/10.1007/bf02242389openalex-snapshot
An algorithm for division of powerseries
inferredcites →https://doi.org/10.1090/s0025-5718-1970-0400642-2openalex-snapshot
Table errata: The art of computer programming, Vol. 2: Seminumerical algorithms (Addison-Wesley, Reading, Mass., 1969) by Donald E. Knuth
inferredcites →https://doi.org/10.2307/2004500openalex-snapshot
The Art of Computer Programming. Vol. II: Seminumerical Algorithms
inferredcites →https://doi.org/10.2307/2316079openalex-snapshot
Iterative Methods for the Solution of Equations.
inferredcites →https://doi.org/10.2307/2317055openalex-snapshot
The Art of Computer Programming. Volume 2: Seminumerical Algorithms.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/bip.360220409openalex-snapshot
Translational friction of rigid assemblies of spheres: Derivation and application of new hydrodynamic interaction tensors
inferred← citeshttps://doi.org/10.1006/jsco.2000.0427openalex-snapshot
Sylvester–Habicht Sequences and Fast Cauchy Index Computation
inferred← citeshttps://doi.org/10.1007/11672142_55openalex-snapshot
Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two
inferred← citeshttps://doi.org/10.1007/3-540-11607-9_1openalex-snapshot
Asymptotically fast algorithms for the numerical muitiplication and division of polynomials with complex coefficients
inferred← citeshttps://doi.org/10.1007/3-540-44683-4_17openalex-snapshot
Computing Reciprocals of Bivariate Power Series
inferred← citeshttps://doi.org/10.1007/978-1-4614-7621-4_8openalex-snapshot
Fast Computation of Bernoulli, Tangent and Secant Numbers
inferred← citeshttps://doi.org/10.1007/978-3-0348-5501-3_8openalex-snapshot
Einige Anwendungen der Schnellen Fouriertransformation
inferred← citeshttps://doi.org/10.1007/978-3-642-12659-8_28openalex-snapshot
FFT-Based Dense Polynomial Arithmetic on Multi-cores
inferred← citeshttps://doi.org/10.1007/978-3-7091-3406-1_10openalex-snapshot
Computing by Homomorphic Images
inferred← citeshttps://doi.org/10.1007/978-3-7091-7551-4_10openalex-snapshot
Computing by Homomorphic Images
inferred← citeshttps://doi.org/10.1007/bf02241977openalex-snapshot
A method for calculating the reciprocal coefficients of function matrices
inferred← citeshttps://doi.org/10.1007/s00026-022-00584-5openalex-snapshot
A Fast Algorithm for Computing the Number of Magic Series
inferred← citeshttps://doi.org/10.1016/0196-6774(80)90013-9openalex-snapshot
Fast solution of toeplitz systems of equations and computation of Padé approximants
inferred← citeshttps://doi.org/10.1016/0771-050x(75)90005-4openalex-snapshot
A survey of techniques in applied computational complexity
inferred← citeshttps://doi.org/10.1016/b978-0-12-697560-4.50017-4openalex-snapshot
HENSEL MEETS NEWTON — ALGEBRAIC CONSTRUCTIONS IN AN ANALYTIC SETTING
inferred← citeshttps://doi.org/10.1016/b978-0-12-697560-4.50018-6openalex-snapshot
O((n log n)3/2) ALGORITHMS FOR COMPOSITION AND REVERSION OF POWER SERIES
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50016-3openalex-snapshot
Algebraic Complexity Theory
inferred← citeshttps://doi.org/10.1016/j.cam.2005.10.013openalex-snapshot
Chebyshev series expansion of inverse polynomials
inferred← citeshttps://doi.org/10.1016/j.jco.2004.10.002openalex-snapshot
On the number of multiplications needed to invert a monic power series over fields of characteristic two
inferred← citeshttps://doi.org/10.1016/j.jsc.2005.07.001openalex-snapshot
Fast computation of special resultants
inferred← citeshttps://doi.org/10.1016/j.jsc.2008.04.019openalex-snapshot
Fast arithmetic for triangular sets: From theory to practice
inferred← citeshttps://doi.org/10.1016/j.jsc.2010.08.012openalex-snapshot
Kaltofen’s division-free determinant algorithm differentiated for matrix adjoint computation
inferred← citeshttps://doi.org/10.1016/j.laa.2013.02.020openalex-snapshot
Wiener–Hopf and spectral factorization of real polynomials by Newton’s method
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00044-2openalex-snapshot
Variations on computing reciprocals of power series
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00396-1openalex-snapshot
The complexity of bivariate power series arithmetic
inferred← citeshttps://doi.org/10.1017/9781139049801.011openalex-snapshot
Fast multiplication and its applications
inferred← citeshttps://doi.org/10.1063/1.441420openalex-snapshot
Condensation theory for finite, closed systems
inferred← citeshttps://doi.org/10.1090/s0025-5718-07-01956-4openalex-snapshot
Fast convolutions meet Montgomery
inferred← citeshttps://doi.org/10.1090/s0025-5718-08-02066-8openalex-snapshot
Fast algorithms for computing isogenies between elliptic curves
inferred← citeshttps://doi.org/10.1090/s0025-5718-1984-0736459-9openalex-snapshot
Hensel and Newton Methods in Valuation Rings
inferred← citeshttps://doi.org/10.1090/s0025-5718-1994-1216256-7openalex-snapshot
On the periods of generalized Fibonacci recurrences
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00028openalex-snapshot
Fast List Decoding of Univariate Multiplicity and Folded Reed-Solomon Codes
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00127openalex-snapshot
Power Series Composition in Near-Linear Time
inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181991openalex-snapshot
Lower bounds on the bounded coefficient complexity of bilinear maps
inferred← citeshttps://doi.org/10.1137/0205047openalex-snapshot
A Generalized Asymptotic Upper Bound on Fast Polynomial Evaluation and Interpolation
inferred← citeshttps://doi.org/10.1137/0206042openalex-snapshot
Fast Algorithms for Partial Fraction Decomposition
inferred← citeshttps://doi.org/10.1137/0212001openalex-snapshot
The Computational Complexity of Continued Fractions
inferred← citeshttps://doi.org/10.1137/0217069openalex-snapshot
A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots
inferred← citeshttps://doi.org/10.1137/0222037openalex-snapshot
Inverting Polynomials and Formal Power Series
inferred← citeshttps://doi.org/10.1137/1021093openalex-snapshot
Fast Fourier Methods in Computational Complex Analysis
inferred← citeshttps://doi.org/10.1145/1277548.1277585openalex-snapshot
Fast arithmetic for triangular sets
inferred← citeshttps://doi.org/10.1145/1278177.1278187openalex-snapshot
Multithreaded parallel implementation of arithmetic operations modulo a triangular set
inferred← citeshttps://doi.org/10.1145/143242.143350openalex-snapshot
On computing determinants of matrices without divisions
inferred← citeshttps://doi.org/10.1145/22145.22160openalex-snapshot
Computing with polynomials given by straight-line programs I: greatest common divisors
inferred← citeshttps://doi.org/10.1145/258726.258777openalex-snapshot
Fast polynomial factorization over high algebraic extensions of finite fields
inferred← citeshttps://doi.org/10.1145/2930889.2930912openalex-snapshot
On p-Adic Differential Equations with Separation of Variables
inferred← citeshttps://doi.org/10.1145/322063.322068openalex-snapshot
All Algebraic Functions Can Be Computed Fast
inferred← citeshttps://doi.org/10.1145/322092.322099openalex-snapshot
Fast Algorithms for Manipulating Formal Power Series
inferred← citeshttps://doi.org/10.1145/3373207.3404045openalex-snapshot
On a non-archimedean broyden method
inferred← citeshttps://doi.org/10.1145/3373207.3404061openalex-snapshot
Fast in-place algorithms for polynomial operations
inferred← citeshttps://doi.org/10.1145/3666000.3669672openalex-snapshot
In-place fast polynomial modular remainder
inferred← citeshttps://doi.org/10.1145/42267.45069openalex-snapshot
Greatest common divisors of polynomials given by straight-line programs
inferred← citeshttps://doi.org/10.1145/800191.805635openalex-snapshot
The fast Fourier transform its role as an algebraic algorithm
inferred← citeshttps://doi.org/10.1145/800205.806343openalex-snapshot
Algebraic algorithms using p-adic constructions
inferred← citeshttps://doi.org/10.1145/800206.806371openalex-snapshot
The computational complexity of continued fractions
inferred← citeshttps://doi.org/10.1145/990308.990311openalex-snapshot
Lower bounds on the bounded coefficient complexity of bilinear maps
inferred← citeshttps://doi.org/10.2307/2153583openalex-snapshot
On the Periods of Generalized Fibonacci Recurrences
inferred← citeshttps://doi.org/10.48550/arxiv.1307.3108openalex-snapshot
Bernoulli, Ramanujan, Toeplitz and the triangular matrices
inferred← citeshttps://doi.org/10.48550/arxiv.2002.10304openalex-snapshot
Fast In-place Algorithms for Polynomial Operations: Division, Evaluation, Interpolation
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0301016openalex-snapshot
Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps
inferred← citeshttps://doi.org/10.5802/ccirm.9openalex-snapshot
Algorithmes rapides pour les polynômes, séries formelles et matrices
inferred← citeshttps://doi.org/10.70675/d6bccc99z42a7z4023za9f5z18124c58373fopenalex-snapshot
Fast finite field arithmetic
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.