On the public citation graph
Randomized parallel communications on an extension of the omega network
0 signed · 70 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.1002/j.1538-7305.1982.tb02281.xopenalex-snapshot
An Overview of PANACEA, a Software Package for Analyzing Markovian Queueing Networks
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.1017/s0001867800015858openalex-snapshot
Blocking probabilities in large circuit-switched networks
inferredcites →https://doi.org/10.1017/s0001867800016463openalex-snapshot
Asymptotic analysis and computational methods for a class of simple, circuit-switched networks with blocking
inferredcites →https://doi.org/10.1017/s0001867800020218openalex-snapshot
Sojourn times and the overtaking condition in Jacksonian networks
inferredcites →https://doi.org/10.1017/s000186780002070xopenalex-snapshot
Passage times for overtake-free paths in Gordon–Newell networks
inferredcites →https://doi.org/10.1109/12.8700openalex-snapshot
The distribution of waiting times in clocked multistage interconnection networks
inferredcites →https://doi.org/10.1109/icpp.2002openalex-snapshot
Proceedings International Conference on Parallel Processing
inferredcites →https://doi.org/10.1109/t-c.1975.224157openalex-snapshot
Access and Alignment of Data in an Array Processor
inferredcites →https://doi.org/10.1109/tc.1980.1675553openalex-snapshot
Notes on Shuffle/Exchange-Type Switching Networks
inferredcites →https://doi.org/10.1109/tc.1983.1676201openalex-snapshot
The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel Computer
inferredcites →https://doi.org/10.1109/tcom.1979.1094270openalex-snapshot
Approximate Analysis of General Queuing Networks by Decomposition
inferredcites →https://doi.org/10.1137/0211027openalex-snapshot
A Scheme for Fast Parallel Communication
inferredcites →https://doi.org/10.1145/828.1883openalex-snapshot
An End-to-End Approach to the Resequencing Problem
inferredcites →https://doi.org/10.1214/aoms/1177728178openalex-snapshot
On the Distribution of the Number of Successes in Independent Trials
inferredcites →https://doi.org/10.1214/aoms/1177729330openalex-snapshot
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
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.3230240206openalex-snapshot
Sharper analysis of packet routing on a butterfly
inferred← citeshttps://doi.org/10.1007/978-1-84882-765-3_2openalex-snapshot
Valiant Load-Balancing: Building Networks That Can Support All Traffic Matrices
inferred← citeshttps://doi.org/10.1007/978-3-319-49019-9_5openalex-snapshot
Permutation-Based Obfuscation
inferred← citeshttps://doi.org/10.1007/978-3-642-86726-2_14openalex-snapshot
Delay and Routing in Interconnection Networks
inferred← citeshttps://doi.org/10.1016/0743-7315(91)90006-uopenalex-snapshot
Analytic models for multistage interconnection networks
inferred← citeshttps://doi.org/10.1016/j.asej.2025.103287openalex-snapshot
An efficient way to represent the processors and their connections in omega networks
inferred← citeshttps://doi.org/10.1016/j.comcom.2008.11.022openalex-snapshot
Closed-form analysis of end-to-end network delay with Markov-modulated Poisson and fluid traffic
inferred← citeshttps://doi.org/10.1016/s0140-3664(01)00427-3openalex-snapshot
Load balanced Birkhoff–von Neumann switches, part I: one-stage buffering
inferred← citeshttps://doi.org/10.1016/s0140-3664(01)00428-5openalex-snapshot
Load balanced Birkhoff–von Neumann switches, part II: multi-stage buffering
inferred← citeshttps://doi.org/10.1109/12.628391openalex-snapshot
Design principles for practical self-routing nonblocking switching networks with O(N·log N) bit-complexity
inferred← citeshttps://doi.org/10.1109/18.61109openalex-snapshot
A calculus for network delay. I. Network elements in isolation
inferred← citeshttps://doi.org/10.1109/18.61110openalex-snapshot
A calculus for network delay. II. Network analysis
inferred← citeshttps://doi.org/10.1109/26.135714openalex-snapshot
Nonblocking property of reverse banyan networks
inferred← citeshttps://doi.org/10.1109/26.168793openalex-snapshot
The statistical data fork: a class of broad-band multichannel switches
inferred← citeshttps://doi.org/10.1109/26.231934openalex-snapshot
PR-banyan: a packet switch with a pseudorandomizer for nonuniform traffic
inferred← citeshttps://doi.org/10.1109/26.328987openalex-snapshot
The efficiency of greedy routing in hypercubes and butterflies
inferred← citeshttps://doi.org/10.1109/26.412727openalex-snapshot
Randomized routing of virtual connections in essentially nonblocking log N-depth networks
inferred← citeshttps://doi.org/10.1109/49.105179openalex-snapshot
Efficient modeling of merging and splitting processes in large networking structures
inferred← citeshttps://doi.org/10.1109/5.21080openalex-snapshot
Distributed routing for load balancing
inferred← citeshttps://doi.org/10.1109/71.273044openalex-snapshot
Partitioning message patterns for bundled omega networks
inferred← citeshttps://doi.org/10.1109/71.494630openalex-snapshot
Randomized routing with shorter paths
inferred← citeshttps://doi.org/10.1109/71.97906openalex-snapshot
Using the dual path property of omega networks to obtain conflict-free message routing
inferred← citeshttps://doi.org/10.1109/92.238419openalex-snapshot
The selective extra stage butterfly
inferred← citeshttps://doi.org/10.1109/glocom.2007.499openalex-snapshot
Statistical Traffic Envelopes for Markov-Modulated Poisson Packet Sources
inferred← citeshttps://doi.org/10.1109/icc.1990.117179openalex-snapshot
Analysis, control and design of crossbar and banyan based broadband packet switches, for integrated traffic
inferred← citeshttps://doi.org/10.1109/icc.1991.162399openalex-snapshot
PR-banyan: a packet switch with a pseudo randomizer for nonuniform traffic
inferred← citeshttps://doi.org/10.1109/iccd.1992.276326openalex-snapshot
The selective extra-stage butterfly
inferred← citeshttps://doi.org/10.1109/icpads.1997.652536openalex-snapshot
Performance of the r-truncated Benes networks under randomized routing algorithms
inferred← citeshttps://doi.org/10.1109/infcom.1991.147593openalex-snapshot
Packet routing in optimal time on a butterfly
inferred← citeshttps://doi.org/10.1109/infcom.2003.1209185openalex-snapshot
Providing guaranteed rate services in the load balanced Birkhoff-von Neumann switches
inferred← citeshttps://doi.org/10.1109/infcom.2007.54openalex-snapshot
Queuing Delays in Randomized Load Balanced Networks
inferred← citeshttps://doi.org/10.1109/infcom.2013.6566857openalex-snapshot
Shortest path versus multi-hub routing in networks with uncertain demand
inferred← citeshttps://doi.org/10.1109/superc.1990.130029openalex-snapshot
Design and analysis of buffered crossbars and banyans with cut-through switching
inferred← citeshttps://doi.org/10.1109/tnet.2006.876202openalex-snapshot
Providing guaranteed rate services in the load balanced Birkhoff-von Neumann switches
inferred← citeshttps://doi.org/10.1109/tnet.2014.2353576openalex-snapshot
Shortest Path Versus Multihub Routing in Networks With Uncertain Demand
inferred← citeshttps://doi.org/10.1145/107971.107979openalex-snapshot
A Markov chain approximation for the analysis of banyan networks
inferred← citeshttps://doi.org/10.1145/107972.107979openalex-snapshot
A Markov chain approximation for the analysis of banyan networks
inferred← citeshttps://doi.org/10.1145/113379.113402openalex-snapshot
The efficiency of greedy routing in hypercubes and butterflies
inferred← citeshttps://doi.org/10.1145/165231.166106openalex-snapshot
Randomized routing with shorter paths
inferred← citeshttps://doi.org/10.1145/174666.174667openalex-snapshot
On randomization in sequential and distributed algorithms
inferred← citeshttps://doi.org/10.1145/29903.29917openalex-snapshot
Reduced distance routing in single-state shuffle-exchange interconnection networks
inferred← citeshttps://doi.org/10.1145/3035482openalex-snapshot
Obfuscation-Based Protection Framework against Printed Circuit Boards Unauthorized Operation and Reverse Engineering
inferred← citeshttps://doi.org/10.1145/3771938openalex-snapshot
PoCo: Extending Task-Parallel HLS Programming with Shared Multi- P r o ducer Multi- Co nsumer Buffer Support
inferred← citeshttps://doi.org/10.1145/96559.96599openalex-snapshot
The representation of multistage interconnection networks in queuing models of parallel systems
inferred← citeshttps://doi.org/10.1147/rd.351.0288openalex-snapshot
Traffic studies of unbuffered Delta networks
inferred← citeshttps://doi.org/10.1364/jon.5.000320openalex-snapshot
Selective randomized load balancing and mesh networks with changing demands
inferred← citeshttps://doi.org/10.48550/arxiv.1302.7028openalex-snapshot
Shortest Path versus Multi-Hub Routing in Networks with Uncertain Demand
inferred← citeshttps://doi.org/10.5555/110382.110444openalex-snapshot
Design and analysis of buffered crossbars and banyans with cut-through switching
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.