Skip to main content
Conference Proceedings

Sub-logarithmic test-and-set against a weak adversary

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6950 LNCS 97-109
DOI: 10.1007/978-3-642-24100-0_7
22Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A randomized implementation is given of a test-and-set register with O(log log n) individual step complexity and O(n) total step complexity against an oblivious adversary. The implementation is linearizable and multi-shot, and shows an exponential complexity improvement over previous solutions designed to work against a strong adversary. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Alistarh, D., & Aspnes, J. (2011). Sub-logarithmic test-and-set against a weak adversary. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6950 LNCS, pp. 97–109). https://doi.org/10.1007/978-3-642-24100-0_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free