On the public citation graph
Greedy hot-potato routing on the two-dimensional mesh
0 signed · 57 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/bf02311228openalex-snapshot
Bounds on evacuation time for deflection routing
inferredcites →https://doi.org/10.1007/bfb0049423openalex-snapshot
Greedy hot-potato routing on the mesh
inferredcites →https://doi.org/10.1016/0022-0000(85)90008-xopenalex-snapshot
Routing, merging, and sorting on parallel models of computation
inferredcites →https://doi.org/10.1016/0169-7552(86)90083-8openalex-snapshot
Teletraffic analysis and computer performance evaluation
inferredcites →https://doi.org/10.1038/scientificamerican0687-108openalex-snapshot
The Connection Machine
inferredcites →https://doi.org/10.1109/12.35831openalex-snapshot
An optimal shortest-path routing policy for network computers with regular mesh-connected topologies
inferredcites →https://doi.org/10.1109/26.142797openalex-snapshot
Deflection routing in hypercube networks
inferredcites →https://doi.org/10.1109/71.395401openalex-snapshot
Bounds on maximum delay in networks with deflection routing
inferredcites →https://doi.org/10.1109/71.476188openalex-snapshot
Hot-potato algorithms for permutation routing
inferredcites →https://doi.org/10.1109/infcom.1989.101529openalex-snapshot
Comparison of deflection and store-and-forward techniques in the Manhattan Street and Shuffle-Exchange Networks
inferredcites →https://doi.org/10.1109/infcom.1990.91340openalex-snapshot
An analysis of 'hot-potato' routing in a fiber optic packet switched hypercube
inferredcites →https://doi.org/10.1109/infcom.1991.147478openalex-snapshot
Multihop lightwave networks: a comparison of store-and-forward and hot-potato routing
inferredcites →https://doi.org/10.1109/infcom.1991.147615openalex-snapshot
Performance analysis of multihop lightwave networks with hot potato routing and distance-age-priorities
inferredcites →https://doi.org/10.1109/istcs.1995.377049openalex-snapshot
Observations on hot potato routing
inferredcites →https://doi.org/10.1109/istcs.1995.377050openalex-snapshot
Randomized single-target hot-potato routing
inferredcites →https://doi.org/10.1109/sfcs.1992.267796openalex-snapshot
Exact analysis of hot-potato routing
inferredcites →https://doi.org/10.1109/tcom.1964.1088883openalex-snapshot
On Distributed Communications Networks
inferredcites →https://doi.org/10.1117/12.932535openalex-snapshot
Architecture And Applications Of The HEP Multiprocessor Computer System
inferredcites →https://doi.org/10.1145/164051.164062openalex-snapshot
Fast deflection routing for packets and worms
inferredcites →https://doi.org/10.1145/165231.376321openalex-snapshot
Hot-potato routing on processor arrays
inferredcites →https://doi.org/10.1145/197917.198098openalex-snapshot
Potential function analysis of greedy hot-potato routing
inferredcites →https://doi.org/10.1145/72935.72936openalex-snapshot
A framework for adaptive routing in multicomputer networks
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.1996.0811openalex-snapshot
Randomized Single-Target Hot-Potato Routing
inferred← citeshttps://doi.org/10.1007/3-540-44520-x_122openalex-snapshot
Experimental Evaluation of Hot—Potato Routing Algorithms on 2—Dimensional Processor Arrays
inferred← citeshttps://doi.org/10.1007/3-540-45941-3_20openalex-snapshot
Messages, Clocks, and Gravitation
inferred← citeshttps://doi.org/10.1007/3-540-61680-2_76openalex-snapshot
A lower bound for nearly minimal adaptive and hot potato algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4757-2791-3_11openalex-snapshot
Bounds and Analysis Techniques for Greedy Hot-Potato Routing
inferred← citeshttps://doi.org/10.1007/978-3-540-25946-6_10openalex-snapshot
Competition, Cooperation, and Authorization
inferred← citeshttps://doi.org/10.1007/978-3-540-31833-0_20openalex-snapshot
Universal Bufferless Routing
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_5openalex-snapshot
A New Bound for Pure Greedy Hot Potato Routing
inferred← citeshttps://doi.org/10.1007/978-3-540-79228-4_20openalex-snapshot
Deterministic Hot-Potato Permutation Routing on the Mesh and the Torus
inferred← citeshttps://doi.org/10.1007/bfb0049423openalex-snapshot
Greedy hot-potato routing on the mesh
inferred← citeshttps://doi.org/10.1007/pl00009219openalex-snapshot
A Lower Bound for Nearly Minimal Adaptive and Hot Potato Algorithms
inferred← citeshttps://doi.org/10.1007/s00224-002-1001-6openalex-snapshot
Scheduling Time-Constrained Communication in Linear Networks
inferred← citeshttps://doi.org/10.1007/s00224-004-1136-8openalex-snapshot
Õ(Congestion + Dilation) Hot-Potato Routing on Leveled Networks
inferred← citeshttps://doi.org/10.1007/s002240000076openalex-snapshot
Potential Function Analysis of Greedy Hot-Potato Routing
inferred← citeshttps://doi.org/10.1007/s004460050005openalex-snapshot
Networks on which hot-potato routing does not livelock
inferred← citeshttps://doi.org/10.1016/j.jpdc.2007.06.005openalex-snapshot
Efficient bufferless packet switching on trees and leveled networks
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00049-2openalex-snapshot
Many-to-many routing on trees via matchings
inferred← citeshttps://doi.org/10.1093/comjnl/45.4.423openalex-snapshot
Lower Bounds for One-to-one Packet Routing on Trees using Hot-Potato Algorithms
inferred← citeshttps://doi.org/10.1109/71.595575openalex-snapshot
Deterministic many-to-many hot potato routing
inferred← citeshttps://doi.org/10.1109/icccn.2015.7288475openalex-snapshot
Tight Bounds on Localized Sensor Self-Deployment for Focused Coverage
inferred← citeshttps://doi.org/10.1109/iros.2015.7354108openalex-snapshot
Tight analysis of a collisionless robot gathering algorithm
inferred← citeshttps://doi.org/10.1109/ispan.2000.900283openalex-snapshot
Greedy dynamic hot-potato routing on arrays
inferred← citeshttps://doi.org/10.1109/istcs.1995.377049openalex-snapshot
Observations on hot potato routing
inferred← citeshttps://doi.org/10.1109/istcs.1995.377050openalex-snapshot
Randomized single-target hot-potato routing
inferred← citeshttps://doi.org/10.1109/soccon.2009.5398048openalex-snapshot
Generic routing rules and a scalable access enhancement for the Network-on-Chip RECONNECT
inferred← citeshttps://doi.org/10.1137/050642095openalex-snapshot
Universal Bufferless Packet Switching
inferred← citeshttps://doi.org/10.1142/s0129626403001112openalex-snapshot
A SELF-STABILIZING PHASE SYNCHRONIZATION PROTOCOL
inferred← citeshttps://doi.org/10.1145/197917.198098openalex-snapshot
Potential function analysis of greedy hot-potato routing
inferred← citeshttps://doi.org/10.1145/277651.277693openalex-snapshot
Scheduling time-constrained communication in linear networks
inferred← citeshttps://doi.org/10.1145/3056460openalex-snapshot
Tight Analysis of a Collisionless Robot Gathering Algorithm
inferred← citeshttps://doi.org/10.1145/564870.564874openalex-snapshot
Õ(congestion + dilation) hot-potato routing on leveled networks
inferred← citeshttps://doi.org/10.13140/rg.2.1.4369.9286openalex-snapshot
RECONNECT: A flexible Router Architecture for Network-on-Chips
inferred← citeshttps://doi.org/10.5555/338219.338592openalex-snapshot
Randomized greedy hot-potato routing
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.