Suivre
Yann Strozecki
Yann Strozecki
Doctor in Computer Science, Université de Versailles
Adresse e-mail validée de uvsq.fr - Page d'accueil
Titre
Citée par
Citée par
Année
Patch reprojections for non-local methods
J Salmon, Y Strozecki
Signal Processing 92 (2), 477-489, 2012
622012
Enumeration complexity and matroid decomposition
Y Strozecki
Paris 7, 2010
552010
From patches to pixels in non-local methods: Weighted-average reprojection
J Salmon, Y Strozecki
2010 IEEE International Conference on Image Processing, 1929-1932, 2010
502010
Enumeration Complexity of Logical Query Problems with Second-order Variables
A Durand, Y Strozecki
Computer 12, 189-202, 0
40*
Efficient enumeration of solutions produced by closure operations
A Mary, Y Strozecki
Discrete Mathematics & Theoretical Computer Science 21 (Discrete Algorithms), 2019
312019
Enumeration complexity
Y Strozecki
Bulletin of EATCS 3 (129), 2019
282019
Incremental delay enumeration: Space and time
F Capelli, Y Strozecki
Discrete Applied Mathematics 268, 179-190, 2019
28*2019
On enumerating monomials and other combinatorial structures by polynomial interpolation
Y Strozecki
Theory of Computing Systems 53, 532-568, 2013
232013
The limited power of powering: polynomial identity testing and a depth-four lower bound for the permanent
B Grenet, P Koiran, N Portier, Y Strozecki
arXiv preprint arXiv:1107.1434, 2011
152011
Factoring bivariate lacunary polynomials without heights
A Chattopadhyay, B Grenet, P Koiran, N Portier, Y Strozecki
Proceedings of the 38th International Symposium on Symbolic and Algebraic …, 2013
132013
A generic strategy improvement method for simple stochastic games
D Auger, XB de Montjoye, Y Strozecki
arXiv preprint arXiv:2102.04922, 2021
112021
Finding optimal strategies of almost acyclic simple stochastic games
D Auger, P Coucheney, Y Strozecki
Theory and Applications of Models of Computation: 11th Annual Conference …, 2014
112014
Enumerating models of DNF faster: breaking the dependency on the formula size
F Capelli, Y Strozecki
Discrete Applied Mathematics 303, 203-215, 2021
102021
Deterministic scheduling of periodic messages for cloud RAN
D Barth, M Guiraud, B Leclerc, O Marcé, Y Strozecki
2018 25th International Conference on Telecommunications (ICT), 405-410, 2018
92018
Efficient generation of stable planar cages for chemistry
D Barth, O David, F Quessette, V Reinhard, Y Strozecki, S Vial
Experimental Algorithms: 14th International Symposium, SEA 2015, Paris …, 2015
92015
Computing the multilinear factors of lacunary polynomials without heights
A Chattopadhyay, B Grenet, P Koiran, N Portier, Y Strozecki
arXiv preprint arXiv:1311.5694, 2013
9*2013
Monadic second-order model-checking on decomposable matroids
Y Strozecki
Discrete Applied Mathematics 159 (10), 1022-1039, 2011
8*2011
Enumeration of the monomials of a polynomial and related complexity classes
Y Strozecki
International Symposium on Mathematical Foundations of Computer Science, 629-640, 2010
82010
Deterministic contention management for low latency cloud RAN over an optical ring
D Barth, M Guiraud, Y Strozecki
International IFIP Conference on Optical Network Design and Modeling, 479-491, 2019
72019
Solving Simple Stochastic Games with few Random Nodes faster using Bland's Rule
D Auger, P Coucheney, Y Strozecki
arXiv preprint arXiv:1901.05316, 2019
62019
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20