- Reachability Analysis of Polynomial Systems Using Linear Programming Relaxations Mohamed Amin Ben Sassi Romain Testylier Thao Dang Antoine Girard Wed 20 January 2021
- Linear relaxations of polynomial positivity for polynomial Lyapunov function synthesis M. A. Ben Sassi S. Sankaranarayanan X. Chen E. Ábrahám Wed 20 January 2021
- On Some Non-Holonomic Sequences Stefan Gerhold Mon 18 January 2021
- An Elo-like System for Massive Multiplayer Competitions Aram Ebtekar Paul Liu Wed 13 January 2021
- Reiterman's Theorem on Finite Algebras for a Monad Jiri Adamek Liang-Ting Chen Stefan Milius Henning Urbat Wed 13 January 2021
- Yet another argument in favour of NP=CoNP Edward Hermann Haeusler Wed 13 January 2021
- Control of Real-time Systems with Integer Parameters A. Jovanovic D. Lime O. H. Roux Wed 13 January 2021
- Deciding Reachability under Persistent X86-TSO Parosh Aziz Abdulla Mohamed Faouzi Atig Ahmed Bouajjani K. Narayan Kumar Prakash Saivasan Wed 13 January 2021
- What's decidable about parametric timed automata Étienne André Wed 13 January 2021
- The Semiring Framework for Database Provenance Todd J. Green Val Tannen Wed 13 January 2021
- A Dependently Typed Linear pi-Calculus in Agda Luca Ciccone Luca Padovani Tue 12 January 2021
- Positive first-order logic on words Denis Kuperberg Thu 07 January 2021
- The equivalence problem for deterministic two-way sequential transducers is decidable E. M. Gurari Tue 05 January 2021
- Reducing Transducer Equivalence to Register Automata Problems Solved by ``Hilbert Method'' Adrien Boiret Radoslaw Piórkowski Janusz Schmude Tue 05 January 2021
- A bivariate generating function for zeta values and related supercongruences Roberto Tauraso Tue 05 January 2021
- On P Versus NP Lev Gordeev Tue 05 January 2021
- Transience in Countable MDPs Stefan Kiefer Richard Mayr Mahsa Shirmohammadi Patrick Totzke Tue 05 January 2021
- A circular version of Gødel's T and its abstraction complexity Anupam Das Tue 05 January 2021
- Generating Collection Transformations from Proofs Michael Benedikt Pierre Pradic Tue 05 January 2021
- A Computational Interpretation of Compact Closed Categories: Reversible Programming with Negative and Fractional Types Chao-Hong Chen Amr Sabry Tue 05 January 2021
Library Size: 13G (12952 entries),
Last Updated: Apr 13, 2026, 17:04:26,
Build Time: N/A
