- Checking NFA Equivalence with Bisimulations Up to Congruence Filippo Bonchi Damien Pous Sat 28 December 2013
- Lazy Abstractions for Timed Automata Frédéric Herbreteau B. Srivathsan Igor Walukiewicz Sat 28 December 2013
- Efficient Emptiness Check for Timed Buchi Automata Frédéric Herbreteau B. Srivathsan Igor Walukiewicz Sat 28 December 2013
- The Ackermann Award 2013 Anuj Dawar Thomas A. Henzinger Damian Niwiński Sat 28 December 2013
- Algorithmic solution of higher type equations Martín Escardó Sat 28 December 2013
- Exhaustible sets in higher-type computation Martin Escardo Sat 28 December 2013
- Set Systems: Order Types, Continuous Nondeterministic Deformations, and Quasi-orders Yohji Akama Sat 28 December 2013
- A quasi-order on continuous functions Raphael Carroy Sat 28 December 2013
- A new order theory of set systems and better quasi-orderings Yohji Akama Fri 27 December 2013
- Higman's Theorem and the Multiset Order Ian Wehrman Fri 27 December 2013
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture Joseph B Kruskal Fri 27 December 2013
- Logical relations and the typed lambda-calculus R. Statman Fri 27 December 2013
- Bounds in w-Regularity Mikolaj Bojanczyk Thomas Colcombet Fri 27 December 2013
- The Size-Change Termination Principle for Constructor Based Languages Pierre Hyvernat Fri 27 December 2013
- A machine-assisted view of paraconsistency Jesse Alama Fri 27 December 2013
- Bisimulation equivalence of first-order grammars is Ackermann-hard Petr Jancar Fri 27 December 2013
- Ordered Models of the Lambda Calculus Antonino Salibra Alberto Carraro Fri 27 December 2013
- Semantics of Interaction Samson Abramsky Fri 27 December 2013
- Collapsible Pushdown Graphs of Level 2 are Tree-Automatic Alexander Kartzow Fri 27 December 2013
- The Equivalence Problem for Real-time DPDAs Michio Oyamaguchi Fri 27 December 2013
Library Size: 13G (12983 entries),
Last Updated: Apr 23, 2026, 14:40:46,
Build Time: N/A
