On the public citation graph

Tight Bounds for Asynchronous Renaming

https://doi.org/10.1145/2597630
0 signed · 83 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.2000.1110openalex-snapshot
The Las-Vegas Processor Identity Problem (How and When to Be Unique)
inferredcites →https://doi.org/10.1006/jpdc.2001.1730openalex-snapshot
Time Bounds for Decision Problems in the Presence of Timing Uncertainty and Failures
inferredcites →https://doi.org/10.1007/11864219_29openalex-snapshot
Fully-Adaptive Algorithms for Long-Lived Renaming
inferredcites →https://doi.org/10.1007/3-540-56188-9_6openalex-snapshot
Wait-free test-and-set
inferredcites →https://doi.org/10.1007/978-1-4842-7077-6_3openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1007/978-3-642-15763-9_9openalex-snapshot
Fast Randomized Test-and-Set and Renaming
inferredcites →https://doi.org/10.1007/978-3-642-24100-0_7openalex-snapshot
Sub-logarithmic Test-and-Set against a Weak Adversary
inferredcites →https://doi.org/10.1007/978-3-642-31104-8_17openalex-snapshot
Early Deciding Synchronous Renaming in O( logf ) Rounds or Less
inferredcites →https://doi.org/10.1007/bf01783662openalex-snapshot
Asymptotically optimal algorithms for approximate agreement
inferredcites →https://doi.org/10.1007/bf01784242openalex-snapshot
A fast, scalable mutual exclusion algorithm
inferredcites →https://doi.org/10.1007/bf02242714openalex-snapshot
Atomic snapshots using lattice agreement
inferredcites →https://doi.org/10.1007/bfb0022433openalex-snapshot
Distributed Algorithms
inferredcites →https://doi.org/10.1007/bfb0056480openalex-snapshot
Long-lived, fast, waitfree renaming with optimal name space and high throughput
inferredcites →https://doi.org/10.1007/s00446-005-0143-6openalex-snapshot
Efficient adaptive collect using randomization
inferredcites →https://doi.org/10.1007/s00446-010-0108-2openalex-snapshot
New combinatorial topology bounds for renaming: the lower bound
inferredcites →https://doi.org/10.1007/s00446-011-0137-5openalex-snapshot
Fully-adaptive algorithms for long-lived renaming
inferredcites →https://doi.org/10.1007/s00446-011-0152-6openalex-snapshot
A time complexity lower bound for adaptive mutual exclusion
inferredcites →https://doi.org/10.1007/s004460050039openalex-snapshot
Using local-spin k -exclusion algorithms to improve wait-free object implementations
inferredcites →https://doi.org/10.1007/s004460050045openalex-snapshot
Randomized naming using wait-free shared variables
inferredcites →https://doi.org/10.1007/s004460100068openalex-snapshot
Adaptive and efficient mutual exclusion
inferredcites →https://doi.org/10.1007/s004460200071openalex-snapshot
Randomized two-process wait-free test-and-set
inferredcites →https://doi.org/10.1016/0020-0190(90)90103-5openalex-snapshot
The processor identity problem
inferredcites →https://doi.org/10.1016/0167-6423(95)00009-hopenalex-snapshot
Wait-free algorithms for fast, long-lived renaming
inferredcites →https://doi.org/10.1016/c2011-0-06993-4openalex-snapshot
The Art of Multiprocessor Programming
inferredcites →https://doi.org/10.1016/j.tcs.2010.06.001openalex-snapshot
Strong order-preserving renaming in the synchronous message passing model
inferredcites →https://doi.org/10.1016/s0304-3975(98)00242-4openalex-snapshot
Wait-free implementations in message-passing systems
inferredcites →https://doi.org/10.1093/comjnl/17.4.324openalex-snapshot
The Art of Computer Programming, Volume 3, Sorting and Searching
inferredcites →https://doi.org/10.1109/focs.2011.66openalex-snapshot
The Complexity of Renaming
inferredcites →https://doi.org/10.1109/focs.2011.84openalex-snapshot
Mutual Exclusion with O(log^2 Log n) Amortized Work
inferredcites →https://doi.org/10.1109/sfcs.2005.47openalex-snapshot
Linear Lower Bounds on Real-World Implementations of Concurrent Objects
inferredcites →https://doi.org/10.1109/tpds.2009.60openalex-snapshot
Time and Space Lower Bounds for Implementations Using k-CAS
inferredcites →https://doi.org/10.1137/0215006openalex-snapshot
Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
inferredcites →https://doi.org/10.1137/070686445openalex-snapshot
An $O(1)$ RMRs Leader Election Algorithm
inferredcites →https://doi.org/10.1137/s0097539700366000openalex-snapshot
Adaptive and Efficient Algorithms for Lattice Agreement and Renaming
inferredcites →https://doi.org/10.1137/s0097539797317299openalex-snapshot
Time and Space Lower Bounds for Nonblocking Implementations
inferredcites →https://doi.org/10.1145/114005.102808openalex-snapshot
Wait-free synchronization
inferredcites →https://doi.org/10.1145/1281100.1281105openalex-snapshot
Constant-RMR implementations of CAS and other synchronization primitives using read and write operations
inferredcites →https://doi.org/10.1145/1374376.1374410openalex-snapshot
Tight RMR lower bounds for mutual exclusion and other problems
inferredcites →https://doi.org/10.1145/1400751.1400801openalex-snapshot
Asynchronous exclusive selection
inferredcites →https://doi.org/10.1145/1536414.1536428openalex-snapshot
The extended BG-simulation and the characterization of t-resiliency
inferredcites →https://doi.org/10.1145/153724.153741openalex-snapshot
Atomic snapshots of shared memory
inferredcites →https://doi.org/10.1145/164051.164056openalex-snapshot
Immediate atomic snapshots and fast renaming
inferredcites →https://doi.org/10.1145/185675.185815openalex-snapshot
Counting networks
inferredcites →https://doi.org/10.1145/1993636.1993687openalex-snapshot
Linearizable implementations do not suffice for randomized distributed computation
inferredcites →https://doi.org/10.1145/1993806.1993850openalex-snapshot
Optimal-time adaptive strong renaming, with applications to counting
inferredcites →https://doi.org/10.1145/2108242.2108244openalex-snapshot
Polylogarithmic concurrent data structures from monotone circuits
inferredcites →https://doi.org/10.1145/2108242.2108245openalex-snapshot
New combinatorial topology bounds for renaming
inferredcites →https://doi.org/10.1145/2332432.2332507openalex-snapshot
Faster than optimal snapshots (for a while)
inferredcites →https://doi.org/10.1145/248052.248078openalex-snapshot
Fast, long-lived renaming improved and simplified
inferredcites →https://doi.org/10.1145/277697.277735openalex-snapshot
A time complexity lower bound for randomized implementations of some shared objects
inferredcites →https://doi.org/10.1145/301308.301335openalex-snapshot
Long-lived renaming made adaptive
inferredcites →https://doi.org/10.1145/301308.301338openalex-snapshot
Fast, wait-free (2 k -1)-renaming
inferredcites →https://doi.org/10.1145/322186.322188openalex-snapshot
Reaching Agreement in the Presence of Faults
inferredcites →https://doi.org/10.1145/331524.331529openalex-snapshot
The topological structure of asynchronous computability
inferredcites →https://doi.org/10.1145/357980.357989openalex-snapshot
Solution of a problem in concurrent programming control
inferredcites →https://doi.org/10.1145/365559.365617openalex-snapshot
Solution of a problem in concurrent programming control
inferredcites →https://doi.org/10.1145/72981.72991openalex-snapshot
The ambiguity of choosing
inferredcites →https://doi.org/10.1145/72981.73003openalex-snapshot
Shared-memory vs. message-passing in an asynchronous distributed environment
inferredcites →https://doi.org/10.1145/7351.7352openalex-snapshot
A fast mutual exclusion algorithm
inferredcites →https://doi.org/10.1145/78969.78972openalex-snapshot
Linearizability: a correctness condition for concurrent objects
inferredcites →https://doi.org/10.1145/79147.79158openalex-snapshot
Renaming in an asynchronous environment
inferredcites →https://doi.org/10.1145/800061.808726openalex-snapshot
An 0(n log n) sorting network
inferredcites →https://doi.org/10.12694/scpe.v4i2.231openalex-snapshot
Distributed Computing: Fundamentals, Simulations and Advanced Topics

What points at this work

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

inferred← citeshttps://doi.org/10.1016/j.ipl.2021.106173openalex-snapshot
Randomized consensus with regular registers
inferred← citeshttps://doi.org/10.1016/j.jpdc.2017.05.010openalex-snapshot
Poly-logarithmic adaptive algorithms require revealing primitives
inferred← citeshttps://doi.org/10.1016/j.jpdc.2021.01.002openalex-snapshot
Randomized renaming in shared memory systems
inferred← citeshttps://doi.org/10.1109/ipdps.2015.77openalex-snapshot
Randomized Renaming in Shared Memory Systems
inferred← citeshttps://doi.org/10.1145/2611462.2611499openalex-snapshot
Balls-into-leaves
inferred← citeshttps://doi.org/10.1145/2684464.2684471openalex-snapshot
Splitting and Renaming with a Majority of Faulty Processes
inferred← citeshttps://doi.org/10.1145/2767386.2767420openalex-snapshot
How To Elect a Leader Faster than a Tournament
inferred← citeshttps://doi.org/10.1145/2851141.2851155openalex-snapshot
Lease/release
inferred← citeshttps://doi.org/10.1145/3016078.2851155openalex-snapshot
Lease/release
inferred← citeshttps://doi.org/10.1145/3087801.3087810openalex-snapshot
The Power of Choice in Priority Scheduling
inferred← citeshttps://doi.org/10.1145/3087801.3087841openalex-snapshot
Brief Announcement
inferred← citeshttps://doi.org/10.1145/3132168openalex-snapshot
Lease/Release
inferred← citeshttps://doi.org/10.1145/3154273.3154306openalex-snapshot
On the Importance of Synchronization Primitives with Low Consensus Numbers
inferred← citeshttps://doi.org/10.1145/3210377.3210411openalex-snapshot
Distributionally Linearizable Data Structures
inferred← citeshttps://doi.org/10.1145/3323165.3323201openalex-snapshot
Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers
inferred← citeshttps://doi.org/10.1145/3465084.3467925openalex-snapshot
On Register Linearizability and Termination
inferred← citeshttps://doi.org/10.1145/3732772.3733528openalex-snapshot
Improving Efficiency in Near-State and State-Optimal Self-Stabilising Leader Election Population Protocols
inferred← citeshttps://doi.org/10.4230/lipics.disc.2021.4openalex-snapshot
Lower Bounds for Shared-Memory Leader Election Under Bounded Write Contention
inferred← citeshttps://doi.org/10.48550/arxiv.1507.02272openalex-snapshot
Anonymous Processors with Synchronous Shared Memory
inferred← citeshttps://doi.org/10.48550/arxiv.1512.09314openalex-snapshot
Asynchronous Exclusive Selection
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.