Alexis de Colnet

Orcid: 0000-0002-7517-6735

According to our database1, Alexis de Colnet authored at least 23 papers between 2019 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Quadratic Sums-of-Powers for Fixed-Parameter Tractable Quantum-Circuit Simulation.
CoRR, May, 2026

From Tensor Networks to Tractable Circuits, and back.
CoRR, May, 2026

The Compilability Thresholds of 2-CNF to OBDD.
CoRR, March, 2026

Counting and Sampling Traces in Regular Languages.
Proc. ACM Program. Lang., 2026

OBDDs, SDDs, and circuits of bounded width: Completeness matters.
Artif. Intell., 2026

#CFG and #DNNF admit FPRAS.
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025
Towards Practical FPRAS for #NFA: Exploiting the Power of Dependence.
Proc. ACM Manag. Data, May, 2025

An FPRAS for Model Counting for Non-Deterministic Read-Once Branching Programs.
Proceedings of the 28th International Conference on Database Theory, 2025

2024
An FPRAS for #nFBDD.
CoRR, 2024

On the Relative Efficiency of Dynamic and Static Top-Down Compilation to Decision-DNNF.
Proceedings of the 27th International Conference on Theory and Applications of Satisfiability Testing, 2024

ASP-QRAT: A Conditionally Optimal Dual Proof System for ASP.
Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning, 2024

Compilation and Fast Model Counting beyond CNF.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Hardness of Random Reordered Encodings of Parity for Resolution and CDCL.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Dataset of Random Reordered Encodings of Parity Problems.
Dataset, December, 2023

Separating Incremental and Non-Incremental Bottom-Up Compilation.
Proceedings of the 26th International Conference on Theory and Applications of Satisfiability Testing, 2023

On Translations between ML Models for XAI Purposes.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022
On the Complexity of Enumerating Prime Implicants from Decision-DNNF Circuits.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics 2022 (ISAIM 2022), 2022

Lower Bounds on Intermediate Results in Bottom-Up Knowledge Compilation.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Characterizing Tseitin-Formulas with Short Regular Resolution Refutations.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

A Compilation of Succinctness Results for Arithmetic Circuits.
Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, 2021

2020
A Lower Bound on DNNF Encodings of Pseudo-Boolean Constraints.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

Lower Bounds for Approximate Knowledge Compilation.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2019
Dual Hashing-Based Algorithms for Discrete Integration.
Proceedings of the Principles and Practice of Constraint Programming, 2019


  Loading...