default search action
Yann Strozecki
Person information
- affiliation: Versailles Saint-Quentin-en-Yvelines University, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Maël Guiraud
, Yann Strozecki:
Scheduling periodic messages on a shared link without buffering. J. Sched. 27(5): 461-484 (2024) - 2023
- [c15]Florent Capelli, Yann Strozecki:
Geometric Amortization of Enumeration Algorithms. STACS 2023: 18:1-18:22 - [i19]Jérémie Cabessa, Yann Strozecki:
Refined Kolmogorov Complexity of Analog, Evolving and Stochastic Recurrent Neural Networks. CoRR abs/2309.17032 (2023) - [i18]Yann Strozecki:
Enumeration Complexity: Incremental Time, Delay and Space. CoRR abs/2309.17042 (2023) - 2021
- [j8]Florent Capelli, Yann Strozecki
Enumerating models of DNF faster: Breaking the dependency on the formula size. Discret. Appl. Math. 303: 203-215 (2021) - [j7]Arkadev Chattopadhyay, Bruno Grenet
Computing the multilinear factors of lacunary polynomials without heights. J. Symb. Comput. 104: 183-206 (2021) - [c14]David Auger, Xavier Badin de Montjoye, Yann Strozecki:
A Generic Strategy Improvement Method for Simple Stochastic Games. MFCS 2021: 12:1-12:22 - [i17]David Auger, Xavier Badin de Montjoye, Yann Strozecki:
A Generic Strategy Iteration Method for Simple Stochastic Games. CoRR abs/2102.04922 (2021) - [i16]Florent Capelli, Yann Strozecki:
Geometric Amortization of Enumeration Algorithms. CoRR abs/2108.10208 (2021) - 2020
- [i15]Maël Guiraud, Yann Strozecki:
Scheduling periodic messages on a shared link. CoRR abs/2002.07606 (2020)
2010 – 2019
- 2019
- [j6]Florent Capelli
Incremental delay enumeration: Space and time. Discret. Appl. Math. 268: 179-190 (2019) - [j5]Arnaud Mary
Efficient enumeration of solutions produced by closure operations. Discret. Math. Theor. Comput. Sci. 21(3) (2019) - [j4]Yann Strozecki:
Enumeration Complexity. Bull. EATCS 129 (2019) - [c13]Dominique Barth, Maël Guiraud, Yann Strozecki:
Deterministic Contention Management for Low Latency Cloud RAN over an Optical Ring. ONDM 2019: 479-491 - [c12]David Auger, Pierre Coucheney, Yann Strozecki:
Solving Simple Stochastic Games with Few Random Nodes Faster Using Bland's Rule. STACS 2019: 9:1-9:16 - [i14]David Auger, Pierre Coucheney, Yann Strozecki:
Solving Simple Stochastic Games with few Random Nodes faster using Bland's Rule. CoRR abs/1901.05316 (2019) - [i13]Dominique Barth, Maël Guiraud, Yann Strozecki:
Deterministic contention management for low latency Cloud RAN over an optical ring. CoRR abs/1902.03018 (2019) - 2018
- [c11]Dominique Barth, Maël Guiraud, Brice Leclerc, Olivier Marcé, Yann Strozecki:
Deterministic Scheduling of Periodic Messages for Cloud RAN. ICT 2018: 405-410 - [i12]Dominique Barth, Maël Guiraud, Yann Strozecki:
Deterministic Scheduling of Periodic Messages for Cloud RAN. CoRR abs/1801.07029 (2018) - [i11]Florent Capelli, Yann Strozecki:
Enumerating models of DNF faster: breaking the dependency on the formula size. CoRR abs/1810.04006 (2018) - 2017
- [i10]Florent Capelli, Yann Strozecki:
On The Complexity of Enumeration. CoRR abs/1703.01928 (2017) - [i9]Arnaud Mary
Efficient enumeration of solutions produced by closure operations. CoRR abs/1712.03714 (2017) - 2016
- [c10]Arnaud Mary
Efficient Enumeration of Solutions Produced by Closure Operations. STACS 2016: 52:1-52:13 - 2015
- [c9]Dominique Barth, Olivier David
Efficient Generation of Stable Planar Cages for Chemistry. SEA 2015: 235-246 - [i8]Dominique Barth, Olivier David, Franck Quessette, Vincent Reinhard, Yann Strozecki, Sandrine Vial:
Efficient Generation of Stable Planar Cages for Chemistry. CoRR abs/1503.06610 (2015) - [i7]Arnaud Mary, Yann Strozecki:
Efficient enumeration of solutions produced by closure operations. CoRR abs/1509.05623 (2015) - 2014
- [c8]David Auger, Pierre Coucheney, Yann Strozecki:
Finding Optimal Strategies of Almost Acyclic Simple Stochastic Games. TAMC 2014: 67-85 - [i6]David Auger, Pierre Coucheney, Yann Strozecki:
Finding Optimal Strategies of Almost Acyclic Simple Stochatic Games. CoRR abs/1402.0471 (2014) - 2013
- [j3]Yann Strozecki:
On Enumerating Monomials and Other Combinatorial Structures by Polynomial Interpolation. Theory Comput. Syst. 53(4): 532-568 (2013) - [c7]Arkadev Chattopadhyay, Bruno Grenet
Factoring bivariate lacunary polynomials without heights. ISSAC 2013: 141-148 - [i5]Arkadev Chattopadhyay, Bruno Grenet
Computing the multilinear factors of lacunary polynomials without heights. CoRR abs/1311.5694 (2013) - 2012
- [j2]Joseph Salmon, Yann Strozecki:
Patch reprojections for Non-Local methods. Signal Process. 92(2): 477-489 (2012) - [c6]Sylvain Peyronnet, Michel de Rougemont, Yann Strozecki:
Approximate Verification and Enumeration Problems. ICTAC 2012: 228-242 - [i4]Arkadev Chattopadhyay, Bruno Grenet
Factoring bivariate lacunary polynomials without heights. CoRR abs/1206.4224 (2012) - 2011
- [j1]Yann Strozecki:
Monadic second-order model-checking on decomposable matroids. Discret. Appl. Math. 159(10): 1022-1039 (2011) - [c5]Arnaud Durand, Yann Strozecki:
Enumeration Complexity of Logical Query Problems with Second-order Variables. CSL 2011: 189-202 - [c4]Bruno Grenet
The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent. FSTTCS 2011: 127-139 - [c3]David Duris, Yann Strozecki:
The Complexity of Acyclic Subhypergraph Problems. WALCOM 2011: 45-56 - [i3]Bruno Grenet
The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent. CoRR abs/1107.1434 (2011) - 2010
- [c2]Joseph Salmon, Yann Strozecki:
From patches to pixels in Non-Local methods: Weighted-average reprojection. ICIP 2010: 1929-1932 - [c1]Yann Strozecki:
Enumeration of the Monomials of a Polynomial and Related Complexity Classes. MFCS 2010: 629-640 - [i2]Yann Strozecki:
Enumeration of the Monomials of a Polynomial and Related Complexity Classes. CoRR abs/1004.3020 (2010)
2000 – 2009
- 2009
- [i1]Yann Strozecki:
A Logical Approach to Decomposable Matroids. CoRR abs/0908.4499 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: