Appraising two decades of distributed computing theory research
From MaRDI portal
Publication:5138493
DOI10.1007/s00446-003-0096-6zbMath1448.68026OpenAlexW2141198979MaRDI QIDQ5138493
Michael J. Fischer, Michael Merritt
Publication date: 4 December 2020
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-003-0096-6
Related Items (2)
About informatics, distributed computing, and our job: a personal view ⋮ Set-constrained delivery broadcast: a communication abstraction for Read/write implementable distributed objects
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The temporal semantics of concurrent programs
- Modern cryptography, probabilistic proofs and pseudo-randomness
- General recursive functions of natural numbers
- On the minimal synchronism needed for distributed consensus
- Reaching Agreement in the Presence of Faults
- Time, clocks, and the ordering of events in a distributed system
- Unreliable failure detectors for reliable distributed systems
- Algorithms, games, and the internet
- The structure of the “THE”-multiprogramming system
- An Unsolvable Problem of Elementary Number Theory
- On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
- Algorithmic mechanism design
This page was built for publication: Appraising two decades of distributed computing theory research