Sébastien Tavenas

ORCID

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 38

Top Venues

Electron. Colloquium Comput. Complex.

CoRR

STOC

CCC

École normale supérieure de Lyon, France (PHD)

Education History

École normale supérieure de Lyon, France

PHD

Publications

Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits. Commun. ACM 67 (2) (2024)
Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas
Towards Optimal Depth-Reductions for Algebraic Formulas. CoRR (2023)
Hervé Fournier, Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
On the Power of Homogeneous Algebraic Formulas. Electron. Colloquium Comput. Complex. (2023)
Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas
Towards Optimal Depth-Reductions for Algebraic Formulas. Electron. Colloquium Comput. Complex. (2023)
Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas
Towards Optimal Depth-Reductions for Algebraic Formulas. CCC (2023)
Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials. Electron. Colloquium Comput. Complex. (2022)
Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits. FOCS (2022)
Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
Guest Column: Lower Bounds Against Constant-Depth Algebraic Circuits. SIGACT News 53 (2) (2022)
Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials. CCC (2022)
Sébastien Tavenas, Nutan Limaye, Srikanth Srinivasan
Set-multilinear and non-commutative formula lower bounds for iterated matrix multiplication. STOC (2022)
Clément Lagisquet, Edita Pelantová, Sébastien Tavenas, Laurent Vuillon
On the Markov numbers: Fixed numerator, denominator, and sum conjectures. Adv. Appl. Math. 130 (2021)
Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
New Non-FPT Lower Bounds for Some Arithmetic Formulas. Electron. Colloquium Comput. Complex. 28 (2021)
Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits. Electron. Colloquium Comput. Complex. 28 (2021)
Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits. FOCS (2021)
Hervé Fournier, Guillaume Malod, Maud Szusterman, Sébastien Tavenas
Nonnegative rank measures and monotone algebraic branching programs. Electron. Colloquium Comput. Complex. 26 (2019)
Hervé Fournier, Guillaume Malod, Maud Szusterman, Sébastien Tavenas
Nonnegative Rank Measures and Monotone Algebraic Branching Programs. FSTTCS (2019)
Neeraj Kayal, Vineet Nair, Chandan Saha, Sébastien Tavenas
Reconstruction of Full Rank Algebraic Branching Programs. ACM Trans. Comput. Theory 11 (1) (2019)
Neeraj Kayal, Chandan Saha, Sébastien Tavenas
On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree. Theory Comput. 14 (1) (2018)
Neeraj Kayal, Vineet Nair, Chandan Saha, Sébastien Tavenas
Reconstruction of Full Rank Algebraic Branching Programs. Computational Complexity Conference (2017)
Jean-Daniel Boissonnat, Karthik C. S., Sébastien Tavenas
Building Efficient and Compact Data Structures for Simplicial Complexes. Algorithmica 79 (2) (2017)
Neeraj Kayal, Vineet Nair, Chandan Saha, Sébastien Tavenas
Reconstruction of full rank Algebraic Branching Programs. Electron. Colloquium Comput. Complex. 24 (2017)
Meena Mahajan, Nitin Saurabh, Sébastien Tavenas
VNP=VP in the multilinear world. Inf. Process. Lett. 116 (2) (2016)
Mitali Bafna, Satyanarayana V. Lokam, Sébastien Tavenas, Ameya Velingker
On the Sensitivity Conjecture for Read-k Formulas. Electron. Colloquium Comput. Complex. 23 (2016)
Karthik C. S., Sébastien Tavenas
On the Sensitivity Conjecture for Disjunctive Normal Forms. CoRR (2016)
Karthik C. S., Sébastien Tavenas
On the Sensitivity Conjecture for Disjunctive Normal Forms. FSTTCS (2016)
Neeraj Kayal, Chandan Saha, Sébastien Tavenas
On the size of homogeneous and of depth four formulas with low individual degree. STOC (2016)
Neeraj Kayal, Chandan Saha, Sébastien Tavenas
An almost Cubic Lower Bound for Depth Three Arithmetic Circuits. Electron. Colloquium Comput. Complex. 23 (2016)
Mitali Bafna, Satyanarayana V. Lokam, Sébastien Tavenas, Ameya Velingker
On the Sensitivity Conjecture for Read-k Formulas. MFCS (2016)
Neeraj Kayal, Chandan Saha, Sébastien Tavenas
An Almost Cubic Lower Bound for Depth Three Arithmetic Circuits. ICALP (2016)
Neeraj Kayal, Chandan Saha, Sébastien Tavenas
On the size of homogeneous and of depth four formulas with low individual degree. Electron. Colloquium Comput. Complex. 22 (2015)
Pascal Koiran, Natacha Portier, Sébastien Tavenas
On the Intersection of a Sparse Curve and a Low-Degree Curve: A Polynomial Version of the Lost Theorem. Discret. Comput. Geom. 53 (1) (2015)
Jean-Daniel Boissonnat, Karthik C. S., Sébastien Tavenas
Building Efficient and Compact Data Structures for Simplicial Complexes. CoRR (2015)
Ignacio García-Marco, Pascal Koiran, Sébastien Tavenas
Log-concavity and lower bounds for arithmetic circuits. CoRR (2015)
Ignacio García-Marco, Pascal Koiran, Sébastien Tavenas
Log-Concavity and Lower Bounds for Arithmetic Circuits. MFCS (2) (2015)
Sébastien Tavenas
Improved bounds for reduction to depth 4 and depth 3. Inf. Comput. 240 (2015)
Jean-Daniel Boissonnat, Karthik C. S., Sébastien Tavenas
Building Efficient and Compact Data Structures for Simplicial Complexes. SoCG (2015)
Pascal Koiran, Natacha Portier, Sébastien Tavenas
A Wronskian approach to the real τ-conjecture. J. Symb. Comput. 68 (2015)
Pascal Koiran, Natacha Portier, Sébastien Tavenas, Stéphan Thomassé
A $$\tau $$ τ -Conjecture for Newton Polygons. Found. Comput. Math. 15 (1) (2015)
Pascal Koiran, Natacha Portier, Sébastien Tavenas, Stéphan Thomassé
A tau-conjecture for Newton polygons. CoRR (2013)
Sébastien Tavenas
Improved bounds for reduction to depth 4 and depth 3 CoRR (2013)
Emilie Diot, Sébastien Tavenas, Nicolas Trotignon
Detecting wheels. CoRR (2013)
Aurélie Lagoutte, Sébastien Tavenas
The complexity of Shortest Common Supersequence for inputs with no identical consecutive letters. CoRR (2013)
Sébastien Tavenas
Improved Bounds for Reduction to Depth 4 and Depth 3. MFCS (2013)
Pascal Koiran, Natacha Portier, Sébastien Tavenas
On the intersection of a sparse curve and a low-degree curve: A polynomial version of the lost theorem. CoRR (2013)
Pascal Koiran, Natacha Portier, Sébastien Tavenas
A Wronskian Approach to the real τ-conjecture CoRR (2012)

Sébastien Tavenas.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Sébastien Tavenas