- Automata Terms in a Lazy WSkS Decision Procedure (Technical Report) Vojtěch Havlena Lukáš Holík Ondřej Lengál Tomáš Vojnar Tue 28 May 2019
- The Polynomial Hierarchy collapses Valentin Bura Tue 28 May 2019
- On Timed Scope-bounded Context-sensitive Languages Devendra. Bhave S. N. Krishna Ramchandra Phawade Ashutosh Trivedi Tue 28 May 2019
- Upper Bounds on the Quantifier Depth for Graph Differentiation in First-Order Logic Sandra Kiefer Pascal Schweitzer Tue 28 May 2019
- Simulations in Rank-Based Buchi Automata Complementation Yu-Fang Chen Vojtěch Havlena Ondřej Lengál Mon 20 May 2019
- Symbolic Monitoring against Specifications Parametric in Time and Data Masaki Waga Étienne André Ichiro Hasuo Sat 18 May 2019
- On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction A. M. Turing Fri 17 May 2019
- Proof assistants: History, ideas and future H. Geuvers Thu 16 May 2019
- holpy: Interactive Theorem Proving in Python Bohua Zhan Thu 16 May 2019
- Long-Run Average Behavior of Vector Addition Systems with States Krishnendu Chatterjee Thomas A. Henzinger Jan Otop Wed 15 May 2019
- The Quantifier Alternation Hierarchy of Synchronous Relations Diego Figueira Varun Ramanathan Pascal Weil Tue 14 May 2019
- Almost Optimal Strategies in One-Clock Priced Timed Automata Patricia Bouyer Kim Guldstrand Larsen Nicolas Markey Jacob Illum Rasmussen Mon 13 May 2019
- Lambda Calculus and Probabilistic Computation Claudia Faggian Simona Ronchi della Rocca Mon 13 May 2019
- A Survival Guide to Presburger Arithmetic Christoph Haase Sat 11 May 2019
- Robust Exponential Worst Cases for Divide-et-Impera Algorithms for Parity Games Massimo Benerecetti Daniele Dell'Erba Fabio Mogavero Sat 11 May 2019
- LambdaY-Calculus With Priorities Igor Walukiewicz Sat 11 May 2019
- An experiment with denotational semantics Blikle Andrzej Fri 10 May 2019
- Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time Paweł Parys Fri 10 May 2019
- Improving the complexity of Parys' recursive algorithm Karoliina Lehtinen Sven Schewe Dominik Wojtczak Fri 10 May 2019
- The height of piecewise-testable languages and the complexity of the logic of subwords Prateek Karandikar Philippe Schnoebelen Wed 08 May 2019
Library Size: 13G (12979 entries),
Last Updated: Apr 21, 2026, 15:38:46,
Build Time: N/A
