On the public citation graph

Solving fundamental problems on sparse-meshes

https://doi.org/10.1007/bfb0054376
0 signed · 38 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.1006/jagm.1995.1042openalex-snapshot
k-k Routing, k-k Sorting, and Cut-Through Routing on the Mesh
inferredcites →https://doi.org/10.1006/jpdc.1998.1508openalex-snapshot
Practical Parallel List Ranking
inferredcites →https://doi.org/10.1007/3-540-57273-2_62openalex-snapshot
Block gossiping on grids and tori: Deterministic sorting and routing match the bisection bound
inferredcites →https://doi.org/10.1007/3-540-61550-4_154openalex-snapshot
Parallel Alternating-Direction Access Machine
inferredcites →https://doi.org/10.1007/3-540-61626-8_104openalex-snapshot
List ranking on interconnection networks
inferredcites →https://doi.org/10.1007/3-540-61626-8_47openalex-snapshot
Worm-hole gossiping on meshes
inferredcites →https://doi.org/10.1007/bf02090401openalex-snapshot
A unified framework for off-line permutation routing in parallel networks
inferredcites →https://doi.org/10.1007/bf02523190openalex-snapshot
Randomized multipacket routing and sorting on meshes
inferredcites →https://doi.org/10.1007/bfb0002744openalex-snapshot
Routing on the PADAM: Degrees of optimality
inferredcites →https://doi.org/10.1007/bfb0002762openalex-snapshot
Sample sort on meshes
inferredcites →https://doi.org/10.1109/71.689439openalex-snapshot
Gossiping on meshes and tori
inferredcites →https://doi.org/10.1109/tc.1981.6312171openalex-snapshot
A fast parallel algorithm for routing in permutation networks
inferredcites →https://doi.org/10.1109/tc.1985.5009385openalex-snapshot
Tight Bounds on the Complexity of Parallel Sorting
inferredcites →https://doi.org/10.1137/0211043openalex-snapshot
On Edge Coloring Bipartite Graphs
inferredcites →https://doi.org/10.1142/s0129626495000072openalex-snapshot
PERMUTATION ROUTING AND SORTING ON MESHES WITH ROW AND COLUMN BUSES
inferredcites →https://doi.org/10.1145/258492.258514openalex-snapshot
Better trade-offs for parallel list ranking
inferredcites →https://doi.org/10.1145/3749740.3749751openalex-snapshot
Universal Schemes for Parallel Communication
inferredcites →https://doi.org/10.1145/48529.48535openalex-snapshot
The input/output complexity of sorting and related problems
inferredcites →https://doi.org/10.1145/800135.804401openalex-snapshot
Area-time complexity for VLSI

What points at this work

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

inferred← citeshttps://doi.org/10.1007/0-306-48727-6_9openalex-snapshot
A Parallel Computer as a NOC Region
inferred← citeshttps://doi.org/10.1007/978-1-4471-2218-0_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-1-4471-2218-0_4openalex-snapshot
Parallel Image Compression Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-21909-7_37openalex-snapshot
Cost of Bandwidth-Optimized Sparse Mesh Layouts
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.1016/j.micpro.2010.07.003openalex-snapshot
Performance comparison of some shared memory organizations for 2D mesh-like NOCs
inferred← citeshttps://doi.org/10.1080/1206212x.2006.11441819openalex-snapshot
Parallel Implementation of Domain Decomposition Based Image Compression Algorithm
inferred← citeshttps://doi.org/10.1109/cit.2014.16openalex-snapshot
Exploration of a Heterogeneous Concentrated-Sparse On-Chip Interconnect for Energy Efficient Multicore Architecture
inferred← citeshttps://doi.org/10.1109/dasc.2013.119openalex-snapshot
DSNOC: A Hybrid Dense-Sparse Network-on-Chip Architecture for Efficient Scalable Computing
inferred← citeshttps://doi.org/10.1109/dsd.2011.46openalex-snapshot
Cost of Sparse Mesh Layouts Supporting Throughput Computing
inferred← citeshttps://doi.org/10.1109/icppw.2001.951966openalex-snapshot
Hot-potato routing algorithms for sparse optical torus
inferred← citeshttps://doi.org/10.1109/parelec.2006.55openalex-snapshot
Nearly-All-Optical Routing in Sparse Optical Tori
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.1145/1050330.1050386openalex-snapshot
Recurrence equation as basis for designing hot-potato routing protocols
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/1839379.1839404openalex-snapshot
Towards programming on the moving threads architecture
inferred← citeshttps://doi.org/10.1145/2383276.2383282openalex-snapshot
Work-optimal two-phase routing in a sparse optical torus
inferred← citeshttps://doi.org/10.2316/journal.202.2006.4.202-1743openalex-snapshot
PARALLEL IMPLEMENTATION OF DOMAIN DECOMPOSITION BASED IMAGE COMPRESSION ALGORITHM
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.