- On delay and regret determinization of max-plus automata Emmanuel Filiot Ismael Jecker Nathan Lhote Guillermo A. Perez Jean-Francois Raskin Fri 02 March 2012
- Parity objectives in countable MDPs Stefan Kiefer Richard Mayr Mahsa Shirmohammadi Dominik Wojtczakz Fri 02 March 2012
- Perfect half space games Thomas Colcombet Marcin Jurdzinski Ranko Lazic Sylvain Schmitz Fri 02 March 2012
- The homomorphism problem for regular graph patterns Miguel Romero Pablo Barcelo Moshe Y. Vardi Fri 02 March 2012
- The pebbling comonad in Finite Model Theory Samson Abramsky Anuj Dawar Pengming Wang Fri 02 March 2012
- Partial derivatives on graphs for Kleene allegories Yoshiki Nakamura Fri 02 March 2012
- First-order logic with counting Dietrich Kuske Nicole Schweikardt Fri 02 March 2012
- Strategy logic with imperfect information Raphael Berthon Bastien Maubert Aniello Murano Sasha Rubin Moshe Y. Vardi Fri 02 March 2012
- Separation and covering for group based concatenation hierarchies Thomas Place Marc Zeitoun Fri 02 March 2012
- Backprop as Functor: A compositional perspective on supervised learning Brendan Fong David Spivak Remy Tuyeras Fri 02 March 2012
- Differentiable Causal Computations via Delayed Trace David Sprunger Shin-ya Katsumata Fri 02 March 2012
- The Theory of Traces for Systems with Nondeterminism and Probability Filippo Bonchi Ana Sokolova Valeria Vignudelli Fri 02 March 2012
- Lambda Y-Calculus With Priorities Igor Walukiewicz Fri 02 March 2012
- Canonisation and Definability for Graphs of Bounded Rank Width Martin Grohe Daniel Neuen Fri 02 March 2012
- Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm Moritz Lichter Ilia Ponomarenko Pascal Schweitzer Fri 02 March 2012
- Lambda Calculus and Probabilistic Computation Claudia Faggian Simona Ronchi della Rocca Fri 02 March 2012
- No-Go Theorems for Distributive Laws Maaike Zwart Dan Marsden Fri 02 March 2012
- A type theory for cartesian closed bicategories (Extended Abstract) Marcelo Fiore Philip Saville Fri 02 March 2012
- Type-Based Complexity Analysis of Probabilistic Functional Programs Martin Avanzini Ugo Dal Lago Alexis Ghyselen Fri 02 March 2012
- A Near-Minimal Axiomatisation of ZX-Calculus for Pure Qubit Quantum Mechanics Renaud Vilmart Fri 02 March 2012
Library Size: 13G (12947 entries),
Last Updated: Apr 09, 2026, 18:14:57,
Build Time: N/A
