On the public citation graph
Bounded time-stamps
0 signed · 99 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-56188-9_7openalex-snapshot
A concurrent time-stamp scheme which is linear in time and space
inferredcites →https://doi.org/10.1007/bfb0035176openalex-snapshot
Concurrent Timestamping made simple
inferredcites →https://doi.org/10.1109/sfcs.1986.11openalex-snapshot
Atomic shared register access by asynchronous hardware
inferredcites →https://doi.org/10.1109/sfcs.1989.63503openalex-snapshot
Polynomial end-to-end communication
inferredcites →https://doi.org/10.1109/tcom.1979.1094473openalex-snapshot
Resynch Procedures and a Fail-Safe Network Protocol
inferredcites →https://doi.org/10.1109/tit.1983.1056620openalex-snapshot
Distributed network protocols
inferredcites →https://doi.org/10.1109/tse.1987.233199openalex-snapshot
Cooperative Distributed Algorithms for Dynamic Cycle Prevention
inferredcites →https://doi.org/10.1145/129712.129776openalex-snapshot
Simple and efficient bounded concurrent timestamping or bounded concurrent timestamp systems are comprehensible!
inferredcites →https://doi.org/10.1145/361082.361093openalex-snapshot
A new solution of Dijkstra's concurrent programming problem
inferredcites →https://doi.org/10.1145/41840.41848openalex-snapshot
On processor coordination using asynchronous hardware
inferredcites →https://doi.org/10.1145/73007.73051openalex-snapshot
Bounded concurrrent time-stamp systems are constructible
inferredcites →https://doi.org/10.1145/800133.804335openalex-snapshot
A new solution to the critical section problem
inferredcites →https://doi.org/10.21236/ada213853openalex-snapshot
Bounded Concurrent Time-Stamp Systems Are Constructible
inferredcites →https://doi.org/10.4153/cmb-1971-007-1openalex-snapshot
A Constructive Solution to a Tournament Problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.1999.1025openalex-snapshot
Efficient and Robust Sharing of Memory in Message-Passing Systems
inferred← citeshttps://doi.org/10.1007/3-540-36108-1_8openalex-snapshot
Simple Wait-Free Multireader Registers
inferred← citeshttps://doi.org/10.1007/3-540-57271-6_27openalex-snapshot
Efficient algorithms for checking the atomicity of a run of read and write operations
inferred← citeshttps://doi.org/10.1007/3-540-61769-8_5openalex-snapshot
Efficient and robust sharing of memory in message-passing systems
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_183openalex-snapshot
Implementing Shared Registers in Asynchronous Message-Passing Systems
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_183openalex-snapshot
Implementing Shared Registers in Asynchronous Message-Passing Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-09581-3_8openalex-snapshot
Practically Self-stabilizing Paxos Replicated State-Machine
inferred← citeshttps://doi.org/10.1007/978-3-319-46140-3_12openalex-snapshot
Asynchronous Consensus with Bounded Memory
inferred← citeshttps://doi.org/10.1007/978-3-540-30140-0_65openalex-snapshot
Multi-word Atomic Read/Write Registers on Multiprocessor Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-30186-8_5openalex-snapshot
The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-30577-4_3openalex-snapshot
How Hard Is It to Take a Snapshot?
inferred← citeshttps://doi.org/10.1007/978-3-540-75142-7_19openalex-snapshot
The Space Complexity of Unbounded Timestamps
inferred← citeshttps://doi.org/10.1007/978-3-642-15763-9_49openalex-snapshot
Brief Announcement: Sharing Memory in a Self-stabilizing Manner
inferred← citeshttps://doi.org/10.1007/978-3-642-24550-3_4openalex-snapshot
Pragmatic Self-stabilization of Atomic Memory in Message-Passing Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-35476-2_10openalex-snapshot
Crash Resilient and Pseudo-Stabilizing Atomic Registers
inferred← citeshttps://doi.org/10.1007/bf01177745openalex-snapshot
Efficient algorithms for checking the atomicity of a run of read and write operations
inferred← citeshttps://doi.org/10.1007/bf02242714openalex-snapshot
Atomic snapshots using lattice agreement
inferred← citeshttps://doi.org/10.1007/s00224-020-09993-6openalex-snapshot
Space Lower Bounds for the Signal Detection Problem
inferred← citeshttps://doi.org/10.1007/s00236-011-0132-0openalex-snapshot
Nonatomic dual bakery algorithm with bounded tokens
inferred← citeshttps://doi.org/10.1007/s00236-013-0178-2openalex-snapshot
Verifying a simplification of mutual exclusion by Lycklama–Hadzilacos
inferred← citeshttps://doi.org/10.1007/s002360050010openalex-snapshot
Efficient algorithms for checking the atomicity of a run of read and write operations
inferred← citeshttps://doi.org/10.1007/s00446-008-0060-6openalex-snapshot
The space complexity of unbounded timestamps
inferred← citeshttps://doi.org/10.1007/s004460200071openalex-snapshot
Randomized two-process wait-free test-and-set
inferred← citeshttps://doi.org/10.1016/b978-0-12-415950-1.00013-6openalex-snapshot
Foundations of shared memory
inferred← citeshttps://doi.org/10.1016/b978-1-55860-348-6.50026-2openalex-snapshot
10.1016/b978-1-55860-348-6.50026-2
inferred← citeshttps://doi.org/10.1016/j.ic.2004.11.004openalex-snapshot
Time and space optimal implementations of atomic multi-writer register
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.09.004openalex-snapshot
Highly-fair bakery algorithm using symmetric tokens
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.06.004openalex-snapshot
Compositional competitiveness for distributed algorithms
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.11.014openalex-snapshot
Practically stabilizing SWMR atomic memory in message-passing systems
inferred← citeshttps://doi.org/10.1016/j.jpdc.2004.08.008openalex-snapshot
Constructing regular variables in message passing systems
inferred← citeshttps://doi.org/10.1016/j.scico.2013.03.003openalex-snapshot
Mechanical verification of Lamport’s Bakery algorithm
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00325-xopenalex-snapshot
Self-stabilizing ℓ-exclusion
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00412-6openalex-snapshot
Towards a practical snapshot algorithm
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00130-0openalex-snapshot
Self-stabilizing timestamps
inferred← citeshttps://doi.org/10.1109/71.920585openalex-snapshot
Self-stabilizing strong fairness under weak fairness
inferred← citeshttps://doi.org/10.1109/ipdps.2006.1639328openalex-snapshot
Relationships between communication models in networks using atomic registers
inferred← citeshttps://doi.org/10.1109/ipdps.2015.89openalex-snapshot
Stabilizing Byzantine-Fault Tolerant Storage
inferred← citeshttps://doi.org/10.1109/istcs.1995.377039openalex-snapshot
Towards a practical snapshot algorithm
inferred← citeshttps://doi.org/10.1109/tpds.2010.172openalex-snapshot
Yet Another Simple Solution for the Concurrent Programming Control Problem
inferred← citeshttps://doi.org/10.1137/s0097539790192647openalex-snapshot
Bounded Concurrent Time-Stamping
inferred← citeshttps://doi.org/10.1137/s0097539795279463openalex-snapshot
Atomic Snapshots in O ( n log n ) Operations
inferred← citeshttps://doi.org/10.1137/s0097539796307698openalex-snapshot
Wait-Free k -Set Agreement is Impossible: The Topology of Public Knowledge
inferred← citeshttps://doi.org/10.1145/1011767.1011818openalex-snapshot
The weakest failure detectors to solve certain fundamental problems in distributed computing
inferred← citeshttps://doi.org/10.1145/1146381.1146416openalex-snapshot
Single-scanner multi-writer snapshot implementations are fast!
inferred← citeshttps://doi.org/10.1145/1412228.1455262openalex-snapshot
Multiword atomic read/write registers on multiprocessor systems
inferred← citeshttps://doi.org/10.1145/1416729.1416777openalex-snapshot
Agreement and consistency without knowing the number of processes
inferred← citeshttps://doi.org/10.1145/164051.164055openalex-snapshot
Atomic snapshots in O(n log n) operations
inferred← citeshttps://doi.org/10.1145/167088.167122openalex-snapshot
Wait-free k -set agreement is impossible
inferred← citeshttps://doi.org/10.1145/1734213.1734216openalex-snapshot
Tight failure detection bounds on atomic object implementations
inferred← citeshttps://doi.org/10.1145/1883612.1883616openalex-snapshot
The failure detector abstraction
inferred← citeshttps://doi.org/10.1145/1993636.1993687openalex-snapshot
Linearizable implementations do not suffice for randomized distributed computation
inferred← citeshttps://doi.org/10.1145/1993806.1993826openalex-snapshot
The space complexity of long-lived and one-shot timestamp implementations
inferred← citeshttps://doi.org/10.1145/200836.200869openalex-snapshot
Sharing memory robustly in message-passing systems
inferred← citeshttps://doi.org/10.1145/224964.224976openalex-snapshot
Failure detectors and the wait-free hierarchy (extended abstract)
inferred← citeshttps://doi.org/10.1145/237814.237869openalex-snapshot
Modular competitiveness for distributed algorithms
inferred← citeshttps://doi.org/10.1145/2559904openalex-snapshot
The Space Complexity of Long-Lived and One-Shot Timestamp Implementations
inferred← citeshttps://doi.org/10.1145/2933057.2933095openalex-snapshot
Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems
inferred← citeshttps://doi.org/10.1145/3519270.3538446openalex-snapshot
Blunting an Adversary Against Randomized Concurrent Programs with Linearizable Implementations
inferred← citeshttps://doi.org/10.1145/505241.505246openalex-snapshot
Bounded concurrent timestamp systems using vector clocks
inferred← citeshttps://doi.org/10.1186/s13638-020-01665-wopenalex-snapshot
Digital signature scheme for information non-repudiation in blockchain: a state of the art review
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0202003openalex-snapshot
Simple Optimal Wait-free Multireader Registers
inferred← citeshttps://doi.org/10.5075/epfl-thesis-3262openalex-snapshot
Synchronization using failure detectors
inferred← citeshttps://doi.org/10.70675/52d46fa0zd44dz4171z976azca17c71661c8openalex-snapshot
Synchronization and Fault-tolerance in Distributed Algorithms
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.