On the public citation graph

Simulations among concurrent-write PRAMs

https://doi.org/10.1007/bf01762109
0 signed · 63 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/bfb0105127openalex-snapshot
Finding the maximum, merging and sorting in a parallel computation model
inferredcites →https://doi.org/10.1016/0020-0190(82)90093-xopenalex-snapshot
Parallel computation and conflicts in memory access
inferredcites →https://doi.org/10.1016/0196-6774(81)90010-9openalex-snapshot
Finding the maximum, merging, and sorting in a parallel computation model
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.1985.58openalex-snapshot
The complexity of parallel sorting
inferredcites →https://doi.org/10.1137/0214024openalex-snapshot
Trade-Offs between Depth and Width in Parallel Computation
inferredcites →https://doi.org/10.1137/0217037openalex-snapshot
Relations between Concurrent-Write Models of Parallel Computation
inferredcites →https://doi.org/10.1137/0401040openalex-snapshot
The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$
inferredcites →https://doi.org/10.1145/12130.12147openalex-snapshot
Limits on the power of concurrent-write parallel machines
inferredcites →https://doi.org/10.1145/12130.12148openalex-snapshot
New lower bounds for parallel computation
inferredcites →https://doi.org/10.1145/22145.22151openalex-snapshot
One, two, three . . . infinity: lower bounds for parallel computation
inferredcites →https://doi.org/10.1145/322344.322353openalex-snapshot
A universal interconnection pattern for parallel computers
inferredcites →https://doi.org/10.1145/800057.808687openalex-snapshot
Optimal parallel algorithms for string matching
inferredcites →https://doi.org/10.1145/800133.804336openalex-snapshot
A unified approach to models of synchronous parallel machines
inferredcites →https://doi.org/10.1145/800222.806745openalex-snapshot
Relations between concurrent-write models of parallel computation

What points at this work

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

inferred← citeshttps://doi.org/10.1006/inco.1997.2654openalex-snapshot
The Complexity of Parallel Prefix Problems on Small Domains
inferred← citeshttps://doi.org/10.1006/jagm.1997.0905openalex-snapshot
Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains
inferred← citeshttps://doi.org/10.1006/jcss.1998.1580openalex-snapshot
Sorting in Linear Time?
inferred← citeshttps://doi.org/10.1006/jpdc.1994.1127openalex-snapshot
Fast and Efficient Simulations among CRCW PRAMs
inferred← citeshttps://doi.org/10.1007/3-540-51498-8_9openalex-snapshot
New simulations between CRCW PRAMs
inferred← citeshttps://doi.org/10.1007/3-540-55210-3_172openalex-snapshot
Fast and optimal simulations between CRCW PRAMs
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_246openalex-snapshot
Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs
inferred← citeshttps://doi.org/10.1007/3-540-57163-9_2openalex-snapshot
Simulations between different models of parallel computers
inferred← citeshttps://doi.org/10.1007/978-3-319-27308-2_44openalex-snapshot
Accelerating Minimum Spanning Forest Computations on Multicore Platforms
inferred← citeshttps://doi.org/10.1007/978-3-662-25209-3_21openalex-snapshot
FORK: A High-Level Language for PRAMs
inferred← citeshttps://doi.org/10.1007/bf01759055openalex-snapshot
Large parallel machines can be extremely slow for small problems
inferred← citeshttps://doi.org/10.1007/bf01940878openalex-snapshot
Efficient PRAM simulation on a distributed memory machine
inferred← citeshttps://doi.org/10.1007/bf02575730openalex-snapshot
Parallel models of computation: an introductory survey
inferred← citeshttps://doi.org/10.1007/bf03036466openalex-snapshot
Parallel integer sorting and simulation amongst CRCW models
inferred← citeshttps://doi.org/10.1007/bfb0002743openalex-snapshot
Finding a pair on a mesh with multiple broadcasting is hard
inferred← citeshttps://doi.org/10.1007/bfb0017146openalex-snapshot
Efficient simulations between concurrent-read concurrent-write pram models
inferred← citeshttps://doi.org/10.1007/bfb0023830openalex-snapshot
Leaders election without conflict resolution rule
inferred← citeshttps://doi.org/10.1007/bfb0032071openalex-snapshot
The parallel simplicity of compaction and chaining
inferred← citeshttps://doi.org/10.1007/bfb0035112openalex-snapshot
FORK a high-level language for PRAMs
inferred← citeshttps://doi.org/10.1007/bfb0035768openalex-snapshot
Parallel algorithmic techniques for combinatorial computation
inferred← citeshttps://doi.org/10.1016/0022-0000(92)90006-5openalex-snapshot
Processor-time tradeoffs in PRAM simulations
inferred← citeshttps://doi.org/10.1016/0166-218x(90)90082-nopenalex-snapshot
Incomparability in parallel computation
inferred← citeshttps://doi.org/10.1016/0167-739x(92)90070-ropenalex-snapshot
FORK: A high-level language for PRAMs
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90059-xopenalex-snapshot
On the power of concurrent-write PRAMs with read-only memory
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90031-vopenalex-snapshot
Improved deterministic parallel integer sorting
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50007-2openalex-snapshot
A Catalog of Complexity Classes
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50022-9openalex-snapshot
Parallel Algorithms for Shared-Memory Machines
inferred← citeshttps://doi.org/10.1016/j.jpdc.2003.12.001openalex-snapshot
Partially effective randomization in simulations between ARBITRARY and COMMON PRAMs
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00020-5openalex-snapshot
Removing Ramsey theory: Lower bounds with smaller domain size
inferred← citeshttps://doi.org/10.1080/01495739908947372openalex-snapshot
ON THE POWER OF SOME PRAM MODELS
inferred← citeshttps://doi.org/10.1109/hpcc-smartcity-dss.2016.0037openalex-snapshot
Composable Locality Optimizations for Accelerating Parallel Forest Computations
inferred← citeshttps://doi.org/10.1109/ipps.1995.395933openalex-snapshot
Fast parallel algorithms for minimum and related problems with small integer inputs
inferred← citeshttps://doi.org/10.1109/istcs.1995.377027openalex-snapshot
On the power of randomization for the common PRAM
inferred← citeshttps://doi.org/10.1109/sct.1991.160276openalex-snapshot
Lower bounds with smaller domain size on concurrent write parallel machines
inferred← citeshttps://doi.org/10.1109/sfcs.1987.34openalex-snapshot
Incomparability in parallel computation
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185438openalex-snapshot
Towards a theory of nearly constant time parallel algorithms
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267787openalex-snapshot
The complexity of parallel prefix problems on small domains
inferred← citeshttps://doi.org/10.1137/0217037openalex-snapshot
Relations between Concurrent-Write Models of Parallel Computation
inferred← citeshttps://doi.org/10.1137/0401040openalex-snapshot
The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$
inferred← citeshttps://doi.org/10.1137/s0097539792230277openalex-snapshot
Tight Bounds on Oblivious Chaining
inferred← citeshttps://doi.org/10.1145/129712.129743openalex-snapshot
Efficient PRAM simulation on a distributed memory machine
inferred← citeshttps://doi.org/10.1145/3458744.3474041openalex-snapshot
Implementing Arbitrary/Common Concurrent Writes of CRCW PRAM
inferred← citeshttps://doi.org/10.1145/73007.73037openalex-snapshot
Optimal separations between concurrent-write parallel machines
inferred← citeshttps://doi.org/10.1145/97444.97677openalex-snapshot
Every robust CRCW PRAM can efficiently simulate a PRIORITY PRAM
inferred← citeshttps://doi.org/10.1146/annurev.cs.03.060188.001313openalex-snapshot
Parallel Algorithmic Techniques For Combinational Computation
inferred← citeshttps://doi.org/10.37236/34openalex-snapshot
Ramsey Theory Applications
inferred← citeshttps://doi.org/10.48550/arxiv.1103.4071openalex-snapshot
Efficient Resource Oblivious Algorithms for Multicores
inferred← citeshttps://doi.org/10.5539/cis.v13n1p51openalex-snapshot
Sort Integers into a Linked List
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.