Yann Strozecki

According to our database1, Yann Strozecki authored at least 26 papers between 2009 and 2021.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


Computing the multilinear factors of lacunary polynomials without heights.
J. Symb. Comput., 2021

A Generic Strategy Iteration Method for Simple Stochastic Games.
CoRR, 2021

Scheduling periodic messages on a shared link.
CoRR, 2020

Enumeration Complexity.
Bull. EATCS, 2019

Efficient enumeration of solutions produced by closure operations.
Discret. Math. Theor. Comput. Sci., 2019

Incremental delay enumeration: Space and time.
Discret. Appl. Math., 2019

Solving Simple Stochastic Games with Few Random Nodes Faster Using Bland's Rule.
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.
Proceedings of the Optical Network Design and Modeling, 2019

Enumerating models of DNF faster: breaking the dependency on the formula size.
CoRR, 2018

Deterministic Scheduling of Periodic Messages for Cloud RAN.
CoRR, 2018

Deterministic Scheduling of Periodic Messages for Cloud RAN.
Proceedings of the 25th International Conference on Telecommunications, 2018

On The Complexity of Enumeration.
CoRR, 2017

Efficient Generation of Stable Planar Cages for Chemistry.
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

Finding Optimal Strategies of Almost Acyclic Simple Stochatic Games.
CoRR, 2014

Finding Optimal Strategies of Almost Acyclic Simple Stochastic Games.
Proceedings of the Theory and Applications of Models of Computation, 2014

On Enumerating Monomials and Other Combinatorial Structures by Polynomial Interpolation.
Theory Comput. Syst., 2013

Factoring bivariate lacunary polynomials without heights.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

Patch reprojections for Non-Local methods.
Signal Process., 2012

Approximate Verification and Enumeration Problems.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2012, 2012

Monadic second-order model-checking on decomposable matroids.
Discret. Appl. Math., 2011

The Complexity of Acyclic Subhypergraph Problems.
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.
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.
Proceedings of the Computer Science Logic, 2011

Enumeration of the Monomials of a Polynomial and Related Complexity Classes.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

From patches to pixels in Non-Local methods: Weighted-average reprojection.
Proceedings of the International Conference on Image Processing, 2010

A Logical Approach to Decomposable Matroids
CoRR, 2009