- On the Complexity of Counter Reachability Games Julien Reichert Thu 03 April 2014
- On The Complexity of Counter Reachability Games Julien Reichert Thu 03 April 2014
- The Complexity of Robot Games on the Integer Line Arjun Arul Julien Reichert Thu 03 April 2014
- GO Is Polynomial-Space Hard David Lichtenstein Michael Sipser Thu 03 April 2014
- Complex Tropical Currents, Extremality, and Approximations Farhad Babaee Mon 31 March 2014
- Logic for Communicating Automata with Parameterized Topology Benedikt Bollig Mon 31 March 2014
- A Note on the Complexity of Model-Checking Bounded Multi-Pushdown Systems Kshitij Bansal Stéphane Demri Mon 31 March 2014
- Model-Checking Bounded Multi-Pushdown Systems Kshitij Bansal Stéphane Demri Mon 31 March 2014
- Layered Transducing Term Rewriting System and Its Recognizability Preserving Property Yohei Fujinaka Mon 31 March 2014
- LALBLC a Program Testing the Equivalence of Dpda's Patrick Henry Géraud Sénizergues Sat 29 March 2014
- Handlers in Action Ohad Kammar Sam Lindley Nicolas Oury Sat 29 March 2014
- Value 1 Problem for Probabilistic Automata Eldon Kelmendi Sat 29 March 2014
- Stone Duality for Markov Processes Dexter Kozen Kim G. Larsen Radu Mardare Prakash Panangaden Sat 29 March 2014
- Efficient Computing of Least Fixpoints Krzysztof R. Apt Sat 29 March 2014
- Regular Böhm trees Gèrard Huet Sat 29 March 2014
- Polymorphism is Set Theoretic, Constructively Andrew M. Pitts Sat 29 March 2014
- Banach-Mazur Games with Simple Winning Strategies Simon Robert Leßenich Sat 29 March 2014
- Bøhm-Like Trees for Term Rewriting Systems Jeroen Ketema Sat 29 March 2014
- Introduction to Generalized Type Systems Henk Barendregt Sat 29 March 2014
- Candy Crush is NP-hard Toby Walsh Sat 29 March 2014
Library Size: 13G (12984 entries),
Last Updated: Apr 23, 2026, 21:48:37,
Build Time: N/A
