On the public citation graph
A systolic array algorithm for the algebraic path problem (shortest paths; Matrix inversion)
0 signed · 123 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.1016/0304-3975(77)90056-1openalex-snapshot
Algebraic structures for transitive closure
inferredcites →https://doi.org/10.1016/0377-2217(81)90247-2openalex-snapshot
Remarks on the requirement matrix of school timetable problems
inferredcites →https://doi.org/10.1016/s0065-2458(08)60033-9openalex-snapshot
The Structure of Parallel Algorithms
inferredcites →https://doi.org/10.1016/s0167-5060(08)70423-0openalex-snapshot
1. Ordered Sets, Lattices and Matroids
inferredcites →https://doi.org/10.1016/s0304-0208(08)72965-7openalex-snapshot
Iteration and Summability in Semirings
inferredcites →https://doi.org/10.1093/imamat/15.2.161openalex-snapshot
Regular Algebra Applied to Path-finding Problems
inferredcites →https://doi.org/10.1093/imamat/7.3.273openalex-snapshot
An Algebra for Network Routing Problems
inferredcites →https://doi.org/10.1145/322261.322272openalex-snapshot
A Unified Approach to Path Problems
inferredcites →https://doi.org/10.1515/9781400882618-002openalex-snapshot
Representation of Events in Nerve Nets and Finite Automata
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11557654_89openalex-snapshot
Parallel Blocked Algorithm for Solving the Algebraic Path Problem on a Matrix Processor
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-16811-7_165openalex-snapshot
Parallel implementation of the algebraic path problem
inferred← citeshttps://doi.org/10.1007/3-540-17943-7_127openalex-snapshot
An implemented method for incremental systolic design
inferred← citeshttps://doi.org/10.1007/3-540-19444-4_15openalex-snapshot
Systolic algorithms for path-finding problems
inferred← citeshttps://doi.org/10.1007/3-540-45417-9_35openalex-snapshot
PVM Computation of the Transitive Closure: The Dependency Graph Approach
inferred← citeshttps://doi.org/10.1007/3-540-45825-5_37openalex-snapshot
Observations on Parallel Computation of Transitive and Max-Closure Problems
inferred← citeshttps://doi.org/10.1007/3-540-48311-x_99openalex-snapshot
The Algebraic Path Problem Revisited
inferred← citeshttps://doi.org/10.1007/3-540-51604-2_1openalex-snapshot
Parallel algorithms and architectures
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-1-4615-0843-4_2openalex-snapshot
Connectivity, Transitivity and Chromaticity: The Pioneering Work of Bernard Roy in Graph Theory
inferred← citeshttps://doi.org/10.1007/978-1-4615-3242-2_3openalex-snapshot
Formal Methods for Solving the Algebraic Path Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-13464-7_2openalex-snapshot
Exploiting the Hierarchical Structure of Rule-Based Specifications for Decision Planning
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/bf00282618openalex-snapshot
The derivation of systolic implementations of programs
inferred← citeshttps://doi.org/10.1007/bf00925116openalex-snapshot
Quasi-Linear allocation functions for efficient array design
inferred← citeshttps://doi.org/10.1007/bf01192158openalex-snapshot
Geometrical tools to map systems of affine recurrence equations on regular arrays
inferred← citeshttps://doi.org/10.1007/bf02252956openalex-snapshot
Computing transitive closure on systolic arrays of fixed size
inferred← citeshttps://doi.org/10.1007/bf02309554openalex-snapshot
An orthogonal systolic array for the algebraic path problem
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/bf02759321openalex-snapshot
Universal numerical algorithms and their software implementation
inferred← citeshttps://doi.org/10.1007/bfb0028261openalex-snapshot
Unstructured path problems and the making of semirings
inferred← citeshttps://doi.org/10.1007/bfb0032956openalex-snapshot
Mapping systolic algorithms on distributed memory computers
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/bfb0056593openalex-snapshot
On the PVM computations of transitive closure and algebraic path problems
inferred← citeshttps://doi.org/10.1007/bfb0083446openalex-snapshot
Generalized semialgebras over semirings
inferred← citeshttps://doi.org/10.1007/bfb0103916openalex-snapshot
Trees and paths: graph optimisation problems with industrial applications
inferred← citeshttps://doi.org/10.1007/s00500-013-1027-5openalex-snapshot
Universal algorithms for solving the matrix Bellman equations over semirings
inferred← citeshttps://doi.org/10.1007/s11265-019-01505-1openalex-snapshot
MAHASIM: Machine-Learning Hardware Acceleration Using a Software-Defined Intelligent Memory System
inferred← citeshttps://doi.org/10.1016/0010-4655(89)90195-1openalex-snapshot
Parallel algorithms and architectures
inferred← citeshttps://doi.org/10.1016/0045-7906(89)90018-9openalex-snapshot
The design and time analysis of a systolic array with asynchronous protocols for matrix multiplication
inferred← citeshttps://doi.org/10.1016/0167-6423(90)90082-oopenalex-snapshot
Synthesis of a new systolic architecture for the algebraic path problem
inferred← citeshttps://doi.org/10.1016/0167-8191(90)90044-aopenalex-snapshot
Spacetime-minimal systolic arrays for Gaussian elimination and the Algebraic path problem
inferred← citeshttps://doi.org/10.1016/0167-8191(92)90077-kopenalex-snapshot
Synthesis of size-optimal toroïdal arrays for the Algebraic Path Problem: A new contribution
inferred← citeshttps://doi.org/10.1016/0167-9260(93)90012-2openalex-snapshot
An improved systolic algorithm for the algebraic path problem
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90315-7openalex-snapshot
Generalized semigroup semirings which are zero-divisor-free or multiplicatively left-cancellative
inferred← citeshttps://doi.org/10.1016/0743-7315(89)90050-6openalex-snapshot
Linear systolic arrays for matrix computations
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/b978-0-08-036203-8.50097-3openalex-snapshot
Shortest-Path Algorithms
inferred← citeshttps://doi.org/10.1016/j.amc.2004.09.045openalex-snapshot
Optimal systolic array algorithms for tensor product
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.10.030openalex-snapshot
A Logic for Graphs with QoS
inferred← citeshttps://doi.org/10.1016/j.laa.2006.02.038openalex-snapshot
Max-plus definite matrix closures and their eigenspaces
inferred← citeshttps://doi.org/10.1016/j.laa.2014.06.028openalex-snapshot
The Markov Chain Tree Theorem in commutative semirings and the State Reduction Algorithm in commutative semifields
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.08.006openalex-snapshot
Quantitative μ-calculus and CTL defined over constraint semirings
inferred← citeshttps://doi.org/10.1016/s0065-2458(08)60178-3openalex-snapshot
Algorithm-Specific Parallel Processing with Linear Processing Arrays
inferred← citeshttps://doi.org/10.1016/s0167-8191(00)00039-9openalex-snapshot
Derivation of systolic algorithms for the algebraic path problem by recurrence transformations
inferred← citeshttps://doi.org/10.1016/s0951-8320(02)00174-6openalex-snapshot
Network reliability assessment using a cellular automata approach
inferred← citeshttps://doi.org/10.1016/s1570-7954(96)80016-7openalex-snapshot
Semirings and Semifields
inferred← citeshttps://doi.org/10.1023/a:1011487725803openalex-snapshot
Idempotent Interval Analysis and Optimization Problems
inferred← citeshttps://doi.org/10.1049/ip-cdt:19960379openalex-snapshot
Closed semiring connectionist network for the Bellman–Ford computation
inferred← citeshttps://doi.org/10.1080/00207168708803574openalex-snapshot
Matrix inversion by systolic rank annihilation
inferred← citeshttps://doi.org/10.1080/01495730008947355openalex-snapshot
PROCESSOR-TIME-OPTIMAL SYSTOLIC ARRAYS
inferred← citeshttps://doi.org/10.1080/02533839.1994.9677591openalex-snapshot
Cost‐effective algorithms for processor arrays with reconfigurable bus systems
inferred← citeshttps://doi.org/10.1080/03081087.2012.656107openalex-snapshot
Z-matrix equations in max-algebra, nonnegative linear algebra and other semirings
inferred← citeshttps://doi.org/10.1109/12.135564openalex-snapshot
Design of optimal systolic algorithms for the transitive closure problem
inferred← citeshttps://doi.org/10.1109/12.293256openalex-snapshot
A family of efficient regular arrays for algebraic path problem
inferred← citeshttps://doi.org/10.1109/12.67325openalex-snapshot
An optimal systolic array for the algebraic path problem
inferred← citeshttps://doi.org/10.1109/12.8709openalex-snapshot
A systolic array for the assignment problem
inferred← citeshttps://doi.org/10.1109/12.8711openalex-snapshot
Broadcast normalization in systolic design
inferred← citeshttps://doi.org/10.1109/12.9735openalex-snapshot
Synthesizing linear array algorithms from nested FOR loop algorithms
inferred← citeshttps://doi.org/10.1109/49.62830openalex-snapshot
High-rate Viterbi processor: a systolic array solution
inferred← citeshttps://doi.org/10.1109/71.127265openalex-snapshot
On the parallel computation of 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.491581openalex-snapshot
Optimal synthesis of algorithm-specific lower-dimensional processor arrays
inferred← citeshttps://doi.org/10.1109/71.503769openalex-snapshot
A modular systolic linearization of the Warshall-Floyd algorithm
inferred← citeshttps://doi.org/10.1109/71.640014openalex-snapshot
Solving an algebraic path problem and some related graph problems on a hyper-bus broadcast network
inferred← citeshttps://doi.org/10.1109/71.80125openalex-snapshot
Mapping nested loop algorithms into multidimensional systolic arrays
inferred← citeshttps://doi.org/10.1109/71.89068openalex-snapshot
Uniform approach for solving some classical problems on a linear array
inferred← citeshttps://doi.org/10.1109/81.503259openalex-snapshot
Closed semiring optimization circuits using a connectionist approach
inferred← citeshttps://doi.org/10.1109/arrays.1988.18067openalex-snapshot
A block algorithm for the algebraic path problem and its execution on a systolic array
inferred← citeshttps://doi.org/10.1109/arrays.1988.18070openalex-snapshot
Transitive closure on an instruction systolic array
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/asap.1990.145509openalex-snapshot
Spacetime-minimal systolic architectures for Gaussian elimination and the algebraic path problem
inferred← citeshttps://doi.org/10.1109/asap.1991.238893openalex-snapshot
Transformation of systolic algorithms for interleaving partitions
inferred← citeshttps://doi.org/10.1109/asap.1992.218555openalex-snapshot
A method to synthesize modular systolic arrays with local broadcast facility
inferred← citeshttps://doi.org/10.1109/cit.2008.4594683openalex-snapshot
Array processor featuring an effective FIFO-based data stream management
inferred← citeshttps://doi.org/10.1109/hpcc.2009.78openalex-snapshot
Matrix Inversion on the Cell/B.E. Processor
inferred← citeshttps://doi.org/10.1109/icassp.1987.1169583openalex-snapshot
One- and two-dimensional systolic arrays for least-squares problems
inferred← citeshttps://doi.org/10.1109/iccd.1988.25736openalex-snapshot
Parallel calculation of shortest paths in sparse graphs on a systolic array
inferred← citeshttps://doi.org/10.1109/icnn.1995.487904openalex-snapshot
Closed semiring optimization circuits using a connectionist approach
inferred← citeshttps://doi.org/10.1109/ipps.1991.153801openalex-snapshot
Systolic rank updating and the solution of non-linear equations
inferred← citeshttps://doi.org/10.1109/iscas.1989.100376openalex-snapshot
Linear and constant testability of hexagonally connected arrays
inferred← citeshttps://doi.org/10.1109/iscas.1993.394123openalex-snapshot
Digital circuit implementation of a continuous-time inference network for the transitive closure problem
inferred← citeshttps://doi.org/10.1109/iscas.1993.693048openalex-snapshot
Digital circuit implementation of a continuous-time inference network for the transitive closure problem
inferred← citeshttps://doi.org/10.1109/pacrim.1991.160817openalex-snapshot
Cost measures in VLSI array design
inferred← citeshttps://doi.org/10.1109/tassp.1987.1165208openalex-snapshot
A systolic array for computing B A-1
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.1109/tencon.2002.1181355openalex-snapshot
Analog implementation of BRIN for optimization problems
inferred← citeshttps://doi.org/10.1109/tnn.2003.816375openalex-snapshot
Analog and digital fpga implementation of brin for optimization problems
inferred← citeshttps://doi.org/10.1142/s0129053394000111openalex-snapshot
BOUNDED BROADCAST IN SYSTOLIC ARRAYS
inferred← citeshttps://doi.org/10.1145/327164.327221openalex-snapshot
A toroidal systolic array for Warshall's algorithm
inferred← citeshttps://doi.org/10.1145/3695839openalex-snapshot
Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs
inferred← citeshttps://doi.org/10.1145/3803799openalex-snapshot
Transition‑Based Acceptance for ω‑Regular Expression Synthesis
inferred← citeshttps://doi.org/10.1587/transinf.e93.d.534openalex-snapshot
Orbital Systolic Algorithms and Array Processors for Solution of the Algebraic Path Problem
inferred← citeshttps://doi.org/10.23638/dmtcs-20-1-26openalex-snapshot
Weighted Regular Tree Grammars with Storage
inferred← citeshttps://doi.org/10.25596/jalc-2002-321openalex-snapshot
Semiring Frameworks and Algorithms for Shortest-Distance Problems
inferred← citeshttps://doi.org/10.3115/1073083.1073085openalex-snapshot
Parameter estimation for probabilistic finite-state transducers
inferred← citeshttps://doi.org/10.3150/17-bej941openalex-snapshot
Max-linear models on directed acyclic graphs
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.347-350.2208openalex-snapshot
An Algorithm of Plus-Closures of Loop-Nonnegative Matrices over Idempotent Semirings and its Applications
inferred← citeshttps://doi.org/10.48550/arxiv.math/0101021openalex-snapshot
Correspondence principle for idempotent calculus and some computer applications
inferred← citeshttps://doi.org/10.48550/arxiv.math/0612309openalex-snapshot
Universal algorithms for generalized discrete matrix Bellman equations with symmetric Toeplitz matrix
inferred← citeshttps://doi.org/10.48550/arxiv.math/9911126openalex-snapshot
Idempotent mathematics and interval analysis
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/9904024openalex-snapshot
Unifying Approach to Software and Hardware Design for Scientific Calculations
inferred← citeshttps://doi.org/10.7907/8frw-zf17.openalex-snapshot
Applying formal methods to distributed algorithms using local-global relations
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.