On the public citation graph

Fast algorithms for bit-serial routing on a hypercube

https://doi.org/10.1007/bf02090402

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.1002/j.1538-7305.1950.tb00463.xopenalex-snapshot

Error Detecting and Error Correcting Codes

inferredcites →https://doi.org/10.1006/jagm.1994.1030openalex-snapshot

Randomized Routing and Sorting on Fixed-Connection Networks

inferredcites →https://doi.org/10.1007/bf02579338openalex-snapshot

Sorting inc logn parallel steps

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/0376-5075(79)90032-1openalex-snapshot

Virtual cut-through: A new computer communication switching technique

inferredcites →https://doi.org/10.1109/fscs.1990.89545openalex-snapshot

A (fairly) simple circuit that (usually) sorts

inferredcites →https://doi.org/10.1109/sfcs.1987.32openalex-snapshot

How to emulate shared memory

inferredcites →https://doi.org/10.1109/sfcs.1988.21942openalex-snapshot

Universal packet routing algorithms

inferredcites →https://doi.org/10.1109/tc.1982.1675960openalex-snapshot

Parallel Algorithms to Set Up the Benes Permutation Network

inferredcites →https://doi.org/10.1109/tc.1987.1676939openalex-snapshot

Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

inferredcites →https://doi.org/10.1137/0211027openalex-snapshot

A Scheme for Fast Parallel Communication

inferredcites →https://doi.org/10.1145/100216.100232openalex-snapshot

On-line algorithms for path selection in a nonblocking network

inferredcites →https://doi.org/10.1145/100216.100240openalex-snapshot

Deterministic sorting in nearly logarithmic time on the hypercube and related computers

inferredcites →https://doi.org/10.1145/113379.113391openalex-snapshot

Coding theory, hypercube embeddings, and fault tolerance

inferredcites →https://doi.org/10.1145/1468075.1468121openalex-snapshot

Sorting networks and their applications

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/73007.73030openalex-snapshot

An O (log N ) deterministic packet routing scheme

inferredcites →https://doi.org/10.1145/73007.73031openalex-snapshot

Fast computation using faulty hypercubes

inferredcites →https://doi.org/10.1145/800220.806682openalex-snapshot

Efficient schemes for parallel communication

inferredcites →https://doi.org/10.1145/800220.806683openalex-snapshot

Randomized parallel communication (Preliminary Version)

inferredcites →https://doi.org/10.1145/97444.97453openalex-snapshot

Tight bounds for oblivious routing in the hypercube

inferredcites →https://doi.org/10.1145/97444.97457openalex-snapshot

Routing multiple paths in hypercubes

inferredcites →https://doi.org/10.21236/ada204273openalex-snapshot

Universal Packet Routing Algorithms

inferredcites →https://doi.org/10.21236/ada211910openalex-snapshot

Fast Computation Using Faulty Hypercubes

inferredcites →https://doi.org/10.2307/2003526openalex-snapshot

Mathematical Theory of Connecting Networks and Telephone Traffic

inferredcites →https://doi.org/10.2307/2343633openalex-snapshot

Mathematical Theory of Connecting Networks and Telephone Traffic.

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jcss.2000.1701openalex-snapshot

On the Benefit of Supporting Virtual Channels in Wormhole Routers

inferred← citeshttps://doi.org/10.1006/jpdc.1998.1483openalex-snapshot

Packet Routing in Fixed-Connection Networks: A Survey

inferred← citeshttps://doi.org/10.1007/3-540-57568-5_246openalex-snapshot

Adaptive and oblivious algorithms for d-cube permutation routing

inferred← citeshttps://doi.org/10.1007/978-3-540-27821-4_2openalex-snapshot

Simultaneous Source Location

inferred← citeshttps://doi.org/10.1007/bf01192690openalex-snapshot

Flit-Serial Packet Routing on Meshes and Tori

inferred← citeshttps://doi.org/10.1007/bf02090404openalex-snapshot

Routing multiple paths in hypercubes

inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00214-0openalex-snapshot

Communication in the two-way listen-in vertex-disjoint paths mode

inferred← citeshttps://doi.org/10.1109/12.506427openalex-snapshot

On bufferless routing of variable length messages in leveled networks

inferred← citeshttps://doi.org/10.1109/71.588603openalex-snapshot

Circuit switching with input queuing: an analysis for the d-dimensional wraparound mesh and the hypercube

inferred← citeshttps://doi.org/10.1109/aispas.1995.401359openalex-snapshot

A journey into multicomputer routing algorithms

inferred← citeshttps://doi.org/10.1109/apccas.2014.7032875openalex-snapshot

An extended framework for worst-case throughput analysis with router constraint

inferred← citeshttps://doi.org/10.1109/icpp.2002.1040860openalex-snapshot

Hypercube network fault tolerance: a probabilistic approach

inferred← citeshttps://doi.org/10.1109/l-ca.2002.12openalex-snapshot

Worst-case Traffic for Oblivious Routing Functions

inferred← citeshttps://doi.org/10.1109/sfcs.1992.267795openalex-snapshot

A theory of wormhole routing in parallel computers

inferred← citeshttps://doi.org/10.1109/sfcs.1994.365675openalex-snapshot

On-line admission control and circuit routing for high performance computing and communication

inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181881openalex-snapshot

Minimizing congestion in general networks

inferred← citeshttps://doi.org/10.1137/s0097539791221499openalex-snapshot

On-Line Algorithms for Path Selection in a Nonblocking Network

inferred← citeshttps://doi.org/10.1137/s0097539793252870openalex-snapshot

Optimal Group Gossiping in Hypercubes under a Circuit-Switching Model

inferred← citeshttps://doi.org/10.1137/s0097539794268406openalex-snapshot

Hypercubic Sorting Networks

inferred← citeshttps://doi.org/10.1137/s0097539796311818openalex-snapshot

Simple Algorithms for Routing on Butterfly Networks with Bounded Queues

inferred← citeshttps://doi.org/10.1137/s0097539798332464openalex-snapshot

Hamming Codes, Hypercube Embeddings, and Fault Tolerance

inferred← citeshttps://doi.org/10.1142/s0219265905001290openalex-snapshot

Hypercube Network Fault Tolerance: A Probabilistic Approach

inferred← citeshttps://doi.org/10.1145/100216.100232openalex-snapshot

On-line algorithms for path selection in a nonblocking network

inferred← citeshttps://doi.org/10.1145/129712.129728openalex-snapshot

Simple algorithms for routing on butterfly networks with bounded queues

inferred← citeshttps://doi.org/10.1145/1644015.1644031openalex-snapshot

Simultaneous source location

inferred← citeshttps://doi.org/10.1145/167088.167237openalex-snapshot

How much can hardware help routing?

inferred← citeshttps://doi.org/10.1145/225058.225133openalex-snapshot

Bounding delays in packet-routing networks

inferred← citeshttps://doi.org/10.1145/237502.237517openalex-snapshot

On the benefit of supporting virtual channels in wormhole routers

inferred← citeshttps://doi.org/10.1145/265910.265922openalex-snapshot

How much can hardware help routing?

inferred← citeshttps://doi.org/10.1145/3618260.3649608openalex-snapshot

Breaking the VLB Barrier for Oblivious Reconfigurable Networks

inferred← citeshttps://doi.org/10.1145/3749740.3749758openalex-snapshot

Routing to Random Intermediate Destinations

inferred← citeshttps://doi.org/10.1145/564870.564872openalex-snapshot

Worst-case traffic for oblivious routing functions

inferred← citeshttps://doi.org/10.1145/777412.777444openalex-snapshot

Throughput-centric routing algorithm design

inferred← citeshttps://doi.org/10.1145/97444.97457openalex-snapshot

Routing multiple paths in hypercubes

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.