On the public citation graph
Tight bounds for oblivious routing in the hypercube
0 signed · 58 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/bf01840387openalex-snapshot
An optimal time bound for oblivious routing
inferredcites →https://doi.org/10.1007/bf02960735openalex-snapshot
Über drei kombinatorische Probleme amn-dimensionalen Würfel und Würfelgitter
inferredcites →https://doi.org/10.1016/0010-4485(85)90134-4openalex-snapshot
Computational aspects of VLSI
inferredcites →https://doi.org/10.1016/0012-365x(82)90163-7openalex-snapshot
Decomposition de la somme cartesienne d'un cycle et de l'union de deux cycles hamiltoniens en cycles hamiltoniens
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/0022-0000(91)90017-yopenalex-snapshot
Oblivious routing with limited buffer capacity
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1137/0211027openalex-snapshot
A Scheme for Fast Parallel Communication
inferredcites →https://doi.org/10.1145/113379.113391openalex-snapshot
Coding theory, hypercube embeddings, and fault tolerance
inferredcites →https://doi.org/10.1145/3749740.3749751openalex-snapshot
Universal Schemes for Parallel Communication
inferredcites →https://doi.org/10.1145/62044.62050openalex-snapshot
Efficient dispersal of information for security, load balancing, and fault tolerance
inferredcites →https://doi.org/10.1145/62212.62221openalex-snapshot
A time-randomness tradeoff for oblivious routing
inferredcites →https://doi.org/10.1145/800220.806683openalex-snapshot
Randomized parallel communication (Preliminary Version)
inferredcites →https://doi.org/10.1145/828.1892openalex-snapshot
Efficient Schemes for Parallel Communication
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.0001openalex-snapshot
Time-Randomness Trade-offs in Parallel Computation
inferred← citeshttps://doi.org/10.1006/jagm.2000.1152openalex-snapshot
A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes
inferred← citeshttps://doi.org/10.1006/jagm.2001.1176openalex-snapshot
An O(N) Oblivious Routing Algorithm for Two-Dimensional Meshes of Constant 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.1999.1597openalex-snapshot
Oblivious Routing Algorithms on the Mesh of Buses
inferred← citeshttps://doi.org/10.1007/3-540-48481-7_6openalex-snapshot
Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_230openalex-snapshot
Towards a better understanding of pure packet routing
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-63397-9_22openalex-snapshot
Three-dimensional meshes are less powerful than two-dimensional ones in oblivious routing
inferred← citeshttps://doi.org/10.1007/3-540-68530-8_25openalex-snapshot
New Bounds for Oblivious Mesh Routing
inferred← citeshttps://doi.org/10.1007/978-3-642-02250-0_10openalex-snapshot
Permutation Routing and (ℓ, k)-Routing on Plane Grids
inferred← citeshttps://doi.org/10.1007/978-3-642-03869-3_92openalex-snapshot
A Lower Bound for Oblivious Dimensional Routing
inferred← citeshttps://doi.org/10.1007/978-3-642-61012-7_10openalex-snapshot
Kommunikation in parallelen Rechnernetzen
inferred← citeshttps://doi.org/10.1007/bf01379313openalex-snapshot
Parallel parsing of Tree Adjoining Grammars on the Connection Machine
inferred← citeshttps://doi.org/10.1007/s002240000077openalex-snapshot
Comments on the Oblivious Routing Algorithm of Kaklamanis, Krizanc, and Tsantilas in the Hypercube
inferred← citeshttps://doi.org/10.1007/s004930170007openalex-snapshot
Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90163-5openalex-snapshot
Methods for message routing in parallel machines
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00019-4openalex-snapshot
A d-move local permutation routing for the d-cube
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00279-6openalex-snapshot
Some permutation routing algorithms for low-dimensional hypercubes
inferred← citeshttps://doi.org/10.1109/aispas.1995.401359openalex-snapshot
A journey into multicomputer routing algorithms
inferred← citeshttps://doi.org/10.1109/iccs.2002.1183324openalex-snapshot
Decomposition of modular destination graphs for many-many packet routing in multi-link binary hypercubes
inferred← citeshttps://doi.org/10.1109/icpads.2013.40openalex-snapshot
OutFlank Routing: Increasing Throughput in Toroidal Interconnection Networks
inferred← citeshttps://doi.org/10.1109/ipps.1997.580986openalex-snapshot
Oblivious routing algorithms on the mesh of buses
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548496openalex-snapshot
Deterministic routing with bounded buffers: turning offline into online protocols
inferred← citeshttps://doi.org/10.1137/s0097539794261428openalex-snapshot
On the Value of Coordination in Distributed Decision Making
inferred← citeshttps://doi.org/10.1142/s0219265909002431openalex-snapshot
(ℓ, k)-ROUTING ON PLANE GRIDS
inferred← citeshttps://doi.org/10.1145/167088.167237openalex-snapshot
How much can hardware help routing?
inferred← citeshttps://doi.org/10.1145/265910.265922openalex-snapshot
How much can hardware help routing?
inferred← citeshttps://doi.org/10.1145/3519935.3520020openalex-snapshot
Optimal oblivious reconfigurable networks
inferred← citeshttps://doi.org/10.1145/3583668.3594585openalex-snapshot
Sparse Semi-Oblivious Routing: Few Random Paths Suffice
inferred← citeshttps://doi.org/10.1145/3618260.3649608openalex-snapshot
Breaking the VLB Barrier for Oblivious Reconfigurable Networks
inferred← citeshttps://doi.org/10.1145/3618260.3649678openalex-snapshot
Polylog-Competitive Deterministic Local Routing and Scheduling
inferred← citeshttps://doi.org/10.1145/3749740.3749758openalex-snapshot
Routing to Random Intermediate Destinations
inferred← citeshttps://doi.org/10.1145/380752.380848openalex-snapshot
Almost optimal permutation routing on hypercubes
inferred← citeshttps://doi.org/10.1145/97444.97452openalex-snapshot
The chaos router: a practical application of randomization in network routing
inferred← citeshttps://doi.org/10.20535/2411-1031.2024.12.1.306274openalex-snapshot
Randomized algorithms in systems without coordination and centralization
inferred← citeshttps://doi.org/10.22215/etd/2007-06571openalex-snapshot
Using mobile agents for black hole search with tokens in multi networks
inferred← citeshttps://doi.org/10.4230/lipics.esa.2020.36openalex-snapshot
Compact Oblivious Routing in Weighted Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.0803.2759openalex-snapshot
(l,k)-Routing on Plane Grids
inferred← citeshttps://doi.org/10.7155/jgaa.00038openalex-snapshot
New Bounds for Oblivious Mesh 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.