On the public citation graph
An orthogonal systolic array for the algebraic path problem
0 signed · 28 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.1007/bf02253318openalex-snapshot
A systolic array algorithm for the algebraic path problem (shortest paths; Matrix inversion)
inferredcites →https://doi.org/10.1016/0743-7315(84)90010-8openalex-snapshot
Wafer-scale integration and two-level pipelined implementations of systolic arrays
inferredcites →https://doi.org/10.1016/s0167-5060(08)70423-0openalex-snapshot
1. Ordered Sets, Lattices and Matroids
inferredcites →https://doi.org/10.1080/00207168508803470openalex-snapshot
BlockLUdecompositon of a band matrix on a systolic array
inferredcites →https://doi.org/10.1109/mc.1982.1653828openalex-snapshot
Highly concurrent computing structures for matrix arithmetic and signal processing
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-16766-8_7openalex-snapshot
On the connection between hexagonal and unidirectional rectangular systolic arrays
inferred← citeshttps://doi.org/10.1007/3-540-55895-0_421openalex-snapshot
Designing modular linear systolic arrays using dependence graph regular partitions
inferred← citeshttps://doi.org/10.1007/978-1-4612-4476-9_31openalex-snapshot
A Systolic Program for Gauss-Jordan Elimination
inferred← citeshttps://doi.org/10.1007/978-3-642-14941-2_4openalex-snapshot
Universal Algorithms, Mathematics of Semirings and Parallel Computations
inferred← citeshttps://doi.org/10.1007/978-3-642-36433-4_4openalex-snapshot
Idempotent/Tropical Analysis, the Hamilton–Jacobi and Bellman Equations
inferred← citeshttps://doi.org/10.1007/978-3-642-76119-5_56openalex-snapshot
Wie kann man imperative Programme auf eine Systolisierung vorbereiten?
inferred← citeshttps://doi.org/10.1007/bf00265150openalex-snapshot
An incremental mechanical development of systolic solutions to the Algebraic Path Problem
inferred← citeshttps://doi.org/10.1007/bf02252956openalex-snapshot
Computing transitive closure on systolic arrays of fixed size
inferred← citeshttps://doi.org/10.1007/bf02477180openalex-snapshot
A block algorithm and optimal fixed-size systolic array processor for the algebraic path problem
inferred← citeshttps://doi.org/10.1007/bfb0043262openalex-snapshot
A fixed-size systolic system for the transitive closure and shortest path problems
inferred← citeshttps://doi.org/10.1007/s11227-006-0013-4openalex-snapshot
Computing all-pairs shortest paths on a linear systolic array and hardware realization on a reprogrammable FPGA platform
inferred← citeshttps://doi.org/10.1016/0167-8191(89)90083-5openalex-snapshot
Systolic Gauss-Jordan elimination for dense linear systems
inferred← citeshttps://doi.org/10.1016/0743-7315(92)90038-oopenalex-snapshot
An efficient VLSI algorithm for the all pairs shortest path problem
inferred← citeshttps://doi.org/10.1016/j.amc.2004.09.045openalex-snapshot
Optimal systolic array algorithms for tensor product
inferred← citeshttps://doi.org/10.1109/12.67325openalex-snapshot
An optimal systolic array for the algebraic path problem
inferred← citeshttps://doi.org/10.1109/71.139200openalex-snapshot
A processor-time-minimal systolic array for transitive closure
inferred← citeshttps://doi.org/10.1109/71.80125openalex-snapshot
Mapping nested loop algorithms into multidimensional systolic arrays
inferred← citeshttps://doi.org/10.1109/asap.1990.145439openalex-snapshot
A processor-time minimal systolic array for transitive closure
inferred← citeshttps://doi.org/10.1109/tc.1987.1676945openalex-snapshot
Optimal Systolic Design for the Transitive Closure and the Shortest Path Problems
inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.4761openalex-snapshot
A Comprehensive Methodology for Algorithm Characterization, Regularization and Mapping Into Optimal VLSI Arrays.
inferred← citeshttps://doi.org/10.48550/arxiv.math/0101021openalex-snapshot
Correspondence principle for idempotent calculus and some computer applications
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.