- Reachability is Harder for Directed Than for Undirected Finite Graphs Miklos Ajtai Ronald Fagin Tue 26 November 2019
- Unifying threads in Alfred Tarski's work Steven Givant Wed 20 November 2019
- Green's Relations in Finite Transformation Semigroups Lukas Fleischer Manfred Kufleitner Mon 18 November 2019
- Finite Automata, Digraph Connectivity, and Regular Expression Size Hermann Gruber Markus Holzer Mon 18 November 2019
- On the Time and Tape Complexity of Languages I III H. B. Hunt Mon 18 November 2019
- Decidable Theories Michael O. Rabin Fri 15 November 2019
- The Undecidability of Intuitionistic Theories of Algebraically Closed Fields and Real Closed Fields Dov M. Gabbay Fri 15 November 2019
- SL88 Grand - Manual N/A Wed 13 November 2019
- A Simple Differentiable Programming Language Martin Abadi Gordon Plotkin Wed 13 November 2019
- Wreath Products of Distributive Forest Algebras Michael Hahn Andreas Krebs Howard Straubing Tue 12 November 2019
- A Btextbackslash''uchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage Joost Engelfriet Heiko Vogler Tue 12 November 2019
- Forward Analysis for WSTS, Part III: Karp-Miller Trees Michael Blondin Alain Finkel Jean Goubault-Larrecq Thu 07 November 2019
- Reduction of Omega-Automata Using k-Lookahead Simulations Miriama Sasaráková Wed 06 November 2019
- Verifying Visibility-Based Weak Consistency Siddharth Krishna Michael Emmi Constantin Enea Dejan Jovanovic Wed 06 November 2019
- New Optimizations and Heuristics for Determinization of Buchi Automata Christof Løding Anton Pirogov Wed 06 November 2019
- Introduction to Univalent Foundations of Mathematics with Agda Martín Høtzel Escardó Tue 05 November 2019
- Controlling a random population Thomas Colcombet Nathanael Fijalkow Pierre Ohlmann Tue 05 November 2019
- Describing Graphs: A First-Order Approach to Graph Canonization Neil Immerman Eric Lander Mon 04 November 2019
- Timed Negotiations Sundararaman Akshay Blaise Genest Loic Hélouet Sharvik Mital Mon 04 November 2019
- Polynomial Probabilistic Invariants and the Optional Stopping Theorem Anne Schreuder C. -H. Luke Ong Tue 29 October 2019
Library Size: 13G (12979 entries),
Last Updated: Apr 21, 2026, 15:38:46,
Build Time: N/A
