scientific article; zbMATH DE number 1351080

DOI10.4086/CJTCS.1999.009zbMATH Open0924.68081OpenAlexW4237184318MaRDI QIDQ4267802FDOQ4267802

Authors: Martha J. Kosa 

Publication date: 20 October 1999

Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/cjtcs.1999.009

Title of this publication is not available (Why is that?)

Recommendations

• Improved time bounds for linearizable implementations of abstract data types
• Implementing hybrid consistency with high-level synchronization operations
• Linearizable read/write objects
• scientific article; zbMATH DE number 1983294
• Time-Adaptive Algorithms for Synchronization

zbMATH Keywords

sequential consistencylinearizabilityspecific types

Mathematics Subject Classification ID

Data structures (68P05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computer system organization (68M99)

Cited In (10)

• Anomalies and similarities among consensus numbers of variously-relaxed queues
• Hybrid concurrency control for abstract data types
• Implementing hybrid consistency with high-level synchronization operations
• Implementing set objects in dynamic distributed systems
• Parallel Processing and Applied Mathematics
• Hundreds of impossibility results for distributed computing
• Improved time bounds for linearizable implementations of abstract data types
• Brief Announcement: Improved, Partially-Tight Multiplicity Queue Lower Bounds
• Relaxed data types as consistency conditions
• Lower bounds on message passing implementations of multiplicity-relaxed queues and stacks

This page was built for publication:

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