Time bounds for decision problems in the presence of timing uncertainty and failures

DOI10.1006/JPDC.2001.1730zbMath0988.68172OpenAlexW2006656863MaRDI QIDQ5949496

Hagit Attiya, Taly Djerassi-Shintel

Publication date: 22 July 2002

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jpdc.2001.1730

zbMATH Keywords

decision problemsdistributed message-passing system

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (6)

Tight Bounds for Asynchronous Renaming ⋮ Renaming in synchronous message passing systems with Byzantine failures ⋮ Hundreds of impossibility results for distributed computing ⋮ Fully-adaptive algorithms for long-lived renaming ⋮ Strong order-preserving renaming in the synchronous message passing model ⋮ Structured Derivation of Semi-Synchronous Algorithms

This page was built for publication: Time bounds for decision problems in the presence of timing uncertainty and failures