Sébastien Tavenas

Orcid: 0000-0002-0025-0005

Affiliations:
  • Université Savoie Mont Blanc, Chambéry, France
  • ENS Lyon, France


According to our database1, Sébastien Tavenas authored at least 25 papers between 2013 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Towards Optimal Depth-Reductions for Algebraic Formulas.
Electron. Colloquium Comput. Complex., 2023

On the Power of Homogeneous Algebraic Formulas.
Electron. Colloquium Comput. Complex., 2023

2022
Guest Column: Lower Bounds Against Constant-Depth Algebraic Circuits.
SIGACT News, 2022

On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials.
Electron. Colloquium Comput. Complex., 2022

Set-multilinear and non-commutative formula lower bounds for iterated matrix multiplication.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021
New Non-FPT Lower Bounds for Some Arithmetic Formulas.
Electron. Colloquium Comput. Complex., 2021

Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits.
Electron. Colloquium Comput. Complex., 2021

On the Markov numbers: Fixed numerator, denominator, and sum conjectures.
Adv. Appl. Math., 2021

2019
Nonnegative rank measures and monotone algebraic branching programs.
Electron. Colloquium Comput. Complex., 2019

2018
On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree.
Theory Comput., 2018

2017
Reconstruction of full rank Algebraic Branching Programs.
Electron. Colloquium Comput. Complex., 2017

Building Efficient and Compact Data Structures for Simplicial Complexes.
Algorithmica, 2017

2016
VNP=VP in the multilinear world.
Inf. Process. Lett., 2016

An almost Cubic Lower Bound for Depth Three Arithmetic Circuits.
Electron. Colloquium Comput. Complex., 2016

On the Sensitivity Conjecture for Read-k Formulas.
Electron. Colloquium Comput. Complex., 2016

On the Sensitivity Conjecture for Disjunctive Normal Forms.
Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015
A Wronskian approach to the real τ-conjecture.
J. Symb. Comput., 2015

Improved bounds for reduction to depth 4 and depth 3.
Inf. Comput., 2015

A $$\tau $$ τ -Conjecture for Newton Polygons.
Found. Comput. Math., 2015

On the Intersection of a Sparse Curve and a Low-Degree Curve: A Polynomial Version of the Lost Theorem.
Discret. Comput. Geom., 2015

Log-Concavity and Lower Bounds for Arithmetic Circuits.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2014
Bornes infe'rieures et supe'rieures dans les circuits arithme'tiques. (Upper and lower bounds for arithmetic circuits).
PhD thesis, 2014

2013
The complexity of Shortest Common Supersequence for inputs with no identical consecutive letters.
CoRR, 2013

A tau-conjecture for Newton polygons.
CoRR, 2013

Detecting wheels.
CoRR, 2013


  Loading...