On the public citation graph

Base tensorielle des matrices de Hankel (ou de Toeplitz) Applications

https://doi.org/10.1007/bf01438261
0 signed · 23 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf02163269openalex-snapshot
Numerical solution of linear equations with Toeplitz and Vector Toeplitz matrices
inferredcites →https://doi.org/10.1007/bf02242389openalex-snapshot
An algorithm for division of powerseries
inferredcites →https://doi.org/10.1515/crll.1973.264.184openalex-snapshot
Vermeidung von Divisionen.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-10003-2_63openalex-snapshot
Border rank of a p×q×2 tensor and the optimal approximation of a pair of bilinear forms
inferred← citeshttps://doi.org/10.1007/3-540-15984-3_229openalex-snapshot
Algorithms for polynomial division
inferred← citeshttps://doi.org/10.1007/978-94-017-7188-7_3openalex-snapshot
Recurrences and Triangular Systems
inferred← citeshttps://doi.org/10.1007/bf01140212openalex-snapshot
Dual problems of multiplication of a vector by a matrix
inferred← citeshttps://doi.org/10.1016/0024-3795(78)90005-8openalex-snapshot
Some elementary proofs of lower bounds in complexity theory
inferred← citeshttps://doi.org/10.1016/0024-3795(79)90096-xopenalex-snapshot
On the optimal computation of a set of symmetric and persymmetric bilinear forms
inferred← citeshttps://doi.org/10.1016/0024-3795(83)80041-xopenalex-snapshot
Rank and optimal computation of generic tensors
inferred← citeshttps://doi.org/10.1016/0024-3795(91)90293-6openalex-snapshot
Structure and arithmetic complexity of products and inverses of Toeplitz matrices
inferred← citeshttps://doi.org/10.1016/0024-3795(93)90483-5openalex-snapshot
Product rules for the displacement of near-Toeplitz matrices
inferred← citeshttps://doi.org/10.1016/0041-5553(77)90022-2openalex-snapshot
The lower bound of the number of multiplication operations for calculating the product of hankel matrices
inferred← citeshttps://doi.org/10.1016/0166-218x(87)90004-7openalex-snapshot
A very personal reminiscence on the problem of computational complexity
inferred← citeshttps://doi.org/10.1016/0885-064x(86)90001-4openalex-snapshot
Polynomial division and its computational complexity
inferred← citeshttps://doi.org/10.1016/j.laa.2004.02.022openalex-snapshot
Non-skip-free M/G/1-type Markov chains and Laurent matrix power series
inferred← citeshttps://doi.org/10.1080/03081088308817542openalex-snapshot
Some extensions of Hankel and Toeplitz matrices
inferred← citeshttps://doi.org/10.1109/icassp.1989.266628openalex-snapshot
Doubling Levinson/Schur algorithm and its implementation
inferred← citeshttps://doi.org/10.1137/0212007openalex-snapshot
Characterization of Division Algebras of Minimal Rank and the Structure of their Algorithm Varieties
inferred← citeshttps://doi.org/10.1137/0216021openalex-snapshot
Tensor Rank and Border Rank of Band Toeplitz Matrices
inferred← citeshttps://doi.org/10.1137/1034049openalex-snapshot
Complexity of Computations with Matrices and Polynomials
inferred← citeshttps://doi.org/10.1145/355791.355797openalex-snapshot
Practical Parallel Band Triangular System Solvers
inferred← citeshttps://doi.org/10.5075/epfl-thesis-6190openalex-snapshot
Resource-efficient parallel acquisition architectures for modernized GNSS signals
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.