On the public citation graph

Network complexity of sorting and graph problems and simulating CRCW PRAMS by interconnection networks

https://doi.org/10.1007/bfb0040401
0 signed · 37 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.1007/bf00264615openalex-snapshot
Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
inferredcites →https://doi.org/10.1016/0196-6774(82)90008-6openalex-snapshot
An O(logn) parallel connectivity algorithm
inferredcites →https://doi.org/10.1016/0196-6774(82)90013-xopenalex-snapshot
An O(n2log n) parallel max-flow algorithm
inferredcites →https://doi.org/10.1016/0196-6774(83)90033-0openalex-snapshot
Implementation of simultaneous memory address access in models that forbid it
inferredcites →https://doi.org/10.1109/sfcs.1984.715896openalex-snapshot
Finding biconnected componemts and computing tree functions in logarithmic parallel time
inferredcites →https://doi.org/10.1109/sfcs.1984.715905openalex-snapshot
A Comparative Study Of X-Tree, Pyramid And Related Machines
inferredcites →https://doi.org/10.1109/sfcs.1984.715913openalex-snapshot
How To Share Memory In A Distributed System
inferredcites →https://doi.org/10.1109/sfcs.1985.52openalex-snapshot
Solving some graph problems with optimal or near-optimal speedup on mesh-of-trees networks
inferredcites →https://doi.org/10.1109/sfcs.1985.53openalex-snapshot
Solving tree problems on a mesh-connected processor array
inferredcites →https://doi.org/10.1109/tc.1981.6312172openalex-snapshot
Data broadcasting in SIMD computers
inferredcites →https://doi.org/10.1109/tc.1983.1676279openalex-snapshot
Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees
inferredcites →https://doi.org/10.1109/tc.1985.5009385openalex-snapshot
Tight Bounds on the Complexity of Parallel Sorting
inferredcites →https://doi.org/10.1145/358645.358660openalex-snapshot
The cube-connected cycles: a versatile network for parallel computation
inferredcites →https://doi.org/10.1145/359138.359141openalex-snapshot
Computing connected components on parallel computers
inferredcites →https://doi.org/10.1145/62.322423openalex-snapshot
Complexity Results for Permuting Data and Other Computations on Parallel Processors
inferredcites →https://doi.org/10.1145/800057.808689openalex-snapshot
A probabilistic relation between desirable and feasible, models of parallel computation
inferredcites →https://doi.org/10.1145/800061.808726openalex-snapshot
An 0(n log n) sorting network
inferredcites →https://doi.org/10.1184/r1/6714269openalex-snapshot
A Complexity Theory 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.1006/jpdc.2000.1636openalex-snapshot
Parallel Sorting Algorithm Using Multiway Merge and Its Implementation on a Multi-Mesh Network
inferred← citeshttps://doi.org/10.1007/3-540-57811-0_18openalex-snapshot
Lower bounds for merging on the hypercube
inferred← citeshttps://doi.org/10.1007/bf01758844openalex-snapshot
On the parallel-decomposability of geometric problems
inferred← citeshttps://doi.org/10.1016/0196-6774(92)90016-6openalex-snapshot
Cubesort: A parallel algorithm for sorting N data items with S-sorters
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50005-xopenalex-snapshot
Deterministic Parallel Computational Geometry
inferred← citeshttps://doi.org/10.1016/b978-1-4832-0772-8.50008-xopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1109/12.123384openalex-snapshot
Sorting with linear speedup on a pipelined hypercube
inferred← citeshttps://doi.org/10.1109/12.628397openalex-snapshot
An efficient sorting algorithm on the multi-mesh network
inferred← citeshttps://doi.org/10.1109/5.163410openalex-snapshot
Parallel techniques for computational geometry
inferred← citeshttps://doi.org/10.1109/71.640013openalex-snapshot
Generalized algorithm for parallel sorting on product networks
inferred← citeshttps://doi.org/10.1109/71.80127openalex-snapshot
Efficient algorithms for list ranking and for solving graph problems on the hypercube
inferred← citeshttps://doi.org/10.1109/spdp.1993.395531openalex-snapshot
Parallel algorithms for geometric problems on networks of processors
inferred← citeshttps://doi.org/10.1109/spdp.1995.530731openalex-snapshot
Weighted selection on coarse-grain hypercubes
inferred← citeshttps://doi.org/10.1145/113379.113380openalex-snapshot
A comparison of sorting algorithms for the connection machine CM-2
inferred← citeshttps://doi.org/10.1145/140901.140918openalex-snapshot
Implementations of randomized sorting on large parallel machines
inferred← citeshttps://doi.org/10.1145/215399.215431openalex-snapshot
Parallel sorting with limited bandwidth
inferred← citeshttps://doi.org/10.1145/72935.72943openalex-snapshot
Load balancing, selection sorting on the hypercube
inferred← citeshttps://doi.org/10.1145/73833.73845openalex-snapshot
On the parallel decomposability of geometric problems
inferred← citeshttps://doi.org/10.5555/314464.314670openalex-snapshot
Derandomizing algorithms for routing and sorting on meshes
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.