On the public citation graph
Locality, Communication, and Interconnect Length in Multicomputers
0 signed · 77 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/3-540-16766-8_10openalex-snapshot
Nonsequential computation and laws of nature
inferredcites →https://doi.org/10.1016/0010-4485(85)90134-4openalex-snapshot
Computational aspects of VLSI
inferredcites →https://doi.org/10.1017/cbo9780511600739openalex-snapshot
Permutation Groups and Combinatorial Structures
inferredcites →https://doi.org/10.1109/jssc.1982.1051810openalex-snapshot
Minimum propagation delays in VLSI
inferredcites →https://doi.org/10.1145/7531.7926openalex-snapshot
How to share memory in a distributed system
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.1999.1665openalex-snapshot
Data Independence of Read, Write, and Control Structures in PRAM Computations
inferred← citeshttps://doi.org/10.1007/0-387-27705-6_1openalex-snapshot
Changing Challenges for Collaborative Algorithmics
inferred← citeshttps://doi.org/10.1007/11535294_12openalex-snapshot
Systolic Routing in an Optical Butterfly
inferred← citeshttps://doi.org/10.1007/11576235_53openalex-snapshot
Systolic Routing in an Optical Fat Tree
inferred← citeshttps://doi.org/10.1007/3-540-37437-x_10openalex-snapshot
Parallelisierung, Nebenläufigkeit und alternative Modelle
inferred← citeshttps://doi.org/10.1007/3-540-44577-3_15openalex-snapshot
The Quantum Computing Challenge
inferred← citeshttps://doi.org/10.1007/3-540-56004-1_1openalex-snapshot
Representing the spatial/kinematic domain and lattice computers
inferred← citeshttps://doi.org/10.1007/3-540-57529-4_46openalex-snapshot
Data-independences of parallel random access machines
inferred← citeshttps://doi.org/10.1007/3-540-58184-7_97openalex-snapshot
Simulation of PRAM models on meshes
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_73openalex-snapshot
Algorithmic arguments in physics of computation
inferred← citeshttps://doi.org/10.1007/3-540-60246-1_118openalex-snapshot
Physics and the new computation
inferred← citeshttps://doi.org/10.1007/3-540-60249-6_68openalex-snapshot
PRAM's towards realistic parallelism: BRAM's
inferred← citeshttps://doi.org/10.1007/3-540-60609-2_1openalex-snapshot
Parallel machine models: How they are and where are they going
inferred← citeshttps://doi.org/10.1007/3-540-63774-5_96openalex-snapshot
On the distributed realization of parallel algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4615-4002-1_16openalex-snapshot
Matrix Inversion in 3 Dimensions
inferred← citeshttps://doi.org/10.1007/978-1-4684-5511-3_12openalex-snapshot
A Modest Proposal for Communication Costs in Multicomputers
inferred← citeshttps://doi.org/10.1007/978-3-540-73940-1_21openalex-snapshot
Address-Free All-to-All Routing in Sparse Torus
inferred← citeshttps://doi.org/10.1007/978-3-540-75444-2_51openalex-snapshot
Systolic Routing in an Optical Ring with Logarithmic Shortcuts
inferred← citeshttps://doi.org/10.1007/978-3-642-04850-0_31openalex-snapshot
On Two-Layer Hierarchical Networks How Does the Brain Do This?
inferred← citeshttps://doi.org/10.1007/978-3-642-24568-8_16openalex-snapshot
On Two-Layer Brain-Inspired Hierarchical Topologies – A Rent’s Rule Approach –
inferred← citeshttps://doi.org/10.1007/978-3-642-27266-0_10openalex-snapshot
Parallelism, Concurrency, and Alternative Models
inferred← citeshttps://doi.org/10.1007/bf02946575openalex-snapshot
Pipelined global data communication on hypertoruses
inferred← citeshttps://doi.org/10.1007/bfb0015239openalex-snapshot
Quo vadetis, parallel machine models?
inferred← citeshttps://doi.org/10.1007/pl00009288openalex-snapshot
Optimal Deterministic Sorting and Routing on Grids and Tori with Diagonals
inferred← citeshttps://doi.org/10.1007/s00145-003-0213-5openalex-snapshot
The Full Cost of Cryptanalytic Attacks
inferred← citeshttps://doi.org/10.1016/0165-6074(90)90317-3openalex-snapshot
A performance analysis of toroidal mesh networks
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)90040-xopenalex-snapshot
New systolic arrays for the longest common subsequence problem
inferred← citeshttps://doi.org/10.1016/0167-9260(94)90003-5openalex-snapshot
Regular layouts of butterfly networks
inferred← citeshttps://doi.org/10.1016/0167-9287(93)90409-topenalex-snapshot
Why we should no longer only repair, polish and iron current computer science educations
inferred← citeshttps://doi.org/10.1016/0743-7315(92)90016-gopenalex-snapshot
Efficient processor allocation strategies for mesh-connected parallel computers
inferred← citeshttps://doi.org/10.1016/0898-1221(92)90075-sopenalex-snapshot
Adaptive and fault-tolerant routing algorithms for high performance 2D torus interconnection network
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50006-0openalex-snapshot
Machine Models and Simulations
inferred← citeshttps://doi.org/10.1023/a:1008087824437openalex-snapshot
An Efficient Systolic Algorithm for the Longest Common Subsequence Problem
inferred← citeshttps://doi.org/10.1023/a:1024455602163openalex-snapshot
Discrete, Amorphous Physical Models
inferred← citeshttps://doi.org/10.1080/09528139408953779openalex-snapshot
Spatial/kinematic domain and lattice computers
inferred← citeshttps://doi.org/10.1088/0957-4484/9/3/005openalex-snapshot
Ultimate theoretical models of nanocomputers
inferred← citeshttps://doi.org/10.1093/comjnl/44.5.374openalex-snapshot
Layout of the Cube-connected Cycles without Long Wires
inferred← citeshttps://doi.org/10.1093/philmat/nkz021openalex-snapshot
Computational Complexity Theory and the Philosophy of Mathematics†
inferred← citeshttps://doi.org/10.1109/71.536939openalex-snapshot
Optimal layouts of midimew networks
inferred← citeshttps://doi.org/10.1109/ccc.1997.612301openalex-snapshot
Polynomial vicinity circuits and nonlinear lower bounds
inferred← citeshttps://doi.org/10.1109/ccgrid.2002.1017168openalex-snapshot
Motivating Computational Grids
inferred← citeshttps://doi.org/10.1109/cse.2008.34openalex-snapshot
Work-Optimal Routing in Wavelength-Division Multiplexed Dense Optical Tori
inferred← citeshttps://doi.org/10.1109/icpp.1994.80openalex-snapshot
Continuum: A Hybrid Time/Space Communications Paradigm for k-ary n-cubes
inferred← citeshttps://doi.org/10.1109/icppw.2001.951966openalex-snapshot
Hot-potato routing algorithms for sparse optical torus
inferred← citeshttps://doi.org/10.1109/isca.1989.714567openalex-snapshot
Interprocessor Communication Speed And Performance In Distributed-memory Parallel Processors
inferred← citeshttps://doi.org/10.1109/isca.1990.134512openalex-snapshot
The K2 parallel processor: architecture and hardware implementation
inferred← citeshttps://doi.org/10.1109/ispdc.2008.16openalex-snapshot
Scheduled Routing in an Optical Hypercube
inferred← citeshttps://doi.org/10.1109/jcit.1990.128289openalex-snapshot
Algorithms and optic implementation for reconfigurable networks
inferred← citeshttps://doi.org/10.1109/parelec.2011.18openalex-snapshot
Balanced WDM and TDM Routing in Coloured Sparse Optical Tori
inferred← citeshttps://doi.org/10.1109/pdcat.2009.21openalex-snapshot
Lambda-Systolic Routing in a Wavelength-Division Multiplexed All-Optical Butterfly
inferred← citeshttps://doi.org/10.1109/phycmp.1994.363703openalex-snapshot
Multiprocessor architectures and physical law
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63510openalex-snapshot
Power of fast VLSI models is insensitive to wires' thinness
inferred← citeshttps://doi.org/10.1109/spdp.1996.570327openalex-snapshot
Periodically regular chordal rings: generality, scalability, and VLSI layout
inferred← citeshttps://doi.org/10.1142/s0129626496000145openalex-snapshot
A LOWER BOUND ON THE AVERAGE PHYSICAL LENGTH OF EDGES IN THE PHYSICAL REALIZATION OF GRAPHS
inferred← citeshttps://doi.org/10.1145/1839379.1839388openalex-snapshot
Work-optimal routing in wavelength-division multiplexed three-dimensional dense optical tori
inferred← citeshttps://doi.org/10.1145/363647.363688openalex-snapshot
Lattice computers for approximating Euclidean space
inferred← citeshttps://doi.org/10.1145/74925.74961openalex-snapshot
Interprocessor communication speed and performance in distributed-memory parallel processors
inferred← citeshttps://doi.org/10.1145/74926.74961openalex-snapshot
Interprocessor communication speed and performance in distributed-memory parallel processors
inferred← citeshttps://doi.org/10.2172/918315openalex-snapshot
A network architecture for Petaflops supercomputers.
inferred← citeshttps://doi.org/10.2172/918778openalex-snapshot
Taking ASCI supercomputing to the end game.
inferred← citeshttps://doi.org/10.4018/jdst.2012100105openalex-snapshot
Routing in Coloured Sparse Optical Tori by Using Balanced WDM and Network Sparseness
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.