On the public citation graph
Efficient parallel algorithms can be made robust
0 signed · 109 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-12689-9_99openalex-snapshot
The consensus problem in unreliable distributed systems (a brief survey)
inferredcites →https://doi.org/10.1016/0020-0190(82)90033-3openalex-snapshot
A lower bound for the time to assure interactive consistency
inferredcites →https://doi.org/10.1016/0020-0190(91)90156-copenalex-snapshot
Achieving optimal CRCW PRAM fault-tolerance
inferredcites →https://doi.org/10.1016/s0019-9958(86)80028-6openalex-snapshot
Probabilistic analysis of a network resource allocation algorithm
inferredcites →https://doi.org/10.1063/1.4822863openalex-snapshot
Concrete Mathematics: A Foundation for Computer Science
inferredcites →https://doi.org/10.1109/12.9729openalex-snapshot
Constructing two-writer atomic registers
inferredcites →https://doi.org/10.1109/fscs.1990.89546openalex-snapshot
Fault tolerant sorting network
inferredcites →https://doi.org/10.1109/fscs.1990.89547openalex-snapshot
Asymptotically tight bounds for computing with faulty arrays of processors
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.1983.41openalex-snapshot
On the minimal synchronism needed for distributed consensus
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.1987.38openalex-snapshot
Local management of a global resource in a communication network
inferredcites →https://doi.org/10.1109/sfcs.1987.7openalex-snapshot
Applying static network protocols to dynamic networks
inferredcites →https://doi.org/10.1109/sfcs.1988.21938openalex-snapshot
Dynamic networks are as fast as static networks
inferredcites →https://doi.org/10.1109/sfcs.1988.21940openalex-snapshot
On the effects of feedback in dynamic network protocols
inferredcites →https://doi.org/10.1145/100216.100231openalex-snapshot
Efficient robust parallel computations
inferredcites →https://doi.org/10.1145/103418.103459openalex-snapshot
Combining tentative and definite executions for very fast dependable parallel computing
inferredcites →https://doi.org/10.1145/112600.112603openalex-snapshot
Efficient parallel algorithms on restartable fail-stop processors
inferredcites →https://doi.org/10.1145/12130.12169openalex-snapshot
Fault tolerance in networks of bounded degree
inferredcites →https://doi.org/10.1145/1468075.1468121openalex-snapshot
Sorting networks and their applications
inferredcites →https://doi.org/10.1145/227595.227596openalex-snapshot
Local management of a global resource in a communication network
inferredcites →https://doi.org/10.1145/3149.214121openalex-snapshot
Impossibility of distributed consensus with one faulty process
inferredcites →https://doi.org/10.1145/322186.322188openalex-snapshot
Reaching Agreement in the Presence of Faults
inferredcites →https://doi.org/10.1145/65950.65958openalex-snapshot
Optimal bounds for decision problems on the CRCW PRAM
inferredcites →https://doi.org/10.1145/72935.72947openalex-snapshot
Deterministic P-RAM simulation with constant redundancy
inferredcites →https://doi.org/10.1145/72935.72954openalex-snapshot
The APRAM: incorporating asynchrony into the PRAM model
inferredcites →https://doi.org/10.1145/72981.72982openalex-snapshot
A hundred impossibility proofs for distributed computing
inferredcites →https://doi.org/10.1145/72981.72996openalex-snapshot
Efficient parallel algorithms can be made robust
inferredcites →https://doi.org/10.1145/73007.73030openalex-snapshot
An O (log N ) deterministic packet routing scheme
inferredcites →https://doi.org/10.1145/800133.804339openalex-snapshot
Parallelism in random access machines
inferredcites →https://doi.org/10.1145/97444.97672openalex-snapshot
Asynchronous shared memory parallel computation
inferredcites →https://doi.org/10.1145/97444.97673openalex-snapshot
The expected advantage of asynchrony
inferredcites →https://doi.org/10.1146/annurev.cs.03.060188.001313openalex-snapshot
Parallel Algorithmic Techniques For Combinational Computation
inferredcites →https://doi.org/10.21236/ada236249openalex-snapshot
Efficient Parallel Algorithms on Restartable Fail-Stop Processors
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.10104openalex-snapshot
Randomization helps to perform independent tasks reliably
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/11523468_18openalex-snapshot
Asynchronous Perfectly Secure Communication over One-Time Pads
inferred← citeshttps://doi.org/10.1007/3-540-36108-1_20openalex-snapshot
Bounding Work and Communication in Robust Cooperative Computation
inferred← citeshttps://doi.org/10.1007/3-540-36136-7_29openalex-snapshot
Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks
inferred← citeshttps://doi.org/10.1007/3-540-45414-4_11openalex-snapshot
The Complexity of Synchronous Iterative Do-All with Crashes
inferred← citeshttps://doi.org/10.1007/3-540-48169-9_20openalex-snapshot
Randomization Helps to Perform Tasks on Processors Prone to Failures
inferred← citeshttps://doi.org/10.1007/3-540-57271-6_30openalex-snapshot
Controlling memory access concurrency in efficient fault-tolerant parallel algorithms (extended abstract)
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_17openalex-snapshot
On word-level parallelism in fault-tolerant computing
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_161openalex-snapshot
Shared-memory simulations on a faulty-memory DMM
inferred← citeshttps://doi.org/10.1007/978-0-585-27316-7_5openalex-snapshot
Fault-Tolerance and Efficiency in Massively Parallel Algorithms
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-1-4757-5210-6_2openalex-snapshot
Models for Robust Computation
inferred← citeshttps://doi.org/10.1007/978-1-4757-5210-6_3openalex-snapshot
The Write-All Problem: Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4757-5210-6_4openalex-snapshot
Lower Bounds, Snapshots and Approximation
inferred← citeshttps://doi.org/10.1007/978-1-4757-5210-6_5openalex-snapshot
Fault-Tolerant Simulations
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-540-39989-6_16openalex-snapshot
Efficient Gossip and Robust Distributed Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_21openalex-snapshot
Efficient parallelism vs reliable distribution: a trade-off for concurrent computations
inferred← citeshttps://doi.org/10.1007/978-3-642-79917-4_15openalex-snapshot
Dependability of Distributed Programs: Algorithms and Performance
inferred← citeshttps://doi.org/10.1007/bfb0030678openalex-snapshot
Performing tasks on restartable message-passing processors
inferred← citeshttps://doi.org/10.1007/bfb0036183openalex-snapshot
Efficient parallel computing with memory faults
inferred← citeshttps://doi.org/10.1007/bfb0049426openalex-snapshot
PRAM computations resilient to memory faults
inferred← citeshttps://doi.org/10.1007/pl00008930openalex-snapshot
An algorithm for the asynchronous Write-All problem based on process collision
inferred← citeshttps://doi.org/10.1007/s00224-007-9065-yopenalex-snapshot
Fault-Tolerant Sequential Scan
inferred← citeshttps://doi.org/10.1007/s002240010009openalex-snapshot
Robust Parallel Computations through Randomization
inferred← citeshttps://doi.org/10.1007/s00446-003-0091-yopenalex-snapshot
Hundreds of impossibility results for distributed computing
inferred← citeshttps://doi.org/10.1007/s00446-003-0099-3openalex-snapshot
The complexity of synchronous iterative Do-All with crashes
inferred← citeshttps://doi.org/10.1007/s00446-005-0149-0openalex-snapshot
Distributed scheduling for disconnected cooperation
inferred← citeshttps://doi.org/10.1007/s00446-005-0153-4openalex-snapshot
Performing work in broadcast networks
inferred← citeshttps://doi.org/10.1007/s00446-018-0341-7openalex-snapshot
Ordered and delayed adversaries and how to work against them on a shared channel
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90090-iopenalex-snapshot
An efficient Write-All algorithm for fail-stop PRAM without initialized memory
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00186-7openalex-snapshot
Reliable computations on faulty EREW PRAM
inferred← citeshttps://doi.org/10.1016/j.ic.2017.02.003openalex-snapshot
Doing-it-All with bounded work and communication
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.06.034openalex-snapshot
The Do-All problem with Byzantine processor failures
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.1016/j.tcs.2005.05.019openalex-snapshot
Efficient gossip and robust distributed computation
inferred← citeshttps://doi.org/10.1109/empdp.1995.389188openalex-snapshot
Dependable parallel computing with agents based on a task graph model
inferred← citeshttps://doi.org/10.1109/focs.2012.41openalex-snapshot
How to Allocate Tasks Asynchronously
inferred← citeshttps://doi.org/10.1109/icdcs.2015.17openalex-snapshot
Asynchronous Adaptive Task Allocation
inferred← citeshttps://doi.org/10.1109/ipps.1999.760445openalex-snapshot
Fully-scalable fault-tolerant simulations for BSP and CGM
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492674openalex-snapshot
Resolving message complexity of Byzantine Agreement and beyond
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.1137/s0097539793255527openalex-snapshot
Performing Work Efficiently in the Presence of Faults
inferred← citeshttps://doi.org/10.1137/s0097539794319126openalex-snapshot
Algorithms for the Certified Write-All Problem
inferred← citeshttps://doi.org/10.1142/s0129626407002946openalex-snapshot
FAILURE-SENSITIVE ANALYSIS OF PARALLEL ALGORITHMS WITH CONTROLLED MEMORY ACCESS CONCURRENCY
inferred← citeshttps://doi.org/10.1145/1007352.1007406openalex-snapshot
Collective asynchronous reading with polylogarithmic worst-case overhead
inferred← citeshttps://doi.org/10.1145/1060590.1060698openalex-snapshot
Cooperative asynchronous update of shared memory
inferred← citeshttps://doi.org/10.1145/112600.112603openalex-snapshot
Efficient parallel algorithms on restartable fail-stop processors
inferred← citeshttps://doi.org/10.1145/1248377.1248384openalex-snapshot
Scheduling DAGs on asynchronous processors
inferred← citeshttps://doi.org/10.1145/135419.135439openalex-snapshot
Performing work efficiently in the presence of faults
inferred← citeshttps://doi.org/10.1145/165231.165265openalex-snapshot
A method for implementing lock-free shared-data structures
inferred← citeshttps://doi.org/10.1145/197917.198082openalex-snapshot
Time-optimal message-efficient work performance in the presence of faults
inferred← citeshttps://doi.org/10.1145/1993806.1993860openalex-snapshot
Robust network supercomputing without centralized control
inferred← citeshttps://doi.org/10.1145/234313.234318openalex-snapshot
In memoriam Paris C. Kanellakis
inferred← citeshttps://doi.org/10.1145/242223.242252openalex-snapshot
Strategic directions in concurrency research
inferred← citeshttps://doi.org/10.1145/258492.258501openalex-snapshot
Efficient computations on fault-prone BSP machines
inferred← citeshttps://doi.org/10.1145/2767386.2767420openalex-snapshot
How To Elect a Leader Faster than a Tournament
inferred← citeshttps://doi.org/10.1145/383962.384000openalex-snapshot
The do-all problem in broadcast networks
inferred← citeshttps://doi.org/10.1145/778348.778358openalex-snapshot
distributed cooperation and adversity
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.