On the public citation graph

PRAM computations resilient to memory faults

https://doi.org/10.1007/bfb0049426
0 signed · 43 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/3-540-51498-8_9openalex-snapshot
New simulations between CRCW PRAMs
inferredcites →https://doi.org/10.1007/3-540-56731-3_3openalex-snapshot
Hashing strategies for simulating shared memory on distributed memory machines
inferredcites →https://doi.org/10.1007/bf02277667openalex-snapshot
Efficient parallel algorithms can be made robust
inferredcites →https://doi.org/10.1016/0020-0190(90)90214-iopenalex-snapshot
A guided tour of chernoff bounds
inferredcites →https://doi.org/10.1016/0377-2217(90)90106-lopenalex-snapshot
Efficient parallel algorithms
inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50023-0openalex-snapshot
General Purpose Parallel Architectures
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1017/cbo9781107359949.008openalex-snapshot
On the method of bounded differences
inferredcites →https://doi.org/10.1109/18.119713openalex-snapshot
Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
inferredcites →https://doi.org/10.1109/fscs.1990.89580openalex-snapshot
Asynchronous PRAMs are (almost) as good as synchronous PRAMs
inferredcites →https://doi.org/10.1109/sfcs.1992.267776openalex-snapshot
Fault-tolerant wait-free shared objects
inferredcites →https://doi.org/10.1109/sfcs.1993.366860openalex-snapshot
Highly efficient asynchronous execution of large-grained parallel programs
inferredcites →https://doi.org/10.1109/tit.1976.1055516openalex-snapshot
On the complexity of decoding Reed-Solomon codes (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1976.1055517openalex-snapshot
An erasures-and-errors decoding algorithm for Goppa codes (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1977.1055732openalex-snapshot
On the complexity of decoding Goppa codes (Corresp.)
inferredcites →https://doi.org/10.1145/100216.100231openalex-snapshot
Efficient robust parallel computations
inferredcites →https://doi.org/10.1145/135419.135431openalex-snapshot
Computing with faulty shared memory
inferredcites →https://doi.org/10.1145/62044.62050openalex-snapshot
Efficient dispersal of information for security, load balancing, and fault tolerance
inferredcites →https://doi.org/10.1145/72935.72937openalex-snapshot
On communication latency in PRAM computations
inferredcites →https://doi.org/10.1145/72935.72953openalex-snapshot
A more practical PRAM model
inferredcites →https://doi.org/10.1145/72935.72954openalex-snapshot
The APRAM: incorporating asynchrony into the PRAM model
inferredcites →https://doi.org/10.1145/97444.97672openalex-snapshot
Asynchronous shared memory 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/jpdc.2000.1659openalex-snapshot
Fully Scalable Fault-Tolerant Simulations for BSP and CGM
inferred← citeshttps://doi.org/10.1007/11561071_1openalex-snapshot
Designing Reliable Algorithms in Unreliable Memories
inferred← citeshttps://doi.org/10.1007/3-540-47849-3_26openalex-snapshot
Randomized Gossiping by Packets in Faulty Networks
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_136openalex-snapshot
Fast deterministic simulation of computations on faulty parallel machines
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_16openalex-snapshot
Fault-tolerant shared memory simulations
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_17openalex-snapshot
On word-level parallelism in fault-tolerant computing
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_10openalex-snapshot
Randomized Techniques for Modelling Faults and Achieving Robust Computing
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_39openalex-snapshot
A Method for Creating Near-Optimal Instances of a Certified Write-All Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-13073-1_3openalex-snapshot
Resilient Algorithms and Data Structures
inferred← citeshttps://doi.org/10.1007/bfb0036183openalex-snapshot
Efficient parallel computing with memory faults
inferred← citeshttps://doi.org/10.1007/s002240010009openalex-snapshot
Robust Parallel Computations through Randomization
inferred← citeshttps://doi.org/10.1007/s00446-005-0149-0openalex-snapshot
Distributed scheduling for disconnected cooperation
inferred← citeshttps://doi.org/10.1007/s00453-007-9088-4openalex-snapshot
Sorting and Searching in Faulty Memories
inferred← citeshttps://doi.org/10.1016/j.cosrev.2007.10.001openalex-snapshot
Designing reliable algorithms in unreliable memories
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.10.015openalex-snapshot
A tight analysis and near-optimal instances of the algorithm of Anderson and Woll
inferred← citeshttps://doi.org/10.1109/ipps.1999.760445openalex-snapshot
Fully-scalable fault-tolerant simulations for BSP and CGM
inferred← citeshttps://doi.org/10.1137/s0097539703428014openalex-snapshot
A Work-Optimal Deterministic Algorithm for the Certified Write-All Problem with a Nontrivial Number of Asynchronous Processors
inferred← citeshttps://doi.org/10.1145/1007352.1007375openalex-snapshot
Sorting and searching in the presence of memory faults (without redundancy)
inferred← citeshttps://doi.org/10.1145/258492.258501openalex-snapshot
Efficient computations on fault-prone BSP machines
inferred← citeshttps://doi.org/10.1145/872035.872075openalex-snapshot
A work-optimal deterministic algorithm for the asynchronous certified write-all problem
inferred← citeshttps://doi.org/10.48550/arxiv.1801.00237openalex-snapshot
Deterministic Computations on a PRAM with Static Processor and Memory Faults
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.