- Reachability relations of timed pushdown automata Lorenzo Clemente Sławomir Lasota Fri 01 January 2021
- Effective results on the Skolem Problem for linear recurrence sequences Min Sha Tue 29 December 2020
- On the zeros of linear recurrence sequences Francesco Amoroso Evelina Viada Tue 29 December 2020
- Some facts that should be better known, especially about rational functions A. J. van der Poorten Tue 29 December 2020
- On the Skolem problem and some related questions for parametric families of linear recurrence sequences Alina Ostafe Igor Shparlinski Tue 29 December 2020
- The distance between terms of an algebraic recurrence sequence. T.N. Shorey R. Tijdeman M. Mignotte Tue 29 December 2020
- Reachability relations of timed pushdown automata Lorenzo Clemente Sławomir Lasota Tue 29 December 2020
- Fast Computations on Ordered Nominal Sets David Venhoek Joshua Moerman Jurriaan Rot Sun 27 December 2020
- Equivalence Checking of Quantum Finite-State Machines Qisheng Wang Junyi Liu Mingsheng Ying Sun 27 December 2020
- On probabilistic stable event structures Nargess Ghahremani Julian Bradfield Sun 27 December 2020
- A lower bound for the coverability problem in acyclic pushdown VAS Matthias Englert Piotr Hofman Sławomir Lasota Ranko Lazić Jérôme Leroux Juliusz Straszyński Sun 27 December 2020
- Context-Free Timed Formalisms: Robust Automata and Linear Temporal Logics Laura Bozzelli Aniello Murano Adriano Peron Sun 27 December 2020
- On is an n-MCFL Kilian Gebhardt Frédéric Meunier Sylvain Salvati Sun 27 December 2020
- Subquadratic-Time Algorithms for Normal Bases Mark Giesbrecht Armin Jamshidpey Éric Schost Sun 27 December 2020
- Intersection Types and (Positive) Almost-Sure Termination Ugo Dal Lago Claudia Faggian Simona Ronchi Della Rocca Sun 27 December 2020
- Formalizing the Ring of Witt Vectors Johan Commelin Robert Y. Lewis Sun 27 December 2020
- Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals Miika Hannula Jonni Virtema Sun 27 December 2020
- Verifying Liveness Properties of ML Programs M. M. Lester R. P. Neatherway C. -H. L. Ong S. J. Ramsay Sun 27 December 2020
- Descriptional complexity of nfa of different ambiguity Hing Leung Thu 17 December 2020
- Continuous Positional Payoffs Alexander Kozachinskiy Thu 17 December 2020
Library Size: 13G (12970 entries),
Last Updated: Apr 16, 2026, 08:51:39,
Build Time: N/A
