On the public citation graph

Efficient simulations between concurrent-read concurrent-write pram models

https://doi.org/10.1007/bfb0017146
0 signed · 36 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/bf01762109openalex-snapshot
Simulations among concurrent-write PRAMs
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(82)90008-6openalex-snapshot
An O(logn) parallel connectivity algorithm
inferredcites →https://doi.org/10.1109/sfcs.1987.34openalex-snapshot
Incomparability 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.12148openalex-snapshot
New 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/800133.804339openalex-snapshot
Parallelism in random access 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.1002/scj.4690230503openalex-snapshot
Methods for realizing a priority bus system
inferred← citeshttps://doi.org/10.1006/jpdc.1994.1127openalex-snapshot
Fast and Efficient Simulations among CRCW PRAMs
inferred← citeshttps://doi.org/10.1006/jpdc.1994.1128openalex-snapshot
Renaming and Dispersing: Techniques for Fast Load Balancing
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-57163-9_2openalex-snapshot
Simulations between different models of parallel computers
inferred← citeshttps://doi.org/10.1007/bf01300373openalex-snapshot
O(log logn)-time integer geometry on the CRCW PRAM
inferred← citeshttps://doi.org/10.1007/bf01940878openalex-snapshot
Efficient PRAM simulation on a distributed memory machine
inferred← citeshttps://doi.org/10.1007/bfb0023830openalex-snapshot
Leaders election without conflict resolution rule
inferred← citeshttps://doi.org/10.1007/bfb0032070openalex-snapshot
On parallel hashing and integer sorting
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90212-gopenalex-snapshot
Sorting roughly sorted sequences in parallel
inferred← citeshttps://doi.org/10.1016/0196-6774(91)90034-vopenalex-snapshot
On parallel hashing and integer sorting
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90031-vopenalex-snapshot
Improved deterministic parallel integer sorting
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.1017/9781316795835openalex-snapshot
Introduction to Parallel Computing
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.1991.185438openalex-snapshot
Towards a theory of nearly constant time parallel algorithms
inferred← citeshttps://doi.org/10.1109/spdp.1991.218302openalex-snapshot
Fast load balancing on a PRAM
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.5555/127787.127837openalex-snapshot
Fast hashing on a PRAM—designing by expectation
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.