On the public citation graph

Hot-potato algorithms for permutation routing

0 signed · 62 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-58325-4_197openalex-snapshot
Fast deterministic Hot-Potato routing on processor arrays
inferredcites →https://doi.org/10.1007/bf02311228openalex-snapshot
Bounds on evacuation time for deflection routing
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/c2013-0-08299-0openalex-snapshot
Introduction to Parallel Algorithms and Architectures
inferredcites →https://doi.org/10.1038/scientificamerican0687-108openalex-snapshot
The Connection Machine
inferredcites →https://doi.org/10.1109/26.142797openalex-snapshot
Deflection routing in hypercube networks
inferredcites →https://doi.org/10.1109/26.212380openalex-snapshot
Sharp approximate models of deflection routing in mesh networks
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/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/12130.12156openalex-snapshot
An optimal sorting algorithm for mesh connected computers
inferredcites →https://doi.org/10.1145/1468075.1468121openalex-snapshot
Sorting networks and their applications
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/72935.72943openalex-snapshot
Load balancing, selection sorting on the hypercube
inferredcites →https://doi.org/10.1184/r1/6608258openalex-snapshot
Parallel neighbor-sort (or the glory of the induction principle)

What points at this work

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

inferred← citeshttps://doi.org/10.1002/net.20325openalex-snapshot
Optimal permutation routing for low‐dimensional hypercubes
inferred← citeshttps://doi.org/10.1006/inco.2000.3004openalex-snapshot
Optimal Deterministic Protocols for Mobile Robots on a Grid
inferred← citeshttps://doi.org/10.1006/jagm.1996.0811openalex-snapshot
Randomized Single-Target Hot-Potato Routing
inferred← citeshttps://doi.org/10.1006/jpdc.1996.0052openalex-snapshot
Minimal Adaptive Routing on the Mesh with Bounded Queue Size
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1483openalex-snapshot
Packet Routing in Fixed-Connection Networks: A Survey
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1488openalex-snapshot
Routing Permutations on Graphs via Factors
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-58201-0_91openalex-snapshot
On the theory of interconnection networks for parallel computers
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_197openalex-snapshot
Fast deterministic Hot-Potato routing on processor arrays
inferred← citeshttps://doi.org/10.1007/3-540-61626-8_35openalex-snapshot
Multipacket hot-potato routing on processor arrays
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-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/bf01784239openalex-snapshot
Greedy hot-potato routing on the two-dimensional mesh
inferred← citeshttps://doi.org/10.1007/bfb0009504openalex-snapshot
Dynamic tree routing under the “matching with consumption” model
inferred← citeshttps://doi.org/10.1007/bfb0049423openalex-snapshot
Greedy hot-potato routing on the mesh
inferred← citeshttps://doi.org/10.1007/bfb0049424openalex-snapshot
Desnakification of mesh sorting algorithms
inferred← citeshttps://doi.org/10.1007/bfb0054366openalex-snapshot
Optimal deterministic protocols for mobile robots on a grid
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-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/s0065-2458(08)60287-9openalex-snapshot
Managing Control Asynchrony on SIMD Machines—a Survey
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/infcom.1995.515924openalex-snapshot
Scheduled hot-potato routing
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.377050openalex-snapshot
Randomized single-target hot-potato routing
inferred← citeshttps://doi.org/10.1109/tc.2013.141openalex-snapshot
Bufferless Routing in Optical Gaussian Macrochip Interconnect
inferred← citeshttps://doi.org/10.1137/050642095openalex-snapshot
Universal Bufferless Packet Switching
inferred← citeshttps://doi.org/10.1145/181014.181451openalex-snapshot
Minimal adaptive routing on the mesh with bounded queue size
inferred← citeshttps://doi.org/10.1145/197917.198098openalex-snapshot
Potential function analysis of greedy hot-potato routing
inferred← citeshttps://doi.org/10.1145/335305.338762openalex-snapshot
Hard-Potato routing
inferred← citeshttps://doi.org/10.1145/564870.564874openalex-snapshot
Õ(congestion + dilation) hot-potato routing on leveled networks
inferred← citeshttps://doi.org/10.5281/zenodo.193678openalex-snapshot
FIGURE 20. Grammacephalus indicus Viraktamath, a in The Deltocephalinae leafhoppers of Pakistan (Hemiptera, Cicadellidae)
inferred← citeshttps://doi.org/10.5555/338219.338592openalex-snapshot
Randomized greedy hot-potato routing
inferred← citeshttps://doi.org/10.7155/jgaa.00007openalex-snapshot
Scheduled Hot-Potato Routing
showing the first 40 of 41 · page through all 41
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.