On the public citation graph

Many-to-one packet routing via matchings

https://doi.org/10.1007/bfb0045067
0 signed · 17 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.1002/net.3230230420openalex-snapshot
Routing permutations on a graph
inferredcites →https://doi.org/10.1007/3-540-60220-8_67openalex-snapshot
Routing on trees via matchings
inferredcites →https://doi.org/10.1007/bf02090401openalex-snapshot
A unified framework for off-line permutation routing in parallel networks
inferredcites →https://doi.org/10.1137/s0895480192236628openalex-snapshot
Routing Permutations on Graphs via Matchings
inferredcites →https://doi.org/10.1145/129712.129721openalex-snapshot
Methods for message routing in parallel machines
inferredcites →https://doi.org/10.1184/r1/6608258openalex-snapshot
Parallel neighbor-sort (or the glory of the induction principle)
inferredcites →https://doi.org/10.5555/314161.314340openalex-snapshot
Optimal bounds for matching routing on trees

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11408901_27openalex-snapshot
Efficient Protection of Many-to-One Communications
inferred← citeshttps://doi.org/10.1007/978-3-642-54423-1_30openalex-snapshot
Collision-Free Network Exploration
inferred← citeshttps://doi.org/10.1007/bfb0009504openalex-snapshot
Dynamic tree routing under the “matching with consumption” model
inferred← citeshttps://doi.org/10.1007/bfb0054329openalex-snapshot
On-Line matching routing on trees
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.11.008openalex-snapshot
Collision-free network exploration
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00010-9openalex-snapshot
On-line matching routing on trees
inferred← citeshttps://doi.org/10.1142/s0129054101000564openalex-snapshot
ON THE ROUTING NUMBER OF COMPLETE d-ARY TREES
inferred← citeshttps://doi.org/10.5555/314161.314340openalex-snapshot
Optimal bounds for matching routing on trees
inferred← citeshttps://doi.org/10.5555/314613.314726openalex-snapshot
Direct routing on trees
inferred← citeshttps://doi.org/10.70675/58e2747az6a79z40dezb604zbcda2fb26d19openalex-snapshot
Algorithms for deterministic parallel graph exploration
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.