References

  1. Baruch Awerbuch, Petra Berenbrink, André Brinkmann & Christian Scheideler (2001): Simple Routing Strategies for Adversarial Systems. In: Proceedings of FOCS. IEEE Computer Society, pp. 158–167, doi:10.1109/SFCS.2001.959890.
  2. Baruch Awerbuch, André Brinkmann & Christian Scheideler (2003): Anycasting in Adversarial Systems: Routing and Admission Control. In: Proceedings of ICALP, Lecture Notes in Computer Science 2719. Springer, pp. 1153–1168, doi:10.1007/3-540-45061-0_88.
  3. Johan van Benthem (2005): An Essay on Sabotage and Obstruction. In: Mechanizing Mathematical Reasoning: Essays in Honor of Jörg H. Siekmann on the Occasion of His 60th Birthday, Lecture Notes in Computer Science 2605. Springer, pp. 268–276, doi:10.1007/978-3-540-32254-2_16.
  4. Allan Borodin & Ran El-Yaniv (1998): Online Computation and Competitive Analysis. Cambridge University Press.
  5. Andrea Corradini (2001): GETGRATS: A summary of scientific results (with annotated bibliography). Electronic Notes in Theoretical Computer Science 51, doi:10.1016/S1571-0661(04)80191-9.
  6. Stéphane Demri (2005): A reduction from DLP to PDL. Journal of Logic and Computation 15(5), pp. 767–785, doi:10.1093/logcom/exi043.
  7. David Eppstein, Zvi Galil & Giuseppe F. Italiano (1999): Dynamic graph algorithms. In: Mikhail J. Atallah: Algorithms and Theory of Computation Handbook, chapter 8. CRC Press, doi:10.1201/9781420049503-c9.
  8. Joan Feigenbaum & Sampath Kannan (2000): Dynamic Graph Algorithms. In: Kenneth H. Rosen: Handbook of Discrete and Combinatorial Mathematics, chapter 17.5. CRC Press, pp. 1142–1151, doi:10.1201/9781439832905.ch17.
  9. Amos Fiat & Gerhard J. Woeginger (1998): Online Algorithms: The State of the Art. Lecture Notes in Computer Science 1442. Springer, doi:10.1007/BFb0029561.
  10. Fabio Gadducci, Reiko Heckel & Manuel Koch (1998): A Fully Abstract Model for Graph-Interpreted Temporal Logic. In: Proceedings of TAGT, Lecture Notes in Computer Science 1764. Springer, pp. 310–322, doi:10.1007/978-3-540-46464-8_22.
  11. Nina Gierasimczuk, Lena Kurzen & Fernando R. Velázquez-Quesada (2009): Learning and Teaching as a Game: A Sabotage Approach. In: Proceedings of LORI, Lecture Notes in Computer Science 5834. Springer, pp. 119–132, doi:10.1007/978-3-642-04893-7_10.
  12. Stefan Göller & Markus Lohrey (2006): Infinite State Model-Checking of Propositional Dynamic Logics. In: CSL, Lecture Notes in Computer Science 4207. Springer, pp. 349–364, doi:10.1007/11874683_23.
  13. Erich Grädel, Wolfgang Thomas & Thomas Wilke (2002): Automata, Logics, and Infinite Games: A Guide to Current Research. Lecture Notes in Computer Science 2500. Springer, doi:10.1007/3-540-36387-4.
  14. James Gross, Frank G. Radmacher & Wolfgang Thomas (2010): A Game-Theoretic Approach to Routing under Adversarial Conditions. In: Proceedings of IFIP TCS, IFIP 323. Springer, pp. 355–370, doi:10.1007/978-3-642-15240-5_26.
  15. Sten Grüner (2011): Game Theoretic Analysis of Dynamic Networks. Diploma thesis. RWTH Aachen. Available at http://www.plt.rwth-aachen.de/fileadmin/plt/Mitarbeiter/Gruener/diplomathesis_gruener.pdf.
  16. Jacob Holm, Kristian de Lichtenberg & Mikkel Thorup (2001): Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. Journal of the ACM 48(4), pp. 723–760, doi:10.1145/502090.502095.
  17. Dominik Klein, Frank G. Radmacher & Wolfgang Thomas (2010): Moving in a Network under Random Failures: A Complexity Analysis. Science of Computer Programming, doi:10.1016/j.scico.2010.05.009. Article in Press.
  18. Christof Löding & Philipp Rohde (2003): Solving the Sabotage Game is PSPACE-hard. Technical Report AIB-05-2003. RWTH Aachen. Available at http://aib.informatik.rwth-aachen.de/2003/.
  19. Riccardo Pucella & Vicky Weissman (2004): Reasoning about Dynamic Policies. In: FoSSaCS, Lecture Notes in Computer Science 2987. Springer, pp. 453–467, doi:10.1007/978-3-540-24727-2_32.
  20. Frank G. Radmacher & Wolfgang Thomas (2008): A Game Theoretic Approach to the Analysis of Dynamic Networks. In: Proceedings of VerAS, Electronic Notes in Theoretical Computer Science 200+.1667em(2). Elsevier, pp. 21–37, doi:10.1016/j.entcs.2008.02.010.
  21. Rajmohan Rajaraman (2002): Topology control and routing in ad hoc networks: a survey. SIGACT News 33(2), pp. 60–73, doi:10.1145/564585.564602.
  22. Liam Roditty & Uri Zwick (2004): A fully dynamic reachability algorithm for directed graphs with an almost linear update time. In: Proceedings of STOC. ACM, pp. 184–191, doi:10.1145/1007352.1007387.
  23. Philipp Rohde (2005): On Games and Logics over Dynamically Changing Structures. RWTH Aachen. Available at http://darwin.bth.rwth-aachen.de/opus3/volltexte/2006/1380/.
  24. Grzegorz Rozenberg (1997): Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations. World Scientific.
  25. Christian Scheideler (2002): Models and Techniques for Communication in Dynamic Networks. In: Proceedings of STACS, Lecture Notes in Computer Science 2285. Springer, pp. 27–49, doi:10.1007/3-540-45841-7_2.
  26. Wolfgang Thomas (1995): On the Synthesis of Strategies in Infinite Games. In: Proceedings of STACS, Lecture Notes in Computer Science 900. Springer, pp. 1–13, doi:10.1007/3-540-59042-0_57.
  27. Volker Weber & Thomas Schwentick (2007): Dynamic Complexity Theory Revisited. Theory of Computing Systems 40(4), pp. 355–377, doi:10.1007/s00224-006-1312-0.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org