Yann Strozecki

J. Sched., October, 2024

2023

Enumeration Complexity: Incremental Time, Delay and Space.

[BibT_eX]

[DOI]

CoRR, 2023

Refined Kolmogorov Complexity of Analog, Evolving and Stochastic Recurrent Neural Networks.

[BibT_eX]

[DOI]

Jérémie Cabessa

CoRR, 2023

Geometric Amortization of Enumeration Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

2021

Computing the multilinear factors of lacunary polynomials without heights.

[BibT_eX]

[DOI]

Arkadev Chattopadhyay

J. Symb. Comput., 2021

Enumerating models of DNF faster: Breaking the dependency on the formula size.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

A Generic Strategy Iteration Method for Simple Stochastic Games.

[BibT_eX]

[DOI]

Xavier Badin de Montjoye

CoRR, 2021

A Generic Strategy Improvement Method for Simple Stochastic Games.

[BibT_eX]

[DOI]

Xavier Badin de Montjoye

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2020

Scheduling periodic messages on a shared link.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Enumeration Complexity.

[BibT_eX]

[DOI]

Bull. EATCS, 2019

Efficient enumeration of solutions produced by closure operations.

[BibT_eX]

[DOI]

Arnaud Mary

Discret. Math. Theor. Comput. Sci., 2019

Incremental delay enumeration: Space and time.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Solving Simple Stochastic Games with Few Random Nodes Faster Using Bland's Rule.

[BibT_eX]

[DOI]

Pierre Coucheney

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Deterministic Contention Management for Low Latency Cloud RAN over an Optical Ring.

[BibT_eX]

[DOI]

Dominique Barth

Proceedings of the Optical Network Design and Modeling, 2019

2018

Deterministic Scheduling of Periodic Messages for Cloud RAN.

[BibT_eX]

[DOI]

Dominique Barth

CoRR, 2018

Deterministic Scheduling of Periodic Messages for Cloud RAN.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on Telecommunications, 2018

2017

On The Complexity of Enumeration.

[BibT_eX]

[DOI]

CoRR, 2017

2015

Efficient Generation of Stable Planar Cages for Chemistry.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

2014

Finding Optimal Strategies of Almost Acyclic Simple Stochatic Games.

[BibT_eX]

[DOI]

Pierre Coucheney

CoRR, 2014

Finding Optimal Strategies of Almost Acyclic Simple Stochastic Games.

[BibT_eX]

[DOI]

Pierre Coucheney

Proceedings of the Theory and Applications of Models of Computation, 2014

2013

On Enumerating Monomials and Other Combinatorial Structures by Polynomial Interpolation.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2013

Factoring bivariate lacunary polynomials without heights.

[BibT_eX]

[DOI]

Arkadev Chattopadhyay

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

2012

Patch reprojections for Non-Local methods.

[BibT_eX]

[DOI]

Joseph Salmon

Signal Process., 2012

Approximate Verification and Enumeration Problems.

[BibT_eX]

[DOI]

Sylvain Peyronnet

Michel de Rougemont

Proceedings of the Theoretical Aspects of Computing - ICTAC 2012, 2012

2011

Monadic second-order model-checking on decomposable matroids.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

The Complexity of Acyclic Subhypergraph Problems.

[BibT_eX]

[DOI]

David Duris

Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Enumeration Complexity of Logical Query Problems with Second-order Variables.

[BibT_eX]

[DOI]

Arnaud Durand

Proceedings of the Computer Science Logic, 2011

2010

Enumeration of the Monomials of a Polynomial and Related Complexity Classes.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

From patches to pixels in Non-Local methods: Weighted-average reprojection.

[BibT_eX]

[DOI]

Joseph Salmon

Proceedings of the International Conference on Image Processing, 2010

2009

A Logical Approach to Decomposable Matroids

[BibT_eX]

[DOI]