Roman Rabinovich

Address
Mathematische Grundlagen der InformatikRWTH Aachen
D-52056 Aachen
| Phone: | +49-241-80-21711 |
| Fax: | +49-241-80-22215 |
| Room: | 4114a (E1) / Ahornstr. 55 |
| Email: | rabinovich [AT] logic.rwth-aachen.de |
Office Hours
By appointmentResearch
- Graph complexity measures
- Finite-state strategies for games
- Decompositions of directed graphs
Teaching
- Summer Term 2011
- Winter Term 2010/2011
- Summer Term 2010
- Winter Term 2009/2010
- Summer Term 2009
- Winter Term 2008/09
Talks
- Slides for the talk at GAMES, Paris 2011
- Slides for the talk at Pupil University Computer Science, Aachen 08.2011 and Lecture Series Computer Science, RWTH Aachen University
- Slides for the talk at the Joint Workshop of Research Training Schools I, Dagstuhl 06.2011
- Slides for the talk at AlgoSyn Seminar, Dagstuhl 03.2011
- Slides for the talk at GAMES, Oxford 2010
- Slides for the talk at LINT midterm meeting, Paris 2010
- Slides for the talk at GASICS, Aalborg 2010
- Slides for the talk at AlgoSyn (DFG Research Training Group), Aachen 2010
- Slides for the talk at FCT , Wroclaw 2009
- Slides for the talk at GAMES , Warsaw 2008
Recent Publications
- E. Grädel, Ł. Kaiser, D. Berwanger, and R. Rabinovich. Entanglement and the Complexity Measures for Directed Graphs. Submitted for publication.
- D. Neider, R. Rabinovich, and M. Zimmermann. Solving Muller Games via Safety Games. Technical Report. RWTH Aachen University, 2011.
- B. Puchala and R. Rabinovich. Graph Searching, Parity Games and Imperfect Information. arXiv:1110.5575v1 [cs.GT], 2011.
- B. Puchala and R. Rabinovich. Parity Games with Partial Information Played on Graphs of Bounded Complexity. In Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science 2010, MFCS '10, vol. 6281 of LNCS, pp. 604–615. Springer, 2010.
- E. Grädel, Ł. Kaiser, and R. Rabinovich. Directed Graphs of Entanglement Two. In Proceedings of the 17th International Symposium on Fundamentals of Computation Theory, FCT '09, vol. 5699 of LNCS, pp. 169–181. Springer, 2009.