A Time Complexity Lower Bound for Adaptive Mutual Exclusion

Distributed Computing - Germany
doi 10.1007/s00446-011-0152-6
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Lower-Bound Time-Complexity Analysis of Logic Programs

1997English

Tight RMR Lower Bounds for Mutual Exclusion and Other Problems

2008English

Lower Error Bound for Oversampled Subband Adaptive Filters

Electronics Letters
Electronic EngineeringElectrical
1998English

A Lower Bound for the Complexity of the Union-Split-Find Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1987English

A Lower Bound for the Time to Assure Interactive Consistency,

1981English

A Utility Accrual Scheduling Algorithm for Real-Time Activities With Mutual Exclusion Resource Constraints

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
2006English

A Simple Taxonomy for Distributed Mutual Exclusion Algorithms

Operating Systems Review (ACM)
HardwareComputer NetworksInformation SystemsArchitectureCommunications
1991English

A Queue Based Mutual Exclusion Algorithm

Acta Informatica
Computer NetworksSoftwareInformation SystemsCommunications
2008English

An Effective Lower Bound for Group Complexity of Finite Semigroups and Automata

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy