Yann Strozecki

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
From amortized to worst case delay in enumeration algorithms Computational Complexity	2026-08-24	Paper
Refined Kolmogorov complexity of analog, evolving and stochastic recurrent neural networks Information Sciences	2025-07-16	Paper
Scheduling periodic messages on a shared link without buffering Journal of Scheduling	2025-01-07	Paper
Geometric amortization of enumeration algorithms	2024-10-08	Paper
A generic strategy improvement method for simple stochastic games (available as arXiv preprint)	2023-08-08	Paper
Solving simple stochastic games with few random nodes faster using Bland's rule (available as arXiv preprint)	2022-07-18	Paper
Enumerating models of DNF faster: breaking the dependency on the formula size Discrete Applied Mathematics	2021-09-15	Paper
Computing the multilinear factors of lacunary polynomials without heights Journal of Symbolic Computation	2021-02-18	Paper
Enumeration complexity	2020-01-13	Paper
Incremental delay enumeration: space and time Discrete Applied Mathematics	2019-09-19	Paper
Efficient enumeration of solutions produced by closure operations (available as arXiv preprint)	2019-08-01	Paper
Efficient enumeration of solutions produced by closure operations	2019-08-01	Paper
scientific article; zbMATH DE number 6829393 (Why is no real title available?) (available as arXiv preprint)	2018-01-24	Paper
Factoring bivariate lacunary polynomials without heights Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation	2017-02-10	Paper
Finding Optimal Strategies of Almost Acyclic Simple Stochastic Games Lecture Notes in Computer Science	2014-04-16	Paper
On enumerating monomials and other combinatorial structures by polynomial interpolation Theory of Computing Systems	2013-12-02	Paper
Approximate verification and enumeration problems Theoretical Aspects of Computing – ICTAC 2012	2012-09-21	Paper
Enumeration complexity of logical query problems with second-order variables	2012-09-18	Paper
The limited power of powering: polynomial identity testing and a depth-four lower bound for the permanent (available as arXiv preprint)	2012-08-31	Paper
Monadic second-order model-checking on decomposable matroids Discrete Applied Mathematics	2011-06-28	Paper
The Complexity of Acyclic Subhypergraph Problems WALCOM: Algorithms and Computation	2011-02-20	Paper
Enumeration of the monomials of a polynomial and related complexity classes Mathematical Foundations of Computer Science 2010	2010-09-03	Paper

Research outcomes over time

This page was built for person: Yann Strozecki