- Beyond Bits: An Introduction to Computation over the Reals Tillmann Miltzow Thu 02 April 2026
- The Mystery Deepens: On the Query Complexity of Tarski Fixed Points Xi Chen Yuhao Li Mihalis Yannakakis Thu 02 April 2026
- Model checking with temporal graphs and their derivative Binh-Minh Bui-Xuan Florent Krasnopol Bruno Monasson Nathalie Sznajder Wed 18 February 2026
- Out-of-Order Membership to Regular Languages Antoine Amarilli Sebastien Labbe Charles Paperman Wed 18 February 2026
- mathrmTIME[t]subseteq mathrmSPACE[O(sqrtt)] via Tree Height Compression Logan Nye Mon 17 November 2025
- Dynamic Membership for Regular Tree Languages Antoine Amarilli Corentin Barloy Louis Jachiet Charles Paperman Fri 25 April 2025
- The Model Counting Competitions 2021-2023 Johannes K. Fichte Markus Hecher Fri 25 April 2025
- Metric Dimension and Geodetic Set Parameterized by Vertex Cover Florent Foucaud Esther Galby Liana Khazaliya Shaohua Li Fionn Mc Inerney Roohani Sharma Prafullkumar Tale Sat 05 April 2025
- Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover Florent Foucaud Esther Galby Liana Khazaliya Shaohua Li Fionn Mc Inerney Roohani Sharma Prafullkumar Tale Sat 05 April 2025
- Twin-width and types Jakub Gajarský Michał Pilipczuk Wojciech Przybyszewski Szymon Toruńczyk Sun 09 March 2025
- Merge-width and First-Order Model Checking Jan Dreier Szymon Toruńczyk Sun 09 March 2025
- The Structural Complexity of Matrix-Vector Multiplication Emile Anand Jan van den Brand Rose McCarty Sun 09 March 2025
- Constant-delay enumeration for SLP-compressed documents Martín Muñoz Cristian Riveros Tue 25 February 2025
- Data Structures for Finite Downsets of Natural Vectors: Theory and Practice Michael Cadilhac Vanessa Flğel Guillermo A. Pérez Shrisha Rao Tue 25 February 2025
- An efficient uniqueness theorem for overcomplete tensor decomposition Pascal Koiran Fri 14 February 2025
- Fair Vertex Problems Parameterized by Cluster Vertex Deletion Tomáš Masařík Jędrzej Olkowski Anna Zych-Pawlewicz Fri 14 February 2025
- Corecursive Coding of High Computational Derivatives and Power Series Jerzy Karczmarczuk Wed 29 January 2025
- Matrix-by-matrix multiplication algorithm with O(N^2log2N) computational complexity for variable precision arithmetic Maciej Paszyński Sat 02 November 2024
- Solving Polynomial Equations Over Finite Fields Holger Dell Anselm Haak Melvin Kallmayer Leo Wennmann Sat 02 November 2024
- Exact Exploration Andreas Blass Nachum Dershowitz Yuri Gurevich Sat 26 October 2024
- The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds Karl Bringmann Allan Grønlund Marvin Kunnemann Kasper Green Larsen Sat 12 October 2024
- First-Order Model Checking on Monadically Stable Graph Classes Jan Dreier Ioannis Eleftheriadis Nikolas Mahlmann Rose McCarty Michał Pilipczuk Szymon Toruńczyk Wed 02 October 2024
- The Subspace Flatness Conjecture and Faster Integer Programming Victor Reis Thomas Rothvoss Thu 01 August 2024
- Color Refinement for Relational Structures Benjamin Scheidt Nicole Schweikardt Wed 31 July 2024
- The Existential Theory of the Reals as a Complexity Class: A Compendium Marcus Schaefer Jean Cardinal Tillmann Miltzow Wed 31 July 2024
- Parameterizing the quantification of CMSO: model checking on minor-closed graph classes Ignasi Sau Giannos Stamoulis Dimitrios M. Thilikos Thu 27 June 2024
- Treewidth Inapproximability and Tight ETH Lower Bound Édouard Bonnet Sun 23 June 2024
- Complexity of Robust Orbit Problems for Torus Actions and the abc-conjecture Peter Burgisser Mahmut Levent Doğan Visu Makam Michael Walter Avi Wigderson Tue 28 May 2024
- On classes of bounded tree rank, their interpretations, and efficient sparsification Jakub Gajarský Rose McCarty Tue 07 May 2024
- A Circus of Circuits: Connections Between Decision Diagrams, Circuits, and Automata Antoine Amarilli Marcelo Arenas YooJung Choi Mikael Monet Guy Van den Broeck Benjie Wang Thu 18 April 2024
- Elementary first-order model checking for sparse graphs Jakub Gajarský Michał Pilipczuk Marek Sokołowski Giannos Stamoulis Szymon Toruńczyk Thu 01 February 2024
- A faster FPRAS for NFA Kuldeep S. Meel Sourav Chakraborty Umang Mathur Fri 22 December 2023
- Why the equivalence problem for unambiguous grammars has not been solved back in 1966 Vladislav Makarov Sat 16 December 2023
- Factoring Pattern-Free Permutations into Separable ones Édouard Bonnet Romain Bourneuf Colin Geniet Stéphan Thomassé Sat 25 November 2023
- A new proof of Euclid's algorithm Andrzej Salwicki Mon 06 November 2023
- A symmetric attractor-decomposition lifting algorithm for parity games Marcin Jurdziński Rémi Morvan Pierre Ohlmann K.~S. Thejaswini Mon 06 November 2023
- On the Length of Strongly Monotone Descending Chains over mathbbN^d Sylvain Schmitz Lia Schutze Sat 07 October 2023
- Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time V. Arvind Abhranil Chatterjee Partha Mukhopadhyay Thu 28 September 2023
- Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements Martin Grohe Moritz Lichter Daniel Neuen Pascal Schweitzer Mon 28 August 2023
- New Bounds for Matrix Multiplication: from Alpha to Omega Virginia Vassilevska Williams Yinzhan Xu Zixuan Xu Renfei Zhou Wed 19 July 2023
- Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond Jan Dreier Daniel Mock Peter Rossmanith Fri 14 July 2023
- Logarithmic Weisfeiler--Leman Identifies All Graphs of Bounded Rank Width Michael Levet Nicholas Sieger Tue 11 July 2023
- The Complexity of Diagonalization Nikhil Srivastava Wed 24 May 2023
- Improved Complexity Analysis of Quasi-Polynomial Algorithms Solving Parity Games Paweł Parys Aleksander Wiącek Fri 05 May 2023
- Higher-dimensional subdiagram matching Amar Hadzihasanovic Diana Kessler Fri 28 April 2023
- Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF Johannes K. Fichte Robert Ganian Markus Hecher Friedrich Slivovsky Sebastian Ordyniak Fri 28 April 2023
- The Iteration Number of the Weisfeiler-Leman Algorithm Martin Grohe Moritz Lichter Daniel Neuen Fri 28 April 2023
- Boolean symmetric vs. functional PCSP dichotomy Tamio-Vesa Nakajima Stanislav Živný Fri 28 April 2023
- First-Order Model Checking on Structurally Sparse Graph Classes Jan Dreier Nikolas Mahlmann Sebastian Siebertz Mon 20 February 2023
- Flip-width: Cops and Robber on dense graphs Szymon Toruńczyk Tue 07 February 2023
- Flipper games for monadically stable graph classes Jakub Gajarský Nikolas Mahlmann Rose McCarty Pierre Ohlmann Michał Pilipczuk Wojciech Przybyszewski Sebastian Siebertz Marek Sokołowski Szymon Toruńczyk Tue 07 February 2023
- Holonomic equations and efficient random generation of binary trees Pierre Lescanne Thu 12 January 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
- The complexity of two problems on arithmetic circuits Pascal Koiran Sylvain Perifel Tue 18 October 2022
- Twin-width V: linear minors, modular counting, and matrix multiplication Édouard Bonnet Ugo Giocanti Patrice Ossona de Mendez Stéphan Thomassé Mon 03 October 2022
- Enumerating Regular Languages in Constant Delay Antoine Amarilli Mikael Monet Mon 03 October 2022
- Universal Algorithms for Parity Games and Nested Fixpoints Marcin Jurdziński Rémi Morvan K. S. Thejaswini Tue 30 August 2022
- Simple C2-Finite Sequences: A Computable Generalization of C-Finite Sequences Philipp Nuspl Veronika Pillwein Mon 08 August 2022
- Some structural results on Dn-finite functions Antonio Jiménez-Pastor Veronika Pillwein Michael F. Singer Fri 01 July 2022
- On C2-Finite Sequences Antonio Jiménez-Pastor Philipp Nuspl Veronika Pillwein Fri 01 July 2022
- Optimizing tree decompositions in MSO Mikołaj Bojańczyk Michał Pilipczuk Mon 07 February 2022
- Decision algorithms for multiplayer noncooperative games of incomplete information G. Peterson J. Reif S. Azhar Mon 26 July 2021
- A Polynomial time Algorithm for Hamilton Cycle with maximum Degree 3, 3SAT Lizhi Du Tue 20 July 2021
- Optimal Fine-grained Hardness of Approximation of Linear Equations Mitali Bafna Nikhil Vyas Fri 25 June 2021
- Solving one variable word equations in the free group in cubic time Robert Ferens Artur Jeż Sun 14 February 2021
- Optimizing tree decompositions in MSO Mikołaj Bojańczyk Michał Pilipczuk Fri 11 December 2020
- On the Complexity of CSP-based Ideal Membership Problems Andrei A. Bulatov Akbar Rafiey Thu 12 November 2020
- Creative Telescoping for Rational Functions Using the Griffiths-Dwork Method Alin Bostan Pierre Lairez Bruno Salvy Sat 24 October 2020
- Algebraic diagonals and walks: Algorithms, bounds, complexity Alin Bostan Louis Dumont Bruno Salvy Sat 24 October 2020
- A Refined Laser Method and Faster Matrix Multiplication Josh Alman Virginia Vassilevska Williams Thu 15 October 2020
- Twin-width II: small classes Édouard Bonnet Colin Geniet Eun Jung Kim Stéphan Thomassé Rémi Watrigant Wed 14 October 2020
- Twin-width I: tractable FO model checking Édouard Bonnet Eun Jung Kim Stéphan Thomassé Rémi Watrigant Wed 14 October 2020
- A (Slightly) Improved Approximation Algorithm for Metric TSP Anna R. Karlin Nathan Klein Shayan Oveis Gharan Sun 11 October 2020
- Computing the N-Th Term of a q-Holonomic Sequence Alin Bostan Tue 29 September 2020
- Computing the Maximum Degree of Minors in Skew Polynomial Matrices Taihei Oki Sat 19 September 2020
- Comparison of Algorithms for Simple Stochastic Games (Full Version) Jan Kretinsky Emanuel Ramneantu Alexander Slivinskiy Maximilian Weininger Mon 31 August 2020
- Concentration-Bound Analysis for Probabilistic Programs and Probabilistic Recurrence Relations Jingyi Wang Yican Sun Hongfei Fu Amir Kafshdar Goharshady Krishnendu Chatterjee Mon 10 August 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
- How to generate random lambda terms Maciej Bendkowski Tue 19 May 2020
- Graph isomorphism in quasipolynomial time parameterized by treewidth Daniel Wiebking Sat 25 April 2020
- Deep Weisfeiler Leman Martin Grohe Pascal Schweitzer Daniel Wiebking Sun 29 March 2020
- The Strahler number of a parity game Laure Daviaud Marcin Jurdziński K. S. Thejaswini Sat 21 March 2020
- Generating functions for generating trees Cyril Banderier Philippe Flajolet Daniele Gardy Mireille Bousquet-Melou Alain Denise Dominique Gouyou-Beauchamps Sun 01 March 2020
- On path equivalence of nondeterministic finite automata Wen-Guey Tzeng Fri 07 February 2020
- Elements of Scheduling Jan Karel Lenstra David B. Shmoys Mon 27 January 2020
- Properties of nowhere dense graph classes related to independent set problem Grzegorz Fabiański Wed 11 December 2019
- Verifying Visibility-Based Weak Consistency Siddharth Krishna Michael Emmi Constantin Enea Dejan Jovanovic Wed 06 November 2019
- Robust Exponential Worst Cases for Divide-et-Impera Algorithms for Parity Games Massimo Benerecetti Daniele Dell'Erba Fabio Mogavero Sat 11 May 2019
- Improving the complexity of Parys' recursive algorithm Karoliina Lehtinen Sven Schewe Dominik Wojtczak Fri 10 May 2019
- Two-Player Reachability-Price Games on Single-Clock Timed Automata Michal Rutkowski Fri 12 April 2019
- A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars Javier Esparza Andreas Gaiser Stefan Kiefer Thu 11 October 2018
- Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathbackslash'eødory's Theorem S. Barman Tue 19 June 2018
- A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games L. Daviaud M. Jurdzinski R. Lazic Wed 06 June 2018
- Unary Finite Automata vs. Arithmetic Progressions Anthony Widjaja To Thu 23 January 2014
- Efficient Minimization of Deterministic Weak omega-automata Christof Løding Thu 12 December 2013
Library Size: 13G (96 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A
