On the public citation graph

Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems

0 signed · 115 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/3-540-09519-5_60openalex-snapshot

Approximate algorithms to derive exact solutions to systems of linear equations

inferredcites →https://doi.org/10.1007/3-540-09519-5_73openalex-snapshot

Probabilistic algorithms for sparse polynomials

inferredcites →https://doi.org/10.1007/3-540-38424-3_8openalex-snapshot

Solving Large Sparse Linear Systems Over Finite Fields

inferredcites →https://doi.org/10.1007/3-540-54522-0_93openalex-snapshot

On wiedemann's method of solving sparse linear systems

inferredcites →https://doi.org/10.1007/3-540-56686-4_44openalex-snapshot

Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems

inferredcites →https://doi.org/10.1007/978-1-4615-3188-3openalex-snapshot

Effective Polynomial Computation

inferredcites →https://doi.org/10.1007/bf01178683openalex-snapshot

On fast multiplication of polynomials over arbitrary algebras

inferredcites →https://doi.org/10.1007/bfb0013169openalex-snapshot

Process scheduling in DSC and the large sparse linear systems challenge

inferredcites →https://doi.org/10.1016/0020-0190(78)90067-4openalex-snapshot

A probabilistic remark on algebraic program testing

inferredcites →https://doi.org/10.1016/0022-247x(79)90124-0openalex-snapshot

Displacement ranks of matrices and linear equations

inferredcites →https://doi.org/10.1016/0024-3795(80)90161-5openalex-snapshot

Asymptotically fast solution of toeplitz and related systems of linear equations

inferredcites →https://doi.org/10.1016/0024-3795(86)90279-xopenalex-snapshot

Efficient solution of linear systems of equations with recursive structure

inferredcites →https://doi.org/10.1016/0196-6774(80)90013-9openalex-snapshot

Fast solution of toeplitz systems of equations and computation of Padé approximants

inferredcites →https://doi.org/10.1016/0898-1221(92)90215-4openalex-snapshot

Parametrization of Newton's iteration for computations with structured matrices and applications

inferredcites →https://doi.org/10.1080/10586458.1992.10504250openalex-snapshot

Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes

inferredcites →https://doi.org/10.1090/s0025-5718-1993-1182953-4openalex-snapshot

The Factorization of the Ninth Fermat Number

inferredcites →https://doi.org/10.1109/icassp.1980.1171074openalex-snapshot

Doubling algorithms for Toeplitz and related equations

inferredcites →https://doi.org/10.1109/sfcs.1992.267779openalex-snapshot

Processor-efficient parallel solution of linear systems. II. The positive characteristic and singular cases

inferredcites →https://doi.org/10.1109/tassp.1985.1164645openalex-snapshot

A generalization of the Levinson algorithm for Hermitian Toeplitz matrices with any rank profile

inferredcites →https://doi.org/10.1109/tit.1969.1054260openalex-snapshot

Shift-register synthesis and BCH decoding

inferredcites →https://doi.org/10.1109/tit.1986.1057137openalex-snapshot

Solving sparse linear equations over finite fields

inferredcites →https://doi.org/10.1145/190347.190371openalex-snapshot

Factoring high-degree polynomials by the black box Berlekamp algorithm

inferredcites →https://doi.org/10.1145/321784.321787openalex-snapshot

The Exact Solution of Systems of Linear Equations with Polynomial Coefficients

inferredcites →https://doi.org/10.1145/322217.322225openalex-snapshot

Fast Probabilistic Algorithms for Verification of Polynomial Identities

inferredcites →https://doi.org/10.2307/2153413openalex-snapshot

Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm

What points at this work

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

inferred← citeshttps://doi.org/10.1006/ffta.1999.0267openalex-snapshot

New Techniques for the Computation of Linear Recurrence Coefficients

inferred← citeshttps://doi.org/10.1006/jsco.1999.1002openalex-snapshot

Factoring Polynomials Over Finite Fields: A Survey

inferred← citeshttps://doi.org/10.1006/jsco.2001.0451openalex-snapshot

On Efficient Sparse Integer Matrix Smith Normal Form Computations

inferred← citeshttps://doi.org/10.1006/jsco.2002.0533openalex-snapshot

Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm

inferred← citeshttps://doi.org/10.1007/3-540-45682-1_7openalex-snapshot

Computation of Discrete Logarithms in $$ \mathbb{F}_{2^{607} } $$

inferred← citeshttps://doi.org/10.1007/3-540-45841-7_17openalex-snapshot

Randomized Acceleration of Fundamental Matrix Computations

inferred← citeshttps://doi.org/10.1007/978-0-387-75155-9_4openalex-snapshot

Efficient Inversion of Rational Maps Over Finite Fields

inferred← citeshttps://doi.org/10.1007/978-3-030-56880-1_3openalex-snapshot

Comparing the Difficulty of Factorization and Discrete Logarithm: A 240-Digit Experiment

inferred← citeshttps://doi.org/10.1007/978-3-319-09873-9_64openalex-snapshot

Resolution of Linear Algebra for the Discrete Logarithm Problem Using GPU and Multi-core Architectures

inferred← citeshttps://doi.org/10.1007/978-3-319-16277-5_2openalex-snapshot

Accelerating Iterative SpMV for the Discrete Logarithm Problem Using GPUs

inferred← citeshttps://doi.org/10.1007/978-3-319-56620-7_7openalex-snapshot

Computation of a 768-Bit Prime Field Discrete Logarithm

inferred← citeshttps://doi.org/10.1007/978-3-319-99639-4_1openalex-snapshot

Proof-of-Work Certificates that Can Be Efficiently Computed in the Cloud (Invited Talk)

inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_22openalex-snapshot

Bloomier Filters: A Second Look

inferred← citeshttps://doi.org/10.1007/978-3-642-54631-0_13openalex-snapshot

Discrete Logarithm in GF(2809) with FFS

inferred← citeshttps://doi.org/10.1007/978-3-642-60218-4_26openalex-snapshot

Superfast Computations with Singular Structured Matrices over Abstract Fields

inferred← citeshttps://doi.org/10.1007/978-3-7091-0794-2_5openalex-snapshot

The “Seven Dwarfs” of Symbolic Computation

inferred← citeshttps://doi.org/10.1007/pl00008266openalex-snapshot

Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields

inferred← citeshttps://doi.org/10.1007/s00037-004-0185-3openalex-snapshot

On the complexity of computing determinants

inferred← citeshttps://doi.org/10.1007/s00200-003-0133-5openalex-snapshot

Fast Algorithms for Zero-Dimensional Polynomial Systems using Duality

inferred← citeshttps://doi.org/10.1007/s00453-001-0032-8openalex-snapshot

Certification of Numerical Computation of the Sign of the Determinant of a Matrix

inferred← citeshttps://doi.org/10.1007/s10958-006-0118-6openalex-snapshot

On theoretical and practical acceleration of randomized computation of the determinant of an integer matrix

inferred← citeshttps://doi.org/10.1007/s10958-013-1489-0openalex-snapshot

A connection of series approximations and the basis of the Krylov space in block algorithms of Coppersmith and Montgomery

inferred← citeshttps://doi.org/10.1016/0304-3975(96)00030-8openalex-snapshot

Parallel computation of polynomial GCD and some related parallel computations over abstract fields

inferred← citeshttps://doi.org/10.1016/j.cam.2003.08.019openalex-snapshot

Computing the sign or the value of the determinant of an integer matrix, a complexity survey

inferred← citeshttps://doi.org/10.1016/j.comcom.2013.09.006openalex-snapshot

Online XOR packet coding: Efficient single-hop wireless multicasting with low decoding delay

inferred← citeshttps://doi.org/10.1016/j.jco.2004.03.005openalex-snapshot

Essentially optimal computation of the inverse of generic polynomial matrices

inferred← citeshttps://doi.org/10.1016/j.jsc.2015.06.005openalex-snapshot

Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation

inferred← citeshttps://doi.org/10.1016/j.jsc.2019.07.010openalex-snapshot

Block-Krylov techniques in the context of sparse-FGLM algorithms

inferred← citeshttps://doi.org/10.1016/j.jsc.2025.102507openalex-snapshot

Early termination for sparse interpolation of polynomials in Chebyshev bases

inferred← citeshttps://doi.org/10.1016/j.tcs.2008.05.014openalex-snapshot

Solving structured linear systems with large displacement rank

inferred← citeshttps://doi.org/10.1016/j.tcs.2017.03.031openalex-snapshot

Nearly optimal computations with structured matrices

inferred← citeshttps://doi.org/10.1016/s0024-3795(00)00041-0openalex-snapshot

Superfast algorithms for Cauchy-like matrix computations and extensions

inferred← citeshttps://doi.org/10.1016/s0024-3795(01)00472-4openalex-snapshot

Efficient matrix preconditioners for black box linear algebra

inferred← citeshttps://doi.org/10.1023/a:1008350005447openalex-snapshot

Discrete Logarithms: The Past and the Future

inferred← citeshttps://doi.org/10.1080/03772063.2019.1703832openalex-snapshot

Linear Algebra on Parallel Structures Using Wiedemann Algorithm to Solve Discrete Logarithm Problem

inferred← citeshttps://doi.org/10.1090/s0025-5718-98-00973-9openalex-snapshot

Euclid’s algorithm and the Lanczos method over finite fields

inferred← citeshttps://doi.org/10.1109/cits49457.2020.9232505openalex-snapshot

Improvements to the Descent Step in the Number Field Sieve for Discrete Logarithms

inferred← citeshttps://doi.org/10.1109/icccnt.2017.8204154openalex-snapshot

Sparse linear algebra in function field sieve

inferred← citeshttps://doi.org/10.1109/iccsnt.2013.6967077openalex-snapshot

Research on parallel model for sparse matrix-vector iterative multiplication

inferred← citeshttps://doi.org/10.1137/s0097539797349959openalex-snapshot

Parallel Complexity of Computations with General and Toeplitz-Like Matrices Filled with Integers and Extensions

inferred← citeshttps://doi.org/10.1137/s089548010139388xopenalex-snapshot

Random Krylov Spaces over Finite Fields

inferred← citeshttps://doi.org/10.1142/9789814533584_0023openalex-snapshot

Parallel Solution of Toeplitz and Toeplitz-Like Linear Systems Over Fields of Small Positive Characteristic

inferred← citeshttps://doi.org/10.1142/9789814719261_0008openalex-snapshot

Nearly sparse linear algebra and application to discrete logarithms computations

inferred← citeshttps://doi.org/10.1145/1005285.1005305openalex-snapshot

Reliable Krylov-based algorithms for matrix null space and rank

inferred← citeshttps://doi.org/10.1145/1073884.1073905openalex-snapshot

Efficient computation of the characteristic polynomial

inferred← citeshttps://doi.org/10.1145/1145768.1145785openalex-snapshot

Solving sparse rational linear systems

inferred← citeshttps://doi.org/10.1145/1145768.1145822openalex-snapshot

A block Wiedemann rank algorithm

inferred← citeshttps://doi.org/10.1145/1182553.1182558openalex-snapshot

Solving structured linear systems of large displacement rank

inferred← citeshttps://doi.org/10.1145/1277500.1277503openalex-snapshot

On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms

inferred← citeshttps://doi.org/10.1145/1277548.1277554openalex-snapshot

Solving toeplitz- and vandermonde-like linear systems with large displacement rank

inferred← citeshttps://doi.org/10.1145/1277548.1277569openalex-snapshot

Faster inversion and other black box matrix computations using efficient block projections

inferred← citeshttps://doi.org/10.1145/1277548.1277577openalex-snapshot

On exact and approximate interpolation of sparse rational functions

inferred← citeshttps://doi.org/10.1145/1277548.1277603openalex-snapshot

Some recent progress in exact linear algebra and related questions

inferred← citeshttps://doi.org/10.1145/1278177.1278186openalex-snapshot

Parallel computation of the rank of large sparse matrices from algebraic K-theory

inferred← citeshttps://doi.org/10.1145/1837210.1837213openalex-snapshot

Fifteen years after DSC and WLSS2 what parallel computations I do today

inferred← citeshttps://doi.org/10.1145/1837210.1837224openalex-snapshot

Exact sparse matrix-vector multiplication on GPU's and multicore architectures

inferred← citeshttps://doi.org/10.1145/1837934.1837988openalex-snapshot

Computing specified generators of structured matrix inverses

inferred← citeshttps://doi.org/10.1145/190347.190371openalex-snapshot

Factoring high-degree polynomials by the black box Berlekamp algorithm

inferred← citeshttps://doi.org/10.1145/190347.190431openalex-snapshot

Asymptotically fast solution of Toeplitz-like singular linear systems

inferred← citeshttps://doi.org/10.1145/236869.237081openalex-snapshot

On rank properties of Toeplitz matrices over finite fields

inferred← citeshttps://doi.org/10.1145/2500122openalex-snapshot

On the matrix berlekamp-massey algorithm

inferred← citeshttps://doi.org/10.1145/258726.258742openalex-snapshot

Further analysis of Coppersmith's block Wiedemann algorithm for the solution of sparse linear systems (extended abstract)

inferred← citeshttps://doi.org/10.1145/258726.258776openalex-snapshot

On randomized Lanczos algorithms

inferred← citeshttps://doi.org/10.1145/266670.266678openalex-snapshot

Efficient parallel solution of sparse systems of linear diophantine equations

inferred← citeshttps://doi.org/10.1145/2790282.2791392openalex-snapshot

Direct solution of the (11,9,8)-MinRank problem by the block Wiedemann algorithm in magma with a tesla GPU

inferred← citeshttps://doi.org/10.1145/281508.281591openalex-snapshot

Certifying inconsistency of sparse linear systems

inferred← citeshttps://doi.org/10.1145/2930889.2930908openalex-snapshot

Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix

inferred← citeshttps://doi.org/10.1145/301250.301389openalex-snapshot

The complexity of the matrix eigenproblem

inferred← citeshttps://doi.org/10.1145/307733.307737openalex-snapshot

Block solution of sparse linear systems over GF (q)

inferred← citeshttps://doi.org/10.1145/3208976.3208999openalex-snapshot

Sparse Polynomial Interpolation With Arbitrary Orthogonal Polynomial Bases

inferred← citeshttps://doi.org/10.1145/3326229.3326272openalex-snapshot

Implementations of Efficient Univariate Polynomial Matrix Algorithms and Application to Bivariate Resultants

inferred← citeshttps://doi.org/10.1145/345542.345590openalex-snapshot

Integer Smith form via the valence

inferred← citeshttps://doi.org/10.1145/384101.384145openalex-snapshot

Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm

inferred← citeshttps://doi.org/10.1145/780506.780524openalex-snapshot

An output-sensitive variant of the baby steps/giant steps determinant algorithm

inferred← citeshttps://doi.org/10.11575/prism/30586openalex-snapshot

Bounding the Nullities of Random Block Hankel Matrices: An Alternative Approach

inferred← citeshttps://doi.org/10.22331/q-2024-08-27-1450openalex-snapshot

Fast erasure decoder for hypergraph product codes

inferred← citeshttps://doi.org/10.3929/ethz-b-000532089openalex-snapshot

Faster Sparse Matrix Inversion and Rank Computation in Finite Fields

inferred← citeshttps://doi.org/10.48550/arxiv.1204.3735openalex-snapshot

Computational linear algebra over finite fields

inferred← citeshttps://doi.org/10.48550/arxiv.1209.5520openalex-snapshot

Accelerating Iterative SpMV for Discrete Logarithm Problem Using GPUs

inferred← citeshttps://doi.org/10.48550/arxiv.1402.3661openalex-snapshot

Resolution of Linear Algebra for the Discrete Logarithm Problem Using GPU and Multi-core Architectures

inferred← citeshttps://doi.org/10.48550/arxiv.1507.01083openalex-snapshot

Interactive certificate for the verification of Wiedemann's Krylov sequence: application to the certification of the determinant, the minimal and the characteristic polynomials of sparse matrices

inferred← citeshttps://doi.org/10.48550/arxiv.1602.00810openalex-snapshot

Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix

inferred← citeshttps://doi.org/10.48550/arxiv.1604.02277openalex-snapshot

A modified block Lanczos algorithm with fewer vectors

inferred← citeshttps://doi.org/10.48550/arxiv.1712.04177openalex-snapshot

Block-Krylov techniques in the context of sparse-FGLM algorithms

inferred← citeshttps://doi.org/10.48550/arxiv.2103.15926openalex-snapshot

Interpolation by decomposable univariate polynomials

inferred← citeshttps://doi.org/10.48550/arxiv.cs/0501074openalex-snapshot

Efficient Computation of the Characteristic Polynomial

inferred← citeshttps://doi.org/10.48550/arxiv.cs/0603082openalex-snapshot

Solving Sparse Integer Linear Systems

inferred← citeshttps://doi.org/10.48550/arxiv.cs/0701188openalex-snapshot

Faster Inversion and Other Black Box Matrix Computations Using Efficient Block Projections

inferred← citeshttps://doi.org/10.5860/choice.34-4512openalex-snapshot

Handbook of applied cryptography

inferred← citeshttps://doi.org/10.70675/af2942b2zd112z4b00za26cz633ec7ad6786openalex-snapshot

Algebraic cryptanalysis and contributions to post-quantum cryptography based on error-correcting codes in the rank-metric

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.