On the public citation graph

Performing tasks on restartable message-passing processors

https://doi.org/10.1007/bfb0030678
0 signed · 33 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-57271-6_30openalex-snapshot
Controlling memory access concurrency in efficient fault-tolerant parallel algorithms (extended abstract)
inferredcites →https://doi.org/10.1007/978-1-4757-5210-6openalex-snapshot
Fault-Tolerant Parallel Computation
inferredcites →https://doi.org/10.1007/bf02277667openalex-snapshot
Efficient parallel algorithms can be made robust
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.1995.492674openalex-snapshot
Resolving message complexity of Byzantine Agreement and beyond
inferredcites →https://doi.org/10.1137/s0097539793255527openalex-snapshot
Performing Work Efficiently in the Presence of Faults
inferredcites →https://doi.org/10.1145/100216.100231openalex-snapshot
Efficient robust parallel computations
inferredcites →https://doi.org/10.1145/129712.129742openalex-snapshot
Efficient program transformations for resilient parallel computation via randomization (preliminary version)
inferredcites →https://doi.org/10.1145/135419.135439openalex-snapshot
Performing work efficiently in the presence of faults
inferredcites →https://doi.org/10.1145/197917.198082openalex-snapshot
Time-optimal message-efficient work performance in the presence of faults
inferredcites →https://doi.org/10.5555/642068.642072openalex-snapshot
Controlling memory access concurrency in efficient fault-tolerant parallel algorithms

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11864219_33openalex-snapshot
Robust Network Supercomputing with Malicious Processes
inferred← citeshttps://doi.org/10.1007/3-540-40026-5_8openalex-snapshot
Distributed Cooperation During the Absence of Communication
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/978-3-642-24100-0_15openalex-snapshot
Performing Dynamically Injected Tasks on Processes Prone to Crashes and Restarts
inferred← citeshttps://doi.org/10.1007/978-3-642-40164-0_16openalex-snapshot
Online Parallel Scheduling of Non-uniform Tasks: Trading Failures for Energy
inferred← citeshttps://doi.org/10.1007/pl00008926openalex-snapshot
Performing tasks on synchronous restartable message-passing processors
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.1016/j.jpdc.2014.10.002openalex-snapshot
Robust network supercomputing with unreliable workers
inferred← citeshttps://doi.org/10.1016/j.jpdc.2015.07.007openalex-snapshot
On the competitiveness of scheduling dynamically injected tasks on processes prone to crashes and restarts
inferred← citeshttps://doi.org/10.1016/j.jpdc.2017.06.013openalex-snapshot
Coordinated cooperative task computing using crash-prone processors with unreliable multicast
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.2005.05.019openalex-snapshot
Efficient gossip and robust distributed computation
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.09.020openalex-snapshot
Dynamic load balancing with group communication
inferred← citeshttps://doi.org/10.1016/s1570-8667(03)00026-1openalex-snapshot
Cooperative computing with fragmentable and mergeable groups
inferred← citeshttps://doi.org/10.1109/nca.2001.962540openalex-snapshot
Local scheduling for distributed cooperation
inferred← citeshttps://doi.org/10.1109/nca.2008.46openalex-snapshot
Randomized Work-Competitive Scheduling for Cooperative Computing on k-partite Task Graphs
inferred← citeshttps://doi.org/10.1109/pdp.2014.11openalex-snapshot
Coordinated Cooperative Work Using Undependable Processors with Unreliable Broadcast
inferred← citeshttps://doi.org/10.1145/778348.778358openalex-snapshot
distributed cooperation and adversity
inferred← citeshttps://doi.org/10.1145/780542.780581openalex-snapshot
Work-competitive scheduling for cooperative computing with dynamic groups
inferred← citeshttps://doi.org/10.48550/arxiv.1306.1861openalex-snapshot
Online Parallel Scheduling of Non-uniform Tasks: Trading Failures for Energy
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.