- The Impatient May Use Limited Optimism to Minimize Regret Michael Cadilhac Guillermo A. Pérez Marie van den Bogaard Thu 11 April 2019
- Continuous Reachability for Unordered Data Petri Nets is in PTime Utkarsh Gupta Preey Shah S. Akshay Piotr Hofman Thu 11 April 2019
- Constructing Inductive-Inductive Types in Cubical Type Theory Jasper Hugunin Thu 11 April 2019
- ROLL 1.0: ømega-Regular Language Learning Library Yong Li Xuechao Sun Andrea Turrini Yu-Fang Chen Junnan Xu Tue 09 April 2019
- ML, Visibly Pushdown Class Memory Automata, and Extended Branching Vector Addition Systems with States Conrad Cotton-Barratt Andrzej Murawski C.-H. Luke Ong Tue 09 April 2019
- Fixing Incremental Computation Mario Alvarez-Picallo Alex Eyers-Taylor Michael Peyton Jones C.-H. Luke Ong Tue 09 April 2019
- On the Relationship between Reachability Problems in Timed and Counter Automata Christoph Haase Joel Ouaknine James Worrell Tue 09 April 2019
- Copyful Streaming String Transducers Emmanuel Filiot Pierre-Alain Reynier Mon 08 April 2019
- Programmability of Chemical Reaction Networks Matthew Cook David Soloveichik Erik Winfree Jehoshua Bruck Fri 05 April 2019
- Reachability Problems for Continuous Chemical Reaction Networks Adam Case Jack H. Lutz D. M. Stull Fri 05 April 2019
- The Containment Problem for Unambiguous Register Automata Antoine Mottet Karin Quaas Thu 04 April 2019
- An Effective Decision Procedure for Linear Arithmetic over the Integers and Reals Bernard Boigelot Sébastien Jodogne Pierre Wolper Thu 04 April 2019
- Effective Definability of the Reachability Relation in Timed Automata Martin Franzle Karin Quaas Mahsa Shirmohammadi James Worrell Thu 04 April 2019
- Higher-Order Recursion Abstraction: How to Make Ackermann, Knuth and Conway Look Like a Bunch of Primitives, Figuratively Speaking Baltasar Trancón y Widemann Wed 03 April 2019
- Primitive recursion for higher-order abstract syntax Carsten Schurmann Joelle Despeyroux Frank Pfenning Wed 03 April 2019
- Type is Not a Type Albert R. Meyer Mark B. Reinhold Wed 03 April 2019
- The Turing way to parameterized complexity Marco Cesati Mon 01 April 2019
- Model-Checking Linear-Time Properties of Parametrized Asynchronous Shared-Memory Pushdown Systems Marie Fortin Anca Muscholl Igor Walukiewicz Sat 30 March 2019
- History-Dependent Nominal Mu-Calculus Clovis Eberhart Bartek Klin Sat 30 March 2019
- Separation and covering for group based concatenation hierarchies Thomas Place Marc Zeitoun Fri 29 March 2019
Library Size: 13G (12979 entries),
Last Updated: Apr 21, 2026, 15:38:46,
Build Time: N/A
