stacs2017.thi.uni-hannover.de
Program | STACS 2017: Symposium on Theoretical Aspects of Computer Science
https://stacs2017.thi.uni-hannover.de/program
Will take place as a STACS satellite workshop at March 7-8. The conference guide (including the program) is now available for download: Download (PDF). Wednesday, March 8. Tutorial Session (14:00 17:00). Computational Aspects of Logics in Team Semantics. Thursday, March 9. Invited Talk (09:00 10:00). Discrete logarithms in small characteristic finite fields: A survey of recent advances. Session A (10:20 11:35). Parameterized complexity of small weight automorphisms. Stanislav Böhm, Stefan Göller. On the ...
concurrency.cs.uni-kl.de
Concurrency Theory Group - University of Kaiserslautern
http://concurrency.cs.uni-kl.de/publications/allpublications.html
Department of Computer Science. Complexity of regular abstractions of one-counter languages. By Mohammed Faouzi Atig. Accepted for LICS 2016. Antichains for Inclusion Games. By Lukas Holik, Roland Meyer. First-order logic with reachability for infinite-state systems. Accepted for LICS 2016. Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups. By Daniel König. Accepted for Contemporary Mathematics. Acceleration in Multi-PushDown Systems. And Mohammed Faouzi Atig. An Appro...
concurrency.informatik.uni-kl.de
Concurrency Theory Group - University of Kaiserslautern
http://concurrency.informatik.uni-kl.de/group.html
Department of Computer Science. Please follow the links to learn more about the members of our group. Prof Dr. rer. nat.). Dr rer. nat.). Roland Meyer will speak at the D-CON workshop. EATCS Distinguished Dissertation Award. The thesis “Monoids as Storage Mechanisms” (by Georg Zetzsche) received the EATCS Distinguished Dissertation Award. Roland Meyer will speak at the MEMICS workshop. Our project ArchiV: Architecture-aware Verification. Complexity of Regular Abstractions of One-Counter Languages. Roland...
concurrency.cs.uni-kl.de
Concurrency Theory Group - University of Kaiserslautern
http://concurrency.cs.uni-kl.de/group.html
Department of Computer Science. Please follow the links to learn more about the members of our group. Prof Dr. rer. nat.). Dr rer. nat.). Roland Meyer will speak at the D-CON workshop. EATCS Distinguished Dissertation Award. The thesis “Monoids as Storage Mechanisms” (by Georg Zetzsche) received the EATCS Distinguished Dissertation Award. Roland Meyer will speak at the MEMICS workshop. Our project ArchiV: Architecture-aware Verification. Complexity of Regular Abstractions of One-Counter Languages. Roland...
concurrency.informatik.uni-kl.de
Concurrency Theory Group - University of Kaiserslautern
http://concurrency.informatik.uni-kl.de/publications/allpublications.html
Department of Computer Science. Complexity of regular abstractions of one-counter languages. By Mohammed Faouzi Atig. Accepted for LICS 2016. Antichains for Inclusion Games. By Lukas Holik, Roland Meyer. First-order logic with reachability for infinite-state systems. Accepted for LICS 2016. Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups. By Daniel König. Accepted for Contemporary Mathematics. Acceleration in Multi-PushDown Systems. And Mohammed Faouzi Atig. An Appro...