scientific article; zbMATH DE number 1351080
From MaRDI portal
Publication:4267802
DOI10.4086/cjtcs.1999.009zbMath0924.68081OpenAlexW4237184318MaRDI QIDQ4267802
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: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Data structures (68P05) Computer system organization (68M99)
Related Items (7)
Implementing set objects in dynamic distributed systems ⋮ Improved time bounds for linearizable implementations of abstract data types ⋮ Brief Announcement: Improved, Partially-Tight Multiplicity Queue Lower Bounds ⋮ Anomalies and similarities among consensus numbers of variously-relaxed queues ⋮ Hundreds of impossibility results for distributed computing ⋮ Relaxed data types as consistency conditions ⋮ Lower bounds on message passing implementations of multiplicity-relaxed queues and stacks
This page was built for publication:
