Sébastien Tavenas
Chargé de Recherche CNRS au
Laboratoire LAMA
de l'
Université Savoie Mont Blanc
.
Equipes : LIMD / Géométrie
Contact :
Bâtiment Le Chablais, Campus Scientifique 73376 Le Bourget du Lac - France.
Tél. : 04 72 72 94 35 (de France) +33 4 72 72 94 35 (from abroad)
Bureau : 103
courriel : firstname.name (no accents) at univ dash smb dot fr
Enseignements :
Analyse Algorithmes
Complexité arithmétique (ENS Lyon)
Publications :
H. Fournier, N. Limaye, S. Srinivasan, S. Tavenas.
On the Power of Homogeneous Algebraic Formulas
STOC
, 2024.
hal
doi
H. Fournier, N. Limaye, G. Malod, S. Srinivasan, S. Tavenas.
Towards Optimal Depth-Reductions for Algebraic Formulas
CCC
, 2023.
hal
doi
S. Tavenas, N. Limaye, S. Srinivasan.
Set-multilinear and non-commutative formula lower bounds for iterated matrix multiplication
STOC
, 2022.
hal
doi
N. Limaye, S. Srinivasan, S. Tavenas.
On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials
CCC
, 2022.
hal
doi
N. Limaye, S. Srinivasan, S. Tavenas.
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits
FOCS
, 2021.
hal
doi
C. Lagisquet, E. Pelantová, S. Tavenas, L. Vuillon.
On the Markov numbers: Fixed numerator, denominator, and sum conjectures
J.
Advances in Applied Mathematics
, 2021.
hal
doi
H. Fournier, G. Malod, M. Szusterman, S. Tavenas.
Nonnegative rank measures and monotone algebraic branching programs
FSTTCS
, 2019.
hal
doi
N. Kayal, V. Nair, C. Saha, S. Tavenas.
Reconstruction of Full Rank Algebraic Branching Programs
CCC
, 2017.
hal
doi (conf. version)
doi (journal version)
N. Kayal, C. Saha, S. Tavenas.
On the size of homogeneous and of depth four formulas with low individual degree
STOC
, 2016.
Journal version:
Theory of Computing
, 2018.
hal
doi (conf. version)
doi (journal version)
N. Kayal, C. Saha, S. Tavenas.
An Almost Cubic Lower Bound for Depth Three Arithmetic Circuits
ICALP
, 2016.
hal
doi
M. Bafna, S. V Lokam, S. Tavenas, A. Velingker.
On the Sensitivity Conjecture for Read-k Formulas
MFCS
, 2016.
hal
doi
Karthik CS, S. Tavenas.
On the Sensitivity Conjecture for Disjunctive Normal Forms
FSTTCS
, 2016.
hal
doi
JD. Boissonnat, Karthik CS, S. Tavenas.
Building Efficient and Compact Data Structures for Simplicial Complexes
SoCG
, 2015.
J.
Algorithmica
, 2016.
hal
doi (conf. version)
doi (journal version)
M. Mahajan, N. Saurabh, S. Tavenas.
VNP=VP in the multilinear world
J.
Information Processing Letters
, 2016.
doi
P. Koiran, N. Portier, S. Tavenas.
On the Intersection of a Sparse Curve and a Low-Degree Curve: A Polynomial Version of the Lost Theorem
J.
Discrete and Computational Geometry
, 2015.
hal
doi
P. Koiran, N. Portier, S. Tavenas, S. Thomassé.
A τ-Conjecture for Newton Polygons
Foundation of Computational Mathematics
, 2015.
hal
doi
P. Koiran, N. Portier, S. Tavenas.
A Wronskian approach to the real τ-conjecture
J. of Symbolic Computation
, (Special Issue MEGA), 2015.
hal
doi
I. García-Marco, P. Koiran, S. Tavenas.
Log-Concavity and Lower Bounds for Arithmetic Circuits
MFCS
, 2015.
hal
doi
É. Diot, S. Tavenas, N. Trotignon.
Detecting wheels
J. of Applicable Analysis and Discrete Mathematics
, 2014.
doi
S. Tavenas.
Improved bounds for reduction to depth 4 and depth 3
J. Information and Computation
, Special Issue MFCS, 2013.
doi
S. Tavenas.
Bornes inférieures et supérieures dans les circuits arithmétiques
PhD thesis 2014.
thesis
Pre-publications :
G. Comte, S. Tavenas.
Rational and lacunary algebraic curves
ArXiv
F. Bihan, T. Humbert, S. Tavenas.
New bounds for the number of connected components of fewnomial hypersurfaces
ArXiv
B. El Hilany, S. Tavenas.
Improved fewnomial upper bounds from Wronskians and dessins d'enfant
ArXiv
V. Gledel, N. Oijid, S. Tavenas, S. Thomassé.
On the complexity of Client-Waiter and Waiter-Client games
ArXiv