Tight space bounds for -exclusion

DOI10.1007/978-3-642-24100-0_8zbMATH Open1350.68283OpenAlexW1697385393MaRDI QIDQ3095320FDOQ3095320

Gadi Taubenfeld

Publication date: 28 October 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24100-0_8

Recommendations

• Tight space bounds for \(\ell\)-exclusion
• Space and time efficient self-stabilizing \(\ell\)-exclusion in tree networks
• Bounds on shared memory for mutual exclusion
• Analysis of Some Lockout Avoidance Algorithms for the k-Exclusion Problem
• Self-stabilizing \(\ell\)-exclusion

zbMATH Keywords

space complexitymutual exclusiontight bounds\(\ell \)-exclusion

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Cites Work

• On interprocess communication. I: Basic formalism
• Impossibility of distributed consensus with one faulty process
• Bounds on shared memory for mutual exclusion
• The mutual exclusion problem
• Title not available (Why is that?)

Cited In (2)

• Tight space bounds for \(\ell\)-exclusion
• Sublogarithmic Bounds on Space and Reversals

This page was built for publication: Tight space bounds for \(\ell \)-exclusion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3095320)