- Halting Problem for One-State Turing Machines Yannick Saouter Wed 11 October 2017
- The Halting Problem of one State Turing Machines with n-Dimensional Tape G. T. Herman Tue 10 October 2017
- The uniform halting problem for generalized one-state turing machines Gabor T. Herman Tue 10 October 2017
- Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete Michael Blondin Alain Finkel Stefan Goller Christoph Haase Pierre McKenzie Mon 09 October 2017
- A Universal Turing Machine with Two Internal States Claude E. Shannon Mon 09 October 2017
- The Covering Problem: A Unified Approach for Investigating the Expressive Power of Logics Thomas Place Marc Zeitoun Thu 05 October 2017
- Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games Véronique Bruyère Emmanuel Filiot Mickael Randour Jean-François Raskin Tue 26 September 2017
- Theorem Proving in Arithmetic without Multiplication D. C. Cooper Tue 26 September 2017
- Replication, refinement & reachability: complexity in dynamic condition-response graphs Søren Debois Thomas T. Hildebrandt Tijs Slaats Tue 26 September 2017
- Verifying Controllability of Time-Aware Business Processes Emanuele De Angelis Fabio Fioravanti Maria Chiara Meo Alberto Pettorossi Maurizio Proietti Mon 25 September 2017
- Regularity of non context-free languages over a singleton terminal alphabet Alberto Pettorossi Maurizio Proietti Mon 25 September 2017
- Symbolic Model Checking of Infinite State Systems Using Presburger Arithmetic Tevfik Bultan Richard Gerber William Pugh Sat 23 September 2017
- Konig's infinity lemma and Beth's tree theorem N/A Tue 19 September 2017
- An Ordered Approach to Solving Parity Games in Quasi Polynomial Time and Quasi Linear Space John Fearnley Sanjay Jain Sven Schewe Frank Stephan Dominik Wojtczak Mon 18 September 2017
- Separating regular languages with two quantifier alternations Thomas Place Sat 16 September 2017
- The Covering Problem Thomas Place Marc Zeitoun Sat 16 September 2017
- A New Characterization of Lambda Definability Achim Jung Jerzy Tiuryn Sun 10 September 2017
- Admissibility in Games with Imperfect Information (Invited Talk) Romain Brenguier Arno Pauly Jean-François Raskin Ocan Sankur Thu 07 September 2017
- Efficient Algorithms for Checking Fast Termination in VASS Tomáš Brázdil Krishnendu Chatterjee Antonín Kučera Petr Novotný Dominik Velan Wed 06 September 2017
- Backward Coverability with Pruning for Lossy Channel Systems Thomas Geffroy Jérôme Leroux Grégoire Sutre Wed 06 September 2017
Library Size: 13G (12984 entries),
Last Updated: Apr 23, 2026, 21:48:37,
Build Time: N/A
