Amanote Research

Amanote Research

    RegisterSign In

Locality and Checkability in Wait-Free Computing

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-24100-0_34
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2011

Authors
Pierre FraigniaudSergio RajsbaumCorentin Travers
Publisher

Springer Berlin Heidelberg


Related search

OpenMemDB: A Wait-Free, In-Memory Database

2019English

Fault-Tolerant Wait-Free Shared Objects

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
1998English

Mechanisms for Store-Wait-Free Multiprocessors

ACM SIGARCH Computer Architecture News
2007English

Mechanisms for Store-Wait-Free Multiprocessors

2007English

Wait-Free Handshaking Using Rainbow Colouring

Computer Journal
Computer Science
2000English

Wait-Free Shared-Memory Irradiance Caching

IEEE Computer Graphics and Applications
Computer GraphicsComputer-Aided DesignSoftware
2011English

Wait-Free Consensus With Infinite Arrivals

2002English

A Lower Bound on Wait-Free Counting

Journal of Algorithms
1997English

On Self-Stabilizing Wait-Free Clock Synchronization

Parallel Processing Letters
HardwareTheoretical Computer ScienceArchitectureSoftware
1997English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy