Yann Strozecki

Available identifiers

Publication	Date of Publication	Type
Scheduling periodic messages on a shared link without buffering	2025-01-07	Paper
Geometric amortization of enumeration algorithms	2024-10-08	Paper
A generic strategy improvement method for simple stochastic games	2023-08-08	Paper
https://portal.mardi4nfdi.de/entity/Q5090455	2022-07-18	Paper
Enumerating models of DNF faster: breaking the dependency on the formula size	2021-09-15	Paper
Computing the multilinear factors of lacunary polynomials without heights	2021-02-18	Paper
Enumeration complexity	2020-01-13	Paper
Incremental delay enumeration: space and time	2019-09-19	Paper
Efficient enumeration of solutions produced by closure operations	2019-08-01	Paper
https://portal.mardi4nfdi.de/entity/Q4601904	2018-01-24	Paper
Factoring bivariate lacunary polynomials without heights	2017-02-10	Paper
Finding Optimal Strategies of Almost Acyclic Simple Stochastic Games	2014-04-16	Paper
On enumerating monomials and other combinatorial structures by polynomial interpolation	2013-12-02	Paper
Approximate verification and enumeration problems	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	2012-08-31	Paper
Monadic second-order model-checking on decomposable matroids	2011-06-28	Paper
The Complexity of Acyclic Subhypergraph Problems	2011-02-20	Paper
Enumeration of the monomials of a polynomial and related complexity classes	2010-09-03	Paper

This page was built for person: Yann Strozecki