Moving in a network under random failures: a complexity analysis
DOI10.1016/J.SCICO.2010.05.009zbMATH Open1242.68031OpenAlexW2108590202MaRDI QIDQ433350FDOQ433350
Authors: Dominik Klein, Frank G. Radmacher, Wolfgang Thomas 
Publication date: 13 July 2012
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.scico.2010.05.009
Recommendations
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Applications of game theory (91A80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) 2-person games (91A05) Reliability, testing and fault tolerance of networks and computer systems (68M15) Games involving graphs (91A43)
Cites Work
- Title not available (Why is that?)
- The complexity of probabilistic verification
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Stochastic Boolean satisfiability
- A game theoretic approach to the analysis of dynamic networks
- Learning and teaching as a game: A sabotage approach
- Mathematical Foundations of Computer Science 2003
- Mechanizing Mathematical Reasoning
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Games against nature
- The complexity of reachability in randomized sabotage games
- Computer Science Logic
- Introducing Reactive Kripke Semantics and Arc Accessibility
Cited In (6)
This page was built for publication: Moving in a network under random failures: a complexity analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q433350)
