On the public citation graph
A Scheme for Fast Parallel Communication
0 signed · 610 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.1016/0022-0000(79)90045-xopenalex-snapshot
Fast probabilistic algorithms for hamiltonian circuits and matchings
inferredcites →https://doi.org/10.1109/mc.1979.1658780openalex-snapshot
Interconnection Networks for SIMD Machines
inferredcites →https://doi.org/10.1109/tc.1981.6312171openalex-snapshot
A fast parallel algorithm for routing in permutation networks
inferredcites →https://doi.org/10.1137/0206006openalex-snapshot
A Fast Monte-Carlo Test for Primality
inferredcites →https://doi.org/10.1145/1468075.1468121openalex-snapshot
Sorting networks and their applications
inferredcites →https://doi.org/10.1145/321450.321465openalex-snapshot
Corrigendum: `` A Permutation Network''
inferredcites →https://doi.org/10.1145/3749740.3749751openalex-snapshot
Universal Schemes for Parallel Communication
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
inferredcites →https://doi.org/10.2307/2003526openalex-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.1002/047134608x.w5318.pub2openalex-snapshot
Network Design: Algorithms and Examples
inferred← citeshttps://doi.org/10.1002/047134608x.w5318.pub3openalex-snapshot
Network Design: Algorithms and Examples
inferred← citeshttps://doi.org/10.1002/cpe.4065openalex-snapshot
A fault‐tolerant routing strategy fork‐aryn‐directs‐indirect topologies based on intermediate nodes
inferred← citeshttps://doi.org/10.1002/cpe.4440openalex-snapshot
Non‐minimal adaptive routing based on explicit congestion notifications
inferred← citeshttps://doi.org/10.1002/cpe.4441openalex-snapshot
Head‐of‐line blocking avoidance in Slim Fly networks using deadlock‐free non‐minimal and adaptive routing
inferred← citeshttps://doi.org/10.1002/cpe.4784openalex-snapshot
On the effects of allocation strategies for exascale computing systems with distributed storage and unified interconnects
inferred← citeshttps://doi.org/10.1002/net.3230190606openalex-snapshot
On the construction of minimal broadcast networks
inferred← citeshttps://doi.org/10.1002/net.3230210303openalex-snapshot
The generalized folding‐cube network
inferred← citeshttps://doi.org/10.1002/net.3230220606openalex-snapshot
Scheduling file transfers in fully connected networks
inferred← citeshttps://doi.org/10.1002/net.3230230420openalex-snapshot
Routing permutations on a graph
inferred← citeshttps://doi.org/10.1002/net.3230230424openalex-snapshot
Off‐line permutation routing on circuit‐switched fixed‐routing networks
inferred← citeshttps://doi.org/10.1002/nme.1620290414openalex-snapshot
Data structures and algorithms for the finite element method on a data parallel supercomputer
inferred← citeshttps://doi.org/10.1006/jagm.1994.1030openalex-snapshot
Randomized Routing and Sorting on Fixed-Connection Networks
inferred← citeshttps://doi.org/10.1006/jagm.1995.1042openalex-snapshot
k-k Routing, k-k Sorting, and Cut-Through Routing on the Mesh
inferred← citeshttps://doi.org/10.1006/jagm.1996.0001openalex-snapshot
Time-Randomness Trade-offs in Parallel Computation
inferred← citeshttps://doi.org/10.1006/jagm.1998.0980openalex-snapshot
Shortest-Path Routing in Arbitrary Networks
inferred← citeshttps://doi.org/10.1006/jcss.1996.0053openalex-snapshot
Towards Structured Parallel Computing on Architecture-Independent Parallel Algorithm Design for Distributed-Memory Architectures
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.1993.1116openalex-snapshot
A Communication Architecture for a Massively Parallel Message-Passing Multicomputer
inferred← citeshttps://doi.org/10.1006/jpdc.1994.1015openalex-snapshot
Packet Routing and PRAM Emulation on Star Graphs and Leveled Networks
inferred← citeshttps://doi.org/10.1006/jpdc.1995.1064openalex-snapshot
A Randomized Algorithm for Multipacket Routing on the Mesh
inferred← citeshttps://doi.org/10.1006/jpdc.1997.1316openalex-snapshot
Random Data Accesses on a Coarse-Grained Parallel Machine I. One-to-One Mappings
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.2000.1659openalex-snapshot
Fully Scalable Fault-Tolerant Simulations for BSP and CGM
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_379openalex-snapshot
Parallel Computing: Complexity Classes
inferred← citeshttps://doi.org/10.1007/11499169_15openalex-snapshot
Designing a Predictable Internet Backbone with Valiant Load-Balancing
inferred← citeshttps://doi.org/10.1007/3-540-18740-5_79openalex-snapshot
Randomized parallel computation
inferred← citeshttps://doi.org/10.1007/3-540-51542-9_43openalex-snapshot
Optimal hypercube algorithms for labeled images
inferred← citeshttps://doi.org/10.1007/3-540-51604-2_1openalex-snapshot
Parallel algorithms and architectures
inferred← citeshttps://doi.org/10.1007/3-540-51859-2_1openalex-snapshot
Randomization in parallel algorithms and its impact on computational geometry
inferred← citeshttps://doi.org/10.1007/3-540-52292-1_1openalex-snapshot
Disjoint paths in the hypercube
inferred← citeshttps://doi.org/10.1007/3-540-56731-3_15openalex-snapshot
An experimental study of wormhole routing in parallel computers
inferred← citeshttps://doi.org/10.1007/3-540-56731-3_9openalex-snapshot
Massively parallel computing: Data distribution and communication
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-57273-2_43openalex-snapshot
On bufferless routing of variable-length messages in leveled networks
inferred← citeshttps://doi.org/10.1007/3-540-58184-7_85openalex-snapshot
Improved probabilistic routing on generalized hypercubes
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-58338-6_60openalex-snapshot
Communication throughput of interconnection networks
inferred← citeshttps://doi.org/10.1007/3-540-58429-3_37openalex-snapshot
ROMM routing: A class of efficient Minimal routing algorithms
inferred← citeshttps://doi.org/10.1007/3-540-59042-0_81openalex-snapshot
A packet routing protocol for arbitrary networks
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_135openalex-snapshot
Beyond the worst-case bisection bound: Fast sorting and ranking on meshes
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-62598-4_78openalex-snapshot
Basic techniques for numerical linear algebra on bulk synchronous parallel computers
inferred← citeshttps://doi.org/10.1007/3-540-64359-1_710openalex-snapshot
Randomized routing and PRAM emulation on parallel machines
inferred← citeshttps://doi.org/10.1007/3-540-64359-1_711openalex-snapshot
On randomized and deterministic schemes for routing and sorting on fixed-connection networks
inferred← citeshttps://doi.org/10.1007/3-540-64359-1_715openalex-snapshot
Randomized algorithms on the mesh
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_113openalex-snapshot
Direct Routing Algorithms
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_498openalex-snapshot
Parallel Computing: Complexity Classes
inferred← citeshttps://doi.org/10.1007/978-0-387-79361-0_5openalex-snapshot
Advances in Oblivious Routing of Internet Traffic
inferred← citeshttps://doi.org/10.1007/978-1-4612-3352-7_32openalex-snapshot
The Information Dispersal Algorithm and its Applications
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_32openalex-snapshot
Randomized Parallel Algorithms for Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4613-0633-7_7openalex-snapshot
Computational Metrics and Fundamental Limits for Parallel Architectures a Survey of Pertinent Research
inferred← citeshttps://doi.org/10.1007/978-1-4613-3282-4openalex-snapshot
Advances in Randomized Parallel Computing
inferred← citeshttps://doi.org/10.1007/978-1-4613-3282-4_4openalex-snapshot
Randomized Algorithms on the Mesh
inferred← citeshttps://doi.org/10.1007/978-1-4613-3282-4_5openalex-snapshot
Efficient Randomized Algorithms for Parallel and Distributed Machines
inferred← citeshttps://doi.org/10.1007/978-1-4613-9668-0_27openalex-snapshot
A Case for Randomized Parallel Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4613-9668-0_39openalex-snapshot
Optimally Universal Parallel Computers
inferred← citeshttps://doi.org/10.1007/978-1-4614-1415-5_1openalex-snapshot
High Performance Network Architectures for Data Intensive Computing
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_9openalex-snapshot
The Power of Two Random Choices: A Survey of Techniques and Results
inferred← citeshttps://doi.org/10.1007/978-1-4615-3752-6_1openalex-snapshot
VLSI Design of a 3-D Highly Parallel Message-Passing Architecture
inferred← citeshttps://doi.org/10.1007/978-1-4684-5511-3_11openalex-snapshot
Randomized Parallel Computation
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_113openalex-snapshot
Direct Routing Algorithms
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-031-68382-4_14openalex-snapshot
Cryptanalysis of Algebraic Verifiable Delay Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-32467-8_61openalex-snapshot
Design of a Deadlock-Free XY-YX Router for Network-on-Chip
inferred← citeshttps://doi.org/10.1007/978-3-319-59647-1_23openalex-snapshot
Monitorability Bounds via Expander, Sparsifier and Random Walks
inferred← citeshttps://doi.org/10.1007/978-3-319-72971-8_7openalex-snapshot
Modeling UGAL on the Dragonfly Topology
inferred← citeshttps://doi.org/10.1007/978-3-319-89884-1_5openalex-snapshot
An Assertion-Based Program Logic for Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-99996-8_7openalex-snapshot
On Transforming Unit Cube into Tree by One-Point Mutation
inferred← citeshttps://doi.org/10.1007/978-3-540-24596-4_16openalex-snapshot
A Hierarchical Routing Method for Load-Balancing
inferred← citeshttps://doi.org/10.1007/978-3-540-30140-0_14openalex-snapshot
Direct Routing: Algorithms and Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-30141-7_49openalex-snapshot
A Fully Adaptive Fault-Tolerant Routing Methodology Based on Intermediate Nodes
inferred← citeshttps://doi.org/10.1007/978-3-540-30474-6_49openalex-snapshot
A New Adaptive Fault-Tolerant Routing Methodology for Direct Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-74450-4_44openalex-snapshot
A New Load Balanced Routing Algorithm for Torus Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-74823-6_15openalex-snapshot
TOLB: A Traffic-Oblivious Load-Balancing Protocol for Next-Generation Sensornets
inferred← citeshttps://doi.org/10.1007/978-3-540-76837-1_43openalex-snapshot
rHALB: A New Load-Balanced Routing Algorithm for k-ary n-cube Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-77294-1_3openalex-snapshot
Valiant Load Balancing, Capacity Provisioning and Resilient Backbone Design
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-14849-1_13openalex-snapshot
Oblivious Routing for Sensor Network Topologies
inferred← citeshttps://doi.org/10.1007/978-3-642-15291-7_40openalex-snapshot
A First Approach to King Topologies for On-Chip Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-15291-7_41openalex-snapshot
Optimizing Matrix Transpose on Torus Interconnects
inferred← citeshttps://doi.org/10.1007/978-3-642-17653-1_18openalex-snapshot
SkewCCC+: A Heterogeneous Distributed Hash Table
inferred← citeshttps://doi.org/10.1007/978-3-642-29222-4_30openalex-snapshot
Optimal Oblivious Routing in Hole-Free Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-54353-1_4openalex-snapshot
Satellite Network Traffic Engineering
inferred← citeshttps://doi.org/10.1007/978-3-642-58054-3_11openalex-snapshot
Systeme mit gemeinsamem Speicher
inferred← citeshttps://doi.org/10.1007/978-3-642-76309-0_2openalex-snapshot
Überblick über PRAM-Simulationen und ihre Realisierbarkeit
inferred← citeshttps://doi.org/10.1007/978-3-642-77225-2_16openalex-snapshot
Towards Parallel Processing of Multisensed Data
inferred← citeshttps://doi.org/10.1007/978-3-642-77422-5_16openalex-snapshot
Communication Performance of Advanced Transputer Networks for Universal Message-Passing
inferred← citeshttps://doi.org/10.1007/978-3-642-86726-2_14openalex-snapshot
Delay and Routing in Interconnection Networks
inferred← citeshttps://doi.org/10.1007/978-3-662-12521-2openalex-snapshot
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
inferred← citeshttps://doi.org/10.1007/978-3-662-12788-9_3openalex-snapshot
An Overview of Randomized Algorithms
inferred← citeshttps://doi.org/10.1007/978-94-007-1679-7_5openalex-snapshot
Energy-Aware On-Chip Networks
inferred← citeshttps://doi.org/10.1007/978-981-95-7134-5_11openalex-snapshot
An Adaptive Ant Colony Optimization for Solving Oblivious Routing Problem
inferred← citeshttps://doi.org/10.1007/bf00155858openalex-snapshot
Simulating parallel neighboring communications among square meshes and square toruses
inferred← citeshttps://doi.org/10.1007/bf00619508openalex-snapshot
Design trade-offs in optoelectronic parallel processing systems using smart-SLMs
inferred← citeshttps://doi.org/10.1007/bf01200118openalex-snapshot
Bounds on tradeoffs between randomness and communication complexity
inferred← citeshttps://doi.org/10.1007/bf01758753openalex-snapshot
Optimal randomized parallel algorithms for computational geometry
inferred← citeshttps://doi.org/10.1007/bf01758834openalex-snapshot
Optimal routing algorithms for mesh-connected processor arrays
inferred← citeshttps://doi.org/10.1007/bf01762110openalex-snapshot
Communication-efficient parallel algorithms for distributed random-access machines
inferred← citeshttps://doi.org/10.1007/bf02090400openalex-snapshot
Tight bounds for oblivious routing in the hypercube
inferred← citeshttps://doi.org/10.1007/bf02090402openalex-snapshot
Fast algorithms for bit-serial routing on a hypercube
inferred← citeshttps://doi.org/10.1007/bf02090403openalex-snapshot
Fast fault-tolerant parallel communication and on-line maintenance for hypercubes using information dispersal
inferred← citeshttps://doi.org/10.1007/bf02125897openalex-snapshot
Constructing disjoint paths on expander graphs
inferred← citeshttps://doi.org/10.1007/bf02943130openalex-snapshot
Reliable communication on cube-based multicomputers
inferred← citeshttps://doi.org/10.1007/bfb0012790openalex-snapshot
On the power of probabilistic choice in synchronous parallel computations
inferred← citeshttps://doi.org/10.1007/bfb0032918openalex-snapshot
The next generation transputers and beyond
inferred← citeshttps://doi.org/10.1007/bfb0032951openalex-snapshot
OAL: An implementation of an actor language on a massively parallel message-passing architecture
inferred← citeshttps://doi.org/10.1007/bfb0040408openalex-snapshot
Optimal routing algorithms for mesh-connected processor arrays
inferred← citeshttps://doi.org/10.1007/s00182-018-0622-1openalex-snapshot
Compromises and Rewards: stable and non-manipulable probabilistic matching
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-008-9099-9openalex-snapshot
Towards a Scalable and Robust DHT
inferred← citeshttps://doi.org/10.1007/s002240010006openalex-snapshot
Efficient Communication Strategies for Ad Hoc Wireless Networks
inferred← citeshttps://doi.org/10.1007/s00453-005-1189-3openalex-snapshot
Direct routing: Algorithms and complexity
inferred← citeshttps://doi.org/10.1007/s004930170007openalex-snapshot
Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols
inferred← citeshttps://doi.org/10.1007/s10617-014-9133-xopenalex-snapshot
Randomizing task placement and route selection do not randomize traffic (enough)
inferred← citeshttps://doi.org/10.1007/s10766-015-0393-2openalex-snapshot
HyperFatTree: A Large-Scale Tree-Based Network with Low-Radix Switches
inferred← citeshttps://doi.org/10.1007/s11227-014-1357-9openalex-snapshot
On-the-fly adaptive routing for dragonfly interconnection networks
inferred← citeshttps://doi.org/10.1007/s11227-016-1758-zopenalex-snapshot
Network unfairness in dragonfly topologies
inferred← citeshttps://doi.org/10.1007/s11227-021-03667-xopenalex-snapshot
A methodology to enable QoS provision on InfiniBand hardware
inferred← citeshttps://doi.org/10.1007/s11227-022-04926-1openalex-snapshot
Congestion management in high-performance interconnection networks using adaptive routing notifications
inferred← citeshttps://doi.org/10.1007/s11227-025-08083-zopenalex-snapshot
Path congestion detection and disjoint path for improving communication efficiency in dragonfly interconnection networks
inferred← citeshttps://doi.org/10.1007/s11460-009-0048-4openalex-snapshot
A self-adaptive key flow routing adjustment algorithm
inferred← citeshttps://doi.org/10.1007/s11704-016-5431-8openalex-snapshot
A survey of routing algorithm for mesh Network-on-Chip
inferred← citeshttps://doi.org/10.1007/s11856-023-2498-4openalex-snapshot
Good permutation codes based on the shuffle-exchange network
inferred← citeshttps://doi.org/10.1016/0010-4655(89)90195-1openalex-snapshot
Parallel algorithms and architectures
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00134-xopenalex-snapshot
A real-time algorithm for the (n2 − 1)-puzzle
inferred← citeshttps://doi.org/10.1016/0022-0000(91)90017-yopenalex-snapshot
Oblivious routing with limited buffer capacity
inferred← citeshttps://doi.org/10.1016/0022-0000(92)90030-mopenalex-snapshot
Embedding grids into hypercubes
inferred← citeshttps://doi.org/10.1016/0022-2496(87)90016-2openalex-snapshot
Computing with connections
inferred← citeshttps://doi.org/10.1016/0045-7825(92)90124-3openalex-snapshot
A data parallel finite element method for computational fluid dynamics on the Connection Machine system
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90136-xopenalex-snapshot
Analysis of minimal path routing schemes in the presence of faults
inferred← citeshttps://doi.org/10.1016/0167-739x(92)90029-bopenalex-snapshot
Workstation hardware and software support for parallel applications
inferred← citeshttps://doi.org/10.1016/0167-8191(94)90050-7openalex-snapshot
Parallel supercomputer architectures and their programming models
inferred← citeshttps://doi.org/10.1016/0168-9002(96)00195-7openalex-snapshot
Triggering and event building results using the C104 packet routing chip
inferred← citeshttps://doi.org/10.1016/0168-9274(93)90037-ropenalex-snapshot
Parallel methods for initial value problems
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90099-6openalex-snapshot
Communication aspects of networks based on geometric incidence relations
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00041-0openalex-snapshot
Randomized routing on generalized hypercubes
inferred← citeshttps://doi.org/10.1016/0743-7315(90)90006-bopenalex-snapshot
Nonuniform traffic spots (NUTS) in multistage interconnection networks
inferred← citeshttps://doi.org/10.1016/0743-7315(90)90026-lopenalex-snapshot
Intensive hypercube communication Prearranged communication in link-bound machines
inferred← citeshttps://doi.org/10.1016/0743-7315(91)90002-qopenalex-snapshot
Performance modeling of distributed memory architectures
inferred← citeshttps://doi.org/10.1016/0890-5401(87)90031-9openalex-snapshot
A new look at fault-tolerant network routing
inferred← citeshttps://doi.org/10.1016/0893-6080(89)90015-4openalex-snapshot
Relating Boltzmann machines to conventional models of computation
inferred← citeshttps://doi.org/10.1016/0956-0521(92)90095-zopenalex-snapshot
Communication primitives for unstructured finite element simulations on data parallel architectures
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50023-0openalex-snapshot
General Purpose Parallel Architectures
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50019-xopenalex-snapshot
Parallel Computational Geometry: An Approach using Randomization
inferred← citeshttps://doi.org/10.1016/bs.adcom.2021.09.003openalex-snapshot
A power-performance balanced network-on-chip for mixed CPU-GPU systems
inferred← citeshttps://doi.org/10.1016/j.adhoc.2007.01.004openalex-snapshot
Cross-layer adaptive control for wireless mesh networks
inferred← citeshttps://doi.org/10.1016/j.comcom.2013.01.004openalex-snapshot
Disaster survivability in optical communication networks
inferred← citeshttps://doi.org/10.1016/j.comcom.2020.12.018openalex-snapshot
Boosting performance for software defined networks from traffic engineering perspective
inferred← citeshttps://doi.org/10.1016/j.comcom.2023.09.028openalex-snapshot
Random spanning trees for expanders, sparsifiers, and virtual network security
inferred← citeshttps://doi.org/10.1016/j.comnet.2019.07.008openalex-snapshot
Multipath transport and packet spraying for efficient data delivery in data centres
inferred← citeshttps://doi.org/10.1016/j.comnet.2025.111334openalex-snapshot
Improving the performance of Dragonfly networks through restrictive Proxy routing strategies
inferred← citeshttps://doi.org/10.1016/j.comnet.2026.112255openalex-snapshot
D3: Enhancing reconfigurable datacenters with adaptive demand-oblivious and demand-aware integration
inferred← citeshttps://doi.org/10.1016/j.dam.2018.12.005openalex-snapshot
Low time complexity algorithms for path computation in Cayley Graphs
inferred← citeshttps://doi.org/10.1016/j.future.2023.10.010openalex-snapshot
Canary: Congestion-aware in-network allreduce using dynamic trees
inferred← citeshttps://doi.org/10.1016/j.future.2026.108394openalex-snapshot
A message-driven system for processing highly skewed graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2024.106516openalex-snapshot
Leveraging parameterized Chernoff bounds for simplified algorithm analyses
inferred← citeshttps://doi.org/10.1016/j.jnca.2019.102421openalex-snapshot
TCP incast solutions in data center networks: A classification and survey
inferred← citeshttps://doi.org/10.1016/j.jpdc.2003.12.002openalex-snapshot
Randomized routing and wavelength requirements in wavelength-routed WDM multistage, hypercube, and de Bruijn networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2019.04.022openalex-snapshot
ACOR: Adaptive congestion-oblivious routing in dragonfly networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2020.10.009openalex-snapshot
QoS provision in hierarchical and non-hierarchical switch architectures
inferred← citeshttps://doi.org/10.1016/j.jpdc.2025.105136openalex-snapshot
The CAMINOS interconnection networks simulator
inferred← citeshttps://doi.org/10.1016/j.jpdc.2025.105199openalex-snapshot
A new switch buffer architecture for dragonfly networks
inferred← citeshttps://doi.org/10.1016/j.mejo.2014.05.008openalex-snapshot
SRNoC: A novel high performance Shared-Resource routing scheme for Network-on-Chip
inferred← citeshttps://doi.org/10.1016/j.osn.2021.100621openalex-snapshot
A Survey of Reconfigurable Optical Networks
inferred← citeshttps://doi.org/10.1016/j.peva.2010.12.002openalex-snapshot
Dynamic demultiplexing in network calculus—Theory and application
inferred← citeshttps://doi.org/10.1016/j.tbench.2022.100074openalex-snapshot
Understanding hot interconnects with an extensive benchmark survey
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.079openalex-snapshot
Tiara: A self-stabilizing deterministic skip list and skip graph
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.07.007openalex-snapshot
Randomized oblivious integral routing for minimizing power cost
inferred← citeshttps://doi.org/10.1016/s0020-0255(97)10030-5openalex-snapshot
Efficient submesh permutations in wormhole-routed meshes
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.1016/s0166-218x(96)00130-8openalex-snapshot
A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs
inferred← citeshttps://doi.org/10.1016/s0167-8191(98)00106-9openalex-snapshot
Bulk synchronous parallel: practical experience with a model for parallel computing
inferred← citeshttps://doi.org/10.1016/s0167-8191(99)00069-1openalex-snapshot
Ring, torus and hypercube architectures/algorithms for parallel computing
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73240-7openalex-snapshot
Parallel Computer Models and Combinatorial Algorithms
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.1016/s0304-3975(02)00321-3openalex-snapshot
Faster deterministic sorting through better sampling
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00198-9openalex-snapshot
Efficient delay routing
inferred← citeshttps://doi.org/10.1049/iet-sen.2010.0008openalex-snapshot
Web-based decision-support system methodology for smart provision of adaptive digital energy services over cloud technologies
inferred← citeshttps://doi.org/10.1057/jors.1993.71openalex-snapshot
Exercises in Parallel Combinatorial Computing
inferred← citeshttps://doi.org/10.1080/00207169808803662openalex-snapshot
A fast distributed deadlock- detection algorithm for hypercube
showing the first 200 of 599 · page through all 599
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.