scientific article; zbMATH DE number 7561451
From MaRDI portal
Publication:5091100
DOI10.4230/LIPIcs.OPODIS.2018.23MaRDI QIDQ5091100
Petr Kuznetsov, Nayuta Yanagisawa
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Cites Work
- Unnamed Item
- Unnamed Item
- More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
- On the uncontended complexity of anonymous agreement
- A characterization of \(t\)-resilient colorless task anonymous solvability
- Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers
- A classification of wait-free loop agreement tasks
- Relationships between broadcast and shared memory in reliable anonymous distributed systems
- Anonymous and fault-tolerant shared-memory computing
- Computation in networks of passively mobile finite-state sensors
- On the Space Complexity of Set Agreement
- Impossibility of distributed consensus with one faulty process
- Atomic snapshots of shared memory
- Sharing memory robustly in message-passing systems
- Randomized wait-free concurrent objects (extended abstract)
- Wait-free solvability of colorless tasks in anonymous shared-memory model
This page was built for publication:
