On the public citation graph

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

https://doi.org/10.1007/pl00008266
0 signed · 39 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-38424-3_8openalex-snapshot
Solving Large Sparse Linear Systems Over Finite Fields
inferredcites →https://doi.org/10.1007/3-540-46885-4_35openalex-snapshot
Factoring by electronic mail
inferredcites →https://doi.org/10.1007/3-540-58691-1_38openalex-snapshot
Lattice sieving and trial division
inferredcites →https://doi.org/10.1007/978-3-7091-6619-2_110openalex-snapshot
Efficient Hybrid Solution of Sparse Linear Systems
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.1080/10586458.1992.10504250openalex-snapshot
Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes
inferredcites →https://doi.org/10.1109/icassp.1980.1171074openalex-snapshot
Doubling algorithms for Toeplitz and related equations
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.1109/tsmc.1972.4309115openalex-snapshot
State-Space and Multivariable Theory
inferredcites →https://doi.org/10.1137/s0895479892230031openalex-snapshot
A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
inferredcites →https://doi.org/10.1142/9407openalex-snapshot
Algebraic Coding Theory
inferredcites →https://doi.org/10.1145/113379.113396openalex-snapshot
Processor efficient parallel solution of linear systems over an abstract field
inferredcites →https://doi.org/10.1145/357980.358017openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.2307/2153413openalex-snapshot
Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
inferredcites →https://doi.org/10.2307/2153451openalex-snapshot
Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems

What points at this work

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

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/978-3-642-03356-8_25openalex-snapshot
Practical Cryptanalysis of iso/iec 9796-2 and emv Signatures
inferred← citeshttps://doi.org/10.1007/s00145-015-9205-5openalex-snapshot
Practical Cryptanalysis of ISO 9796-2 and EMV Signatures
inferred← citeshttps://doi.org/10.1016/j.ins.2016.10.017openalex-snapshot
Parallel GNFS algorithm integrated with parallel block Wiedemann algorithm for RSA security in cloud computing
inferred← citeshttps://doi.org/10.1016/j.jsc.2010.08.015openalex-snapshot
Simultaneous modular reduction and Kronecker substitution for small finite fields
inferred← citeshttps://doi.org/10.1063/5.0182676openalex-snapshot
RSA security in cloud computing: A distributed model for integrated GNFS with Black Wiedemann algorithm for integer factorization
inferred← citeshttps://doi.org/10.1080/00029890.1998.12004985openalex-snapshot
The Idea Behind Krylov Methods
inferred← citeshttps://doi.org/10.1109/dasc.2006.9openalex-snapshot
A Parallel GNFS Integrated with the Block Wiedemann's Algorithm for Integer Factorization
inferred← citeshttps://doi.org/10.1109/grid.2010.5697952openalex-snapshot
Using a grid platform for solving large sparse linear systems over GF(2)
inferred← citeshttps://doi.org/10.1137/16m1089630openalex-snapshot
Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates
inferred← citeshttps://doi.org/10.1142/9789812777171_0005openalex-snapshot
LINBOX: A GENERIC LIBRARY FOR EXACT LINEAR ALGEBRA
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/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/384101.384145openalex-snapshot
Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm
inferred← citeshttps://doi.org/10.1201/b15006-22openalex-snapshot
Cryptography
inferred← citeshttps://doi.org/10.1287/ijoc.2015.0653openalex-snapshot
Roundoff-Error-Free Algorithms for Solving Linear Systems via Cholesky and LU Factorizations
inferred← citeshttps://doi.org/10.14429/dsj.72.17656openalex-snapshot
Solution of Large Sparse System of Linear Equations over GF(2) on a Multi Node Multi GPU Platform
inferred← citeshttps://doi.org/10.48550/arxiv.1204.3735openalex-snapshot
Computational linear algebra over finite fields
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.