The inherent price of indulgence

From MaRDI portal

Revision as of 15:39, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5170870

Jump to:navigation, search

DOI10.1145/571825.571838zbMath1292.68084OpenAlexW2044408943MaRDI QIDQ5170870

Partha Sharathi Dutta, Rachid Guerraoui

Publication date: 25 July 2014

Published in: Proceedings of the twenty-first annual symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: http://doc.rero.ch/record/314486/files/446_2005_Article_124.pdf

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15)

Related Items (2)

How to Solve Consensus in the Smallest Window of Synchrony ⋮ Generating fast indulgent algorithms

This page was built for publication: The inherent price of indulgence

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5170870&oldid=19732828"