Yann Strozecki

Publication Activity (10 Years)

Years Active: 2009-2023
Publications (10 Years): 22

Top Topics

Recurrent Neural Networks

Stochastic Games

Multivariate Polynomials

Algorithmic Solutions

Top Venues

Discret. Appl. Math.

Publications

Florent Capelli, Yann Strozecki
Geometric Amortization of Enumeration Algorithms. STACS (2023)
Yann Strozecki
Enumeration Complexity: Incremental Time, Delay and Space. CoRR (2023)
Jérémie Cabessa, Yann Strozecki
Refined Kolmogorov Complexity of Analog, Evolving and Stochastic Recurrent Neural Networks. CoRR (2023)
Florent Capelli, Yann Strozecki
Enumerating models of DNF faster: Breaking the dependency on the formula size. Discret. Appl. Math. 303 (2021)
Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki
Computing the multilinear factors of lacunary polynomials without heights. J. Symb. Comput. 104 (2021)
David Auger, Xavier Badin de Montjoye, Yann Strozecki
A Generic Strategy Improvement Method for Simple Stochastic Games. MFCS (2021)
David Auger, Xavier Badin de Montjoye, Yann Strozecki
A Generic Strategy Iteration Method for Simple Stochastic Games. CoRR (2021)
Florent Capelli, Yann Strozecki
Geometric Amortization of Enumeration Algorithms. CoRR (2021)
Maël Guiraud, Yann Strozecki
Scheduling periodic messages on a shared link. CoRR (2020)
Florent Capelli, Yann Strozecki
Incremental delay enumeration: Space and time. Discret. Appl. Math. 268 (2019)
Dominique Barth, Maël Guiraud, Yann Strozecki
Deterministic contention management for low latency Cloud RAN over an optical ring. CoRR (2019)
Dominique Barth, Maël Guiraud, Yann Strozecki
Deterministic Contention Management for Low Latency Cloud RAN over an Optical Ring. ONDM (2019)
David Auger, Pierre Coucheney, Yann Strozecki
Solving Simple Stochastic Games with few Random Nodes faster using Bland's Rule. CoRR (2019)
David Auger, Pierre Coucheney, Yann Strozecki
Solving Simple Stochastic Games with Few Random Nodes Faster Using Bland's Rule. STACS (2019)
Arnaud Mary, Yann Strozecki
Efficient enumeration of solutions produced by closure operations. Discret. Math. Theor. Comput. Sci. 21 (3) (2019)
Yann Strozecki
Enumeration Complexity. Bull. EATCS 129 (2019)
Dominique Barth, Maël Guiraud, Brice Leclerc, Olivier Marcé, Yann Strozecki
Deterministic Scheduling of Periodic Messages for Cloud RAN. ICT (2018)
Florent Capelli, Yann Strozecki
Enumerating models of DNF faster: breaking the dependency on the formula size. CoRR (2018)
Dominique Barth, Maël Guiraud, Yann Strozecki
Deterministic Scheduling of Periodic Messages for Cloud RAN. CoRR (2018)
Florent Capelli, Yann Strozecki
On The Complexity of Enumeration. CoRR (2017)
Arnaud Mary, Yann Strozecki
Efficient enumeration of solutions produced by closure operations. CoRR (2017)
Arnaud Mary, Yann Strozecki
Efficient Enumeration of Solutions Produced by Closure Operations. STACS (2016)
Dominique Barth, Olivier David, Franck Quessette, Vincent Reinhard, Yann Strozecki, Sandrine Vial
Efficient Generation of Stable Planar Cages for Chemistry. CoRR (2015)
Dominique Barth, Olivier David, Franck Quessette, Vincent Reinhard, Yann Strozecki, Sandrine Vial
Efficient Generation of Stable Planar Cages for Chemistry. SEA (2015)
Arnaud Mary, Yann Strozecki
Efficient enumeration of solutions produced by closure operations. CoRR (2015)
David Auger, Pierre Coucheney, Yann Strozecki
Finding Optimal Strategies of Almost Acyclic Simple Stochatic Games. CoRR (2014)
David Auger, Pierre Coucheney, Yann Strozecki
Finding Optimal Strategies of Almost Acyclic Simple Stochastic Games. TAMC (2014)
Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki
Computing the multilinear factors of lacunary polynomials without heights. CoRR (2013)
Yann Strozecki
On Enumerating Monomials and Other Combinatorial Structures by Polynomial Interpolation. Theory Comput. Syst. 53 (4) (2013)
Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki
Factoring bivariate lacunary polynomials without heights. ISSAC (2013)
Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki
Factoring bivariate lacunary polynomials without heights CoRR (2012)
Joseph Salmon, Yann Strozecki
Patch reprojections for Non-Local methods. Signal Process. 92 (2) (2012)
Sylvain Peyronnet, Michel de Rougemont, Yann Strozecki
Approximate Verification and Enumeration Problems. ICTAC (2012)
Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki
The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent. FSTTCS (2011)
Arnaud Durand, Yann Strozecki
Enumeration Complexity of Logical Query Problems with Second-order Variables. CSL (2011)
Yann Strozecki
Monadic second-order model-checking on decomposable matroids. Discret. Appl. Math. 159 (10) (2011)
David Duris, Yann Strozecki
The Complexity of Acyclic Subhypergraph Problems. WALCOM (2011)
Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki
The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent CoRR (2011)
Yann Strozecki
Enumeration of the Monomials of a Polynomial and Related Complexity Classes. MFCS (2010)
Yann Strozecki
Enumeration of the Monomials of a Polynomial and Related Complexity Classes CoRR (2010)
Joseph Salmon, Yann Strozecki
From patches to pixels in Non-Local methods: Weighted-average reprojection. ICIP (2010)
Yann Strozecki
A Logical Approach to Decomposable Matroids CoRR (2009)