- Holonomic Techniques, Periods, and Decision Problems (Invited Talk) Joel Ouaknine Sun 13 December 2020
- Synthesis from Weighted Specifications with Partial Domains over Finite Words Emmanuel Filiot Christof Løding Sarah Winter Sun 13 December 2020
- On proof theory in computer science L. Gordeev E. H. Haeusler Sun 13 December 2020
- Probabilistic Timed Automata with One Clock and Initialised Clock-Dependent Probabilities Jeremy Sproston Fri 11 December 2020
- Optimizing tree decompositions in MSO Mikołaj Bojańczyk Michał Pilipczuk Fri 11 December 2020
- On Solvable Quintics X^5+aX+b and X^5+aX^2+b Blair K. Spearman Kenneth S. Williams Fri 04 December 2020
- Characterization of Solvable Quintics x5 + ax + b Blair K. Spearman Kenneth S. Williams Fri 04 December 2020
- Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity Arturo Carpi Flavio D'Alessandro Oscar H. Ibarra Ian McQuillan Mon 30 November 2020
- Implicitization of hypersurfaces John Abbott Anna Maria Bigatti Lorenzo Robbiano Fri 27 November 2020
- A Modern Compiler for the French Tax Code Denis Merigoux Raphael Monat Jonathan Protzenko Mon 23 November 2020
- Learning of Structurally Unambiguous Probabilistic Grammars Dolav Nitay Dana Fisman Michal Ziv-Ukelson Mon 23 November 2020
- Reachability in two-parametric timed automata with one parameter is EXPSPACE-complete Stefan Gøller Mathieu Hilaire Mon 23 November 2020
- Weighted automata are compact and actively learnable Artem Kaznatcheev Prakash Panangaden Mon 23 November 2020
- Hilbert's Tenth Problem for fields of rational functions over finite fields Thanases Pheidas Sat 21 November 2020
- A probabilistic remark on algebraic program testing Richard A. DeMillo Richard J. Lipton Sat 21 November 2020
- Minimisation of Multiplicity Tree Automata Stefan Kiefer Ines Marusic James Worrell Sat 21 November 2020
- Presburger's Article on Integer Arithmetic: Remarks and Translation Ryan Stansifer Sat 21 November 2020
- Complexity of Equivalence and Learning for Multiplicity Tree Automata Ines Marušic James Worrell Sat 21 November 2020
- Learning via automaton minimization and matrix factorization Ines Marusic Sat 21 November 2020
- Proof compression and NP versus PSPACE. Part 2 Lev Gordeev Thu 19 November 2020
Library Size: 13G (12970 entries),
Last Updated: Apr 16, 2026, 08:51:39,
Build Time: N/A
