- Counting and Sampling Traces in Regular Languages Alexis de Colnet Kuldeep S. Meel Umang Mathur Fri 09 January 2026
- Counter Machines with Infrequent Reversals Alain Finkel Shankara Narayanan Krishna Khushraj Madnani Rupak Majumdar Georg Zetzsche Sat 16 December 2023
- Algorithms for combinatorial structures: Well-founded systems and Newton iterations Carine Pivoteau Bruno Salvy Michèle Soria Mon 20 February 2023
- Complexity bounds for zero-test algorithms Joris van der Hoeven John Shackell Thu 02 February 2023
- Accelerated tower arithmetic Joris van der Hoeven Grégoire Lecerf Thu 02 February 2023
- Integer multiplication in time O(nmathrmlog, n) David Harvey Joris van der Hoeven Wed 01 February 2023
- Computing isolated roots of sparse polynomial systems in affine space María Isabel Herrero Gabriela Jeronimo Juan Sabia Sat 26 November 2022
- Affine solution sets of sparse polynomial systems María Isabel Herrero Gabriela Jeronimo Juan Sabia Sat 26 November 2022
- Reasoning on Data Words over Numeric Domains Diego Figueira Anthony Widjaja Lin Mon 29 August 2022
- Nonprimitive recursive complexity and undecidability for Petri net equivalences Petr Jančar Wed 10 August 2022
- Complexity of Zero-dimensional Grøbner Bases Amir Hashemi Daniel Lazard Fri 19 November 2021
- Degree Bounds for GrøBner Bases of Low-Dimensional Polynomial Ideals Ernst W. Mayr Stephan Ritscher Fri 19 November 2021
- Revisiting reachability in Polynomial Interrupt Timed Automata Béatrice Bérard Serge Haddad Thu 11 November 2021
- Semidefinite programming and arithmetic circuit evaluation Sergey P. Tarasov Mikhail N. Vyalyi Thu 21 January 2021
- Optimal run problem for weighted register automata Hiroyuki Seki Reo Yoshimura Yoshiaki Takata Fri 13 November 2020
- Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination Christel Baier Christian Hensel Lisa Hutschenreiter Sebastian Junges Joost-Pieter Katoen Joachim Klein Sun 25 October 2020
- Creative Telescoping for Rational Functions Using the Griffiths-Dwork Method Alin Bostan Pierre Lairez Bruno Salvy Sat 24 October 2020
- Differential Equations for Algebraic Functions Alin Bostan Frédéric Chyzak Bruno Salvy Grégoire Lecerf Éric Schost Sun 18 October 2020
- Computing the N-Th Term of a q-Holonomic Sequence Alin Bostan Tue 29 September 2020
- Computing the Hermite form of a matrix of Ore polynomials Mark Giesbrecht Myung Sub Kim Sat 19 September 2020
- Fast Computation of Common Left Multiples of Linear Ordinary Differential Operators Alin Bostan Frédéric Chyzak Bruno Salvy Ziming Li Wed 03 June 2020
- Model Checking Games Erich Gradel Wed 22 January 2020
- The Hardness of Polynomial Equation Solving D. Castro M. Giusti J. Heintz G. Matera L. M. Pardo Fri 28 September 2018
- The tractability frontier for NFA minimization Henrik Bjørklund Wim Martens Fri 22 June 2018
- The Logic of Event Clocks: Decidability, Complexity and Expressiveness Jean-François Raskin Pierre-Yves Schobbens Fri 01 June 2018
- The Complexity of Computing a Nash Equilibrium Constantinos Daskalakis Paul W. Goldberg Christos H. Papadimitriou Wed 30 May 2018
- Intersection Type Calculi of Bounded Dimension Andrej Dudenhefner Jakob Rehof Tue 05 December 2017
- Minimization of Tree Pattern Queries Wojciech Czerwinski Wim Martens Matthias Niewerth Pawel Parys Wed 11 January 2017
- The Computational Complexity of Universality Problems for Prefixes, Suffixes, Factors, and Subwords of Regular Languages Narad Rampersad Jeffrey Shallit Zhi Xu Mon 29 February 2016
- On the State Complexity of Scattered Substrings and Superstrings Alexander Okhotin Mon 29 February 2016
- Complexity of regular abstractions of one-counter languages Mohamed Faouzi Atig Dmitry Chistikov Piotr Hofman K Narayan Kumar Prakash Saivasan Georg Zetzsche Mon 29 February 2016
- On the State Complexity of Closures and Interiors of Regular Languages with Subwords and Superwords P. Karandikar M. Niewerth Ph. Schnoebelen Tue 12 January 2016
- A Recognition and Parsing Algorithm for Arbitrary Conjunctive Grammars Alexander Okhotin Mon 05 October 2015
- Implicational Relevance Logic is 2-ExpTime-Complete Sylvain Schmitz Thu 25 September 2014
- Path Coupling: A Technique for Proving Rapid Mixing in Markov Chains R. Bubley M. Dyer Sun 06 July 2014
- Computing rational solutions of linear matrix inequalities Qingdong Guo Mohab Safey El Din Lihong Zhi Wed 18 June 2014
- Model-checking hierarchical structures Markus Lohrey Thu 08 May 2014
- On the Approximability of Trade-offs and Optimal Access of Web Sources C. H. Papadimitriou M. Yannakakis Mon 14 April 2014
- On the Complexity of Nash Equilibria and Other Fixed Points Kousha Etessami Mihalis Yannakakis Mon 10 March 2014
- The Complexity of Tree Automata and Logics of Programs E. Allen Emerson Charanjit S. Jutla Wed 18 December 2013
Library Size: 13G (40 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A
