On the public citation graph

Unstructured path problems and the making of semirings

https://doi.org/10.1007/bfb0028261
0 signed · 36 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-54233-7_144openalex-snapshot
Efficient algorithms for path problems with general cost criteria
inferredcites →https://doi.org/10.1007/978-3-642-73235-5openalex-snapshot
Rational Series and Their Languages
inferredcites →https://doi.org/10.1007/978-3-663-09367-1openalex-snapshot
Transductions and Context-Free Languages
inferredcites →https://doi.org/10.1007/978-3-7091-9076-0_9openalex-snapshot
Path Problems in Graphs
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/0012-365x(79)90061-xopenalex-snapshot
Semirings and path spaces
inferredcites →https://doi.org/10.1057/jors.1991.155openalex-snapshot
Introduction to Algorithms
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/321105.321107openalex-snapshot
A Theorem on Boolean Matrices
inferredcites →https://doi.org/10.1145/322261.322272openalex-snapshot
A Unified Approach to Path Problems
inferredcites →https://doi.org/10.1145/322261.322273openalex-snapshot
Fast Algorithms for Solving Path Problems
inferredcites →https://doi.org/10.1145/358876.358884openalex-snapshot
A more general algorithm for computing closed semiring costs between vertices of a directed graph
inferredcites →https://doi.org/10.1145/367766.368168openalex-snapshot
Algorithm 97: Shortest path
inferredcites →https://doi.org/10.1145/3828.3830openalex-snapshot
Generalized best-first search strategies and the optimality of A*
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/11693024_17openalex-snapshot
Path Optimization in Programs and Its Application to Debugging
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_144openalex-snapshot
Efficient algorithms for path problems with general cost criteria
inferred← citeshttps://doi.org/10.1007/978-3-540-78913-0_11openalex-snapshot
Increasing Bisemigroups and Algebraic Routing
inferred← citeshttps://doi.org/10.1007/978-3-642-31606-7_12openalex-snapshot
Weighted Nested Word Automata and Logics over Strong Bimonoids
inferred← citeshttps://doi.org/10.1007/s00165-012-0245-4openalex-snapshot
Dijkstra, Floyd and Warshall meet Kleene
inferred← citeshttps://doi.org/10.1007/s13119-011-0003-6openalex-snapshot
Exploring the stratified shortest-paths problem
inferred← citeshttps://doi.org/10.1016/0167-6377(94)90048-5openalex-snapshot
Fast algorithms for the maximum convolution problem
inferred← citeshttps://doi.org/10.1016/0303-2647(93)90058-kopenalex-snapshot
Computation of biopolymers: A general approach to different problems
inferred← citeshttps://doi.org/10.1016/0303-2647(93)90069-oopenalex-snapshot
Prediction of the exon-intron structure by a dynamic programming approach
inferred← citeshttps://doi.org/10.1016/j.comnet.2011.03.013openalex-snapshot
Modeling a policy-capable path-vector routing protocol using Jacobi iteration over a path algebra
inferred← citeshttps://doi.org/10.1016/j.ins.2009.09.003openalex-snapshot
Weighted finite automata over strong bimonoids
inferred← citeshttps://doi.org/10.1016/j.ins.2010.05.020openalex-snapshot
Determinization of weighted finite automata over strong bimonoids
inferred← citeshttps://doi.org/10.1016/j.ins.2010.12.008openalex-snapshot
An improved algorithm for determinization of weighted and fuzzy automata☆
inferred← citeshttps://doi.org/10.1109/43.329265openalex-snapshot
Robust methods for EMC-driven routing
inferred← citeshttps://doi.org/10.1109/comsnets.2010.5432000openalex-snapshot
The Stratified Shortest-Paths Problem (invited paper)
inferred← citeshttps://doi.org/10.1109/iccad.1992.279326openalex-snapshot
HERO: Hierarchical EMC-constrained routing
inferred← citeshttps://doi.org/10.1109/icnp.2007.4375842openalex-snapshot
Lexicographic products in metarouting
inferred← citeshttps://doi.org/10.1109/infcom.2010.5462116openalex-snapshot
A Formal Study of Trust-Based Routing in Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.2200/s00245ed1v01y201001cnt003openalex-snapshot
Path Problems in Networks
inferred← citeshttps://doi.org/10.5555/304032.304041openalex-snapshot
Configuring multiple scan chains for minimum test time
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.