On the public citation graph

An algorithm for the asynchronous Write-All problem based on process collision

https://doi.org/10.1007/pl00008930
0 signed · 50 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.1006/jagm.1996.0003openalex-snapshot
Parallel Algorithms with Processor Failures and Delays
inferredcites →https://doi.org/10.1007/978-0-585-27316-7_5openalex-snapshot
Fault-Tolerance and Efficiency in Massively Parallel Algorithms
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.1007/bfb0055652openalex-snapshot
Checking verifications of protocols and distributed systems by computer
inferredcites →https://doi.org/10.1016/s0026-2692(98)80023-2openalex-snapshot
Fault-tolerant parallel computation
inferredcites →https://doi.org/10.1137/s0097539794319126openalex-snapshot
Algorithms for the Certified Write-All Problem
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/114005.102808openalex-snapshot
Wait-free synchronization
inferredcites →https://doi.org/10.21236/ada283255openalex-snapshot
Fault-Tolerance and Efficiency in Massively Parallel Algorithms
inferredcites →https://doi.org/10.3233/fi-1997-291203openalex-snapshot
DISCRETE TIME PROCESS ALGEBRA: ABSOLUTE TIME, RELATIVE TIME AND PARAMETRIC TIME

What points at this work

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

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-45414-4_11openalex-snapshot
The Complexity of Synchronous Iterative Do-All with Crashes
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-04355-0_27openalex-snapshot
At-Most-Once Semantics in Asynchronous Shared Memory
inferred← citeshttps://doi.org/10.1007/978-3-642-25959-3_9openalex-snapshot
Solving the At-Most-Once Problem with Nearly Optimal Effectiveness
inferred← citeshttps://doi.org/10.1007/978-3-642-33651-5_27openalex-snapshot
The Strong At-Most-Once Problem
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-004-0115-2openalex-snapshot
Lock-free dynamic hash tables with open addressing
inferred← citeshttps://doi.org/10.1007/s00446-005-0149-0openalex-snapshot
Distributed scheduling for disconnected cooperation
inferred← citeshttps://doi.org/10.1007/s10703-009-0083-zopenalex-snapshot
Simple concurrent garbage collection almost without synchronization
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50037-0openalex-snapshot
A Process Algebra for Interworkings
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.scico.2006.10.001openalex-snapshot
Lock-free parallel and concurrent garbage collection by mark&sweep
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.2013.04.017openalex-snapshot
Solving the at-most-once problem with nearly optimal effectiveness
inferred← citeshttps://doi.org/10.1016/s1567-8326(01)00013-3openalex-snapshot
A rewriting approach to binary decision diagrams
inferred← citeshttps://doi.org/10.1023/a:1024840405535openalex-snapshot
Task Allocation in a Multi-Server System
inferred← citeshttps://doi.org/10.1109/focs.2012.41openalex-snapshot
How to Allocate Tasks Asynchronously
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1302969openalex-snapshot
Almost wait-free resizable hashtables
inferred← citeshttps://doi.org/10.1109/pdp.2014.11openalex-snapshot
Coordinated Cooperative Work Using Undependable Processors with Unreliable Broadcast
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/s0097539704440442openalex-snapshot
Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups
inferred← citeshttps://doi.org/10.1142/s0129626407002946openalex-snapshot
FAILURE-SENSITIVE ANALYSIS OF PARALLEL ALGORITHMS WITH CONTROLLED MEMORY ACCESS CONCURRENCY
inferred← citeshttps://doi.org/10.1142/s0129626415500012openalex-snapshot
Work-Competitive Scheduling on Task Dependency Graphs
inferred← citeshttps://doi.org/10.1145/1007912.1007964openalex-snapshot
Writing-all deterministically and optimally using a non-trivial number of asynchronous processors
inferred← citeshttps://doi.org/10.1145/1147954.1147958openalex-snapshot
Split-ordered lists
inferred← citeshttps://doi.org/10.1145/1583991.1584003openalex-snapshot
At-most-once semantics in asynchronous shared memory
inferred← citeshttps://doi.org/10.1145/1993806.1993847openalex-snapshot
Solving the at-most-once problem with nearly optimal effectiveness
inferred← citeshttps://doi.org/10.1145/372202.372466openalex-snapshot
Specifying internet applications with DiCons
inferred← citeshttps://doi.org/10.1145/378580.378685openalex-snapshot
Towards practical deteministic write-all algorithms
inferred← citeshttps://doi.org/10.1145/3796701.3815930openalex-snapshot
Generalized and Reinitializable Concurrent Fast Arrays
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/780542.780581openalex-snapshot
Work-competitive scheduling for cooperative computing with dynamic groups
inferred← citeshttps://doi.org/10.1145/872035.872049openalex-snapshot
Split-ordered lists
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.