On the public citation graph

Adaptive solutions to the mutual exclusion problem

0 signed · 69 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.1016/0020-0190(93)90015-2openalex-snapshot

Speeding Lamport's fast mutual exclusion algorithm

inferredcites →https://doi.org/10.1016/0141-9331(89)90152-xopenalex-snapshot

Parallel program design: a foundation

inferredcites →https://doi.org/10.1109/71.80120openalex-snapshot

The performance of spin lock alternatives for shared-memory multiprocessors

inferredcites →https://doi.org/10.1109/real.1992.242680openalex-snapshot

Results about fast mutual exclusion

inferredcites →https://doi.org/10.1109/real.1992.242681openalex-snapshot

Timing-based mutual exclusion

inferredcites →https://doi.org/10.1109/sfcs.1977.32openalex-snapshot

The temporal logic of programs

inferredcites →https://doi.org/10.1109/tc.1983.1676201openalex-snapshot

The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel Computer

inferredcites →https://doi.org/10.1145/115372.115370openalex-snapshot

A first-come-first-served mutual-exclusion algorithm with small communication variables

inferredcites →https://doi.org/10.1145/135419.135453openalex-snapshot

Improving fast mutual exclusion

inferredcites →https://doi.org/10.1145/164051.164072openalex-snapshot

Fast, scalable synchronization with minimal hardware support

inferredcites →https://doi.org/10.1145/167088.167145openalex-snapshot

Contention in shared memory algorithms

inferredcites →https://doi.org/10.1145/181014.181382openalex-snapshot

Efficient low-contention parallel algorithms

inferredcites →https://doi.org/10.1145/355592.365595openalex-snapshot

Additional comments on a problem in concurrent programming control

inferredcites →https://doi.org/10.1145/357195.357199openalex-snapshot

A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables

inferredcites →https://doi.org/10.1145/357980.357989openalex-snapshot

Solution of a problem in concurrent programming control

inferredcites →https://doi.org/10.1145/361082.361093openalex-snapshot

A new solution of Dijkstra's concurrent programming problem

inferredcites →https://doi.org/10.1145/365559.365617openalex-snapshot

Solution of a problem in concurrent programming control

inferredcites →https://doi.org/10.1145/72935.72954openalex-snapshot

The APRAM: incorporating asynchrony into the PRAM model

inferredcites →https://doi.org/10.1145/7351.7352openalex-snapshot

A fast mutual exclusion algorithm

inferredcites →https://doi.org/10.1145/800105.803398openalex-snapshot

Economical solutions for the critical section problem in a distributed system (Extended Abstract)

inferredcites →https://doi.org/10.1145/800141.804654openalex-snapshot

Fast allocation of nearby resources in a distributed system

inferredcites →https://doi.org/10.21236/ada272947openalex-snapshot

Fast Mutual Exclusion, Even with Contention

inferredcites →https://doi.org/10.5555/314464.314666openalex-snapshot

The QRQW PRAM: accounting for contention in 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/11780823_2openalex-snapshot

Adapting to Point Contention with Long-Lived Safe Agreement

inferred← citeshttps://doi.org/10.1007/11795490_5openalex-snapshot

Can Memory Be Used Adaptively by Uniform Algorithms?

inferred← citeshttps://doi.org/10.1007/11945529_6openalex-snapshot

On the Cost of Uniform Protocols Whose Memory Consumption Is Adaptive to Interval Contention

inferred← citeshttps://doi.org/10.1007/3-540-40026-5_11openalex-snapshot

Computing with Infinitely Many Processes

inferred← citeshttps://doi.org/10.1007/3-540-40026-5_2openalex-snapshot

Adaptive Mutual Exclusion with Local Spinning

inferred← citeshttps://doi.org/10.1007/3-540-45414-4_1openalex-snapshot

A Time Complexity Bound for Adaptive Mutual Exclusion

inferred← citeshttps://doi.org/10.1007/3-540-48169-9_12openalex-snapshot

Fair and Efficient Mutual Exclusion Algorithms

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-39989-6_2openalex-snapshot

Uniform Solvability with a Finite Number of MWMR Registers

inferred← citeshttps://doi.org/10.1007/978-3-540-87779-0_7openalex-snapshot

Closing the Complexity Gap between FCFS Mutual Exclusion and Mutual Exclusion

inferred← citeshttps://doi.org/10.1007/978-3-540-87779-0_8openalex-snapshot

The Weakest Failure Detector for Message Passing Set-Agreement

inferred← citeshttps://doi.org/10.1007/978-3-642-39799-8_31openalex-snapshot

A Fully Verified Executable LTL Model Checker

inferred← citeshttps://doi.org/10.1007/bfb0056497openalex-snapshot

Deriving a scalable algorithm for mutual exclusion

inferred← citeshttps://doi.org/10.1007/pl00008923openalex-snapshot

A new fast-path mechanism for mutual exclusion

inferred← citeshttps://doi.org/10.1007/s00446-002-0084-2openalex-snapshot

An improved lower bound for the time complexity of mutual exclusion

inferred← citeshttps://doi.org/10.1007/s00446-003-0088-6openalex-snapshot

Shared-memory mutual exclusion: major research trends since 1986

inferred← citeshttps://doi.org/10.1007/s00446-006-0003-zopenalex-snapshot

Nonatomic mutual exclusion with local spinning

inferred← citeshttps://doi.org/10.1007/s00446-006-0009-6openalex-snapshot

Adaptive mutual exclusion with local spinning

inferred← citeshttps://doi.org/10.1007/s00446-010-0096-2openalex-snapshot

Closing the complexity gap between FCFS mutual exclusion and mutual exclusion

inferred← citeshttps://doi.org/10.1007/s00446-011-0152-6openalex-snapshot

A time complexity lower bound for adaptive mutual exclusion

inferred← citeshttps://doi.org/10.1007/s004460050039openalex-snapshot

Using local-spin k -exclusion algorithms to improve wait-free object implementations

inferred← citeshttps://doi.org/10.1007/s004460100067openalex-snapshot

An adaptive collect algorithm with applications

inferred← citeshttps://doi.org/10.1007/s004460100068openalex-snapshot

Adaptive and efficient mutual exclusion

inferred← citeshttps://doi.org/10.1016/j.ic.2013.11.007openalex-snapshot

Computing with infinitely many processes

inferred← citeshttps://doi.org/10.1016/j.tcs.2008.10.007openalex-snapshot

On the cost of uniform protocols whose memory consumption is adaptive to interval contention

inferred← citeshttps://doi.org/10.1016/j.tcs.2022.03.030openalex-snapshot

A visit to mutual exclusion in seven dates

inferred← citeshttps://doi.org/10.1109/icdcs.2006.21openalex-snapshot

Computing in the Presence of Timing Failures

inferred← citeshttps://doi.org/10.1109/icdsc.2001.918928openalex-snapshot

Backoff protocols for distributed mutual exclusion and ordering

inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181946openalex-snapshot

A simple algorithmic characterization of uniform solvability

inferred← citeshttps://doi.org/10.1137/070686445openalex-snapshot

An $O(1)$ RMRs Leader Election Algorithm

inferred← citeshttps://doi.org/10.1137/s0097539700366000openalex-snapshot

Adaptive and Efficient Algorithms for Lattice Agreement and Renaming

inferred← citeshttps://doi.org/10.1142/s012962649900044xopenalex-snapshot

SPEEDUP OF THE n-PROCESS MUTUAL EXCLUSION ALGORITHM

inferred← citeshttps://doi.org/10.1145/1146381.1146417openalex-snapshot

An O (1) RMRs leader election algorithm

inferred← citeshttps://doi.org/10.1145/167088.167145openalex-snapshot

Contention in shared memory algorithms

inferred← citeshttps://doi.org/10.1145/268999.269000openalex-snapshot

Contention in shared memory algorithms

inferred← citeshttps://doi.org/10.1145/301308.301335openalex-snapshot

Long-lived renaming made adaptive

inferred← citeshttps://doi.org/10.1145/343477.343525openalex-snapshot

Adaptive and efficient mutual exclusion (extended abstract)

inferred← citeshttps://doi.org/10.1145/383962.383967openalex-snapshot

Lamport on mutual exclusion

inferred← citeshttps://doi.org/10.1145/571825.571827openalex-snapshot

Nonatomic mutual exclusion with local spinning

inferred← citeshttps://doi.org/10.1145/792538.792541openalex-snapshot

Algorithms adapting to point contention

inferred← citeshttps://doi.org/10.1145/872035.872079openalex-snapshot

Adaptive and efficient abortable mutual exclusion

inferred← citeshttps://doi.org/10.1145/872035.872082openalex-snapshot

On using network attached disks as shared memory

inferred← citeshttps://doi.org/10.1145/954092.954102openalex-snapshot

ACM SIGACT news distributed computing column 13

inferred← citeshttps://doi.org/10.1145/992287.992298openalex-snapshot

A pleasant stroll through the land of infinitely many creatures

inferred← citeshttps://doi.org/10.25205/1818-7900-2023-21-2-5-17openalex-snapshot

On Solving Concurrent Process Problem in Process-Oriented Programs

inferred← citeshttps://doi.org/10.48550/arxiv.1310.7397openalex-snapshot

Deconstructing Queue-Based Mutual Exclusion

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.