Sébastien Tavenas

55 papers A* 7A 4B 2Journal 37Unranked 4

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	On Closure Properties of Read-Once Oblivious Algebraic Branching Programs. ITCS Robert Andrews, Jules Armand, Prateek Dwivedi, Magnus Rahbek Dalgaard Hansen, Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2026	J	`jnl`	Towards Optimal Depth-Reductions for Algebraic Formulas. Comput. Complex. Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas
2025	J	`jnl`	On Closure Properties of Read-Once Oblivious Algebraic Branching Programs. CoRR Jules Armand, Prateek Dwivedi, Magnus Rahbek Dalgaard Hansen, Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2025	J	`jnl`	On Closure Properties of Read-Once Oblivious Algebraic Branching Programs. Electron. Colloquium Comput. Complex. Jules Armand, Prateek Dwivedi, Nutan Limaye, Magnus Rahbek Dalgaard Hansen, Srikanth Srinivasan, Sébastien Tavenas
2025	A*	`conf`	On the Complexity of Client-Waiter and Waiter-Client Games. ICALP Valentin Gledel, Nacim Oijid, Sébastien Tavenas, Stéphan Thomassé
2025	J	`jnl`	Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits. J. ACM Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2025	—	`conf`	The Algebraic Cost of a Boolean Sum. FSTTCS Ian Orzel, Srikanth Srinivasan, Sébastien Tavenas, Amir Yehudayoff
2025	J	`jnl`	The Algebraic Cost of a Boolean Sum. CoRR Ian Orzel, Srikanth Srinivasan, Sébastien Tavenas, Amir Yehudayoff
2025	J	`jnl`	The Algebraic Cost of a Boolean Sum. Electron. Colloquium Comput. Complex. Ian Orzel, Srikanth Srinivasan, Sébastien Tavenas, Amir Yehudayoff
2024	A*	`conf`	On the Power of Homogeneous Algebraic Formulas. STOC Hervé Fournier, Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2024	J	`jnl`	Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits. Commun. ACM Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2023	J	`jnl`	On the Power of Homogeneous Algebraic Formulas. Electron. Colloquium Comput. Complex. Hervé Fournier, Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2023	A	`conf`	Towards Optimal Depth-Reductions for Algebraic Formulas. CCC Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas
2023	J	`jnl`	Towards Optimal Depth-Reductions for Algebraic Formulas. CoRR Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas
2023	J	`jnl`	Towards Optimal Depth-Reductions for Algebraic Formulas. Electron. Colloquium Comput. Complex. Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas
2022	J	`jnl`	Guest Column: Lower Bounds Against Constant-Depth Algebraic Circuits. SIGACT News Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2022	A	`conf`	On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials. CCC Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2022	J	`jnl`	On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials. Electron. Colloquium Comput. Complex. Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2022	A*	`conf`	Set-multilinear and non-commutative formula lower bounds for iterated matrix multiplication. STOC Sébastien Tavenas, Nutan Limaye, Srikanth Srinivasan
2021	J	`jnl`	New Non-FPT Lower Bounds for Some Arithmetic Formulas. Electron. Colloquium Comput. Complex. Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2021	J	`jnl`	On the Markov numbers: Fixed numerator, denominator, and sum conjectures. Adv. Appl. Math. Clément Lagisquet, Edita Pelantová, Sébastien Tavenas, Laurent Vuillon
2021	A*	`conf`	Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits. FOCS Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2021	J	`jnl`	Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits. Electron. Colloquium Comput. Complex. Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
2019	—	`conf`	Nonnegative Rank Measures and Monotone Algebraic Branching Programs. FSTTCS Hervé Fournier, Guillaume Malod, Maud Szusterman, Sébastien Tavenas
2019	J	`jnl`	Nonnegative rank measures and monotone algebraic branching programs. Electron. Colloquium Comput. Complex. Hervé Fournier, Guillaume Malod, Maud Szusterman, Sébastien Tavenas
2019	J	`jnl`	Reconstruction of Full Rank Algebraic Branching Programs. ACM Trans. Comput. Theory Neeraj Kayal, Vineet Nair, Chandan Saha, Sébastien Tavenas
2018	J	`jnl`	On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree. Theory Comput. Neeraj Kayal, Chandan Saha, Sébastien Tavenas
2017	J	`jnl`	Building Efficient and Compact Data Structures for Simplicial Complexes. Algorithmica Jean-Daniel Boissonnat, Karthik C. S., Sébastien Tavenas
2017	A	`conf`	Reconstruction of Full Rank Algebraic Branching Programs. CCC Neeraj Kayal, Vineet Nair, Chandan Saha, Sébastien Tavenas
2017	J	`jnl`	Reconstruction of full rank Algebraic Branching Programs. Electron. Colloquium Comput. Complex. Neeraj Kayal, Vineet Nair, Chandan Saha, Sébastien Tavenas
2016	A*	`conf`	An Almost Cubic Lower Bound for Depth Three Arithmetic Circuits. ICALP Neeraj Kayal, Chandan Saha, Sébastien Tavenas
2016	J	`jnl`	An almost Cubic Lower Bound for Depth Three Arithmetic Circuits. Electron. Colloquium Comput. Complex. Neeraj Kayal, Chandan Saha, Sébastien Tavenas
2016	—	`conf`	On the Sensitivity Conjecture for Disjunctive Normal Forms. FSTTCS Karthik C. S., Sébastien Tavenas
2016	J	`jnl`	On the Sensitivity Conjecture for Disjunctive Normal Forms. CoRR Karthik C. S., Sébastien Tavenas
2016	B	`conf`	On the Sensitivity Conjecture for Read-k Formulas. MFCS Mitali Bafna, Satyanarayana V. Lokam, Sébastien Tavenas, Ameya Velingker
2016	J	`jnl`	On the Sensitivity Conjecture for Read-k Formulas. Electron. Colloquium Comput. Complex. Mitali Bafna, Satyanarayana V. Lokam, Sébastien Tavenas, Ameya Velingker
2016	A*	`conf`	On the size of homogeneous and of depth four formulas with low individual degree. STOC Neeraj Kayal, Chandan Saha, Sébastien Tavenas
2016	J	`jnl`	VNP=VP in the multilinear world. Inf. Process. Lett. Meena Mahajan, Nitin Saurabh, Sébastien Tavenas
2015	J	`jnl`	A $$\tau $$ τ -Conjecture for Newton Polygons. Found. Comput. Math. Pascal Koiran, Natacha Portier, Sébastien Tavenas, Stéphan Thomassé
2015	J	`jnl`	A Wronskian approach to the real τ-conjecture. J. Symb. Comput. Pascal Koiran, Natacha Portier, Sébastien Tavenas
2015	A*	`conf`	Building Efficient and Compact Data Structures for Simplicial Complexes. SoCG Jean-Daniel Boissonnat, Karthik C. S., Sébastien Tavenas
2015	J	`jnl`	Building Efficient and Compact Data Structures for Simplicial Complexes. CoRR Jean-Daniel Boissonnat, Karthik C. S., Sébastien Tavenas
2015	J	`jnl`	Improved bounds for reduction to depth 4 and depth 3. Inf. Comput. Sébastien Tavenas
2015	—	`conf`	Log-Concavity and Lower Bounds for Arithmetic Circuits. MFCS (2) Ignacio García-Marco, Pascal Koiran, Sébastien Tavenas
2015	J	`jnl`	Log-concavity and lower bounds for arithmetic circuits. CoRR Ignacio García-Marco, Pascal Koiran, Sébastien Tavenas
2015	J	`jnl`	On the Intersection of a Sparse Curve and a Low-Degree Curve: A Polynomial Version of the Lost Theorem. Discret. Comput. Geom. Pascal Koiran, Natacha Portier, Sébastien Tavenas
2015	J	`jnl`	On the size of homogeneous and of depth four formulas with low individual degree. Electron. Colloquium Comput. Complex. Neeraj Kayal, Chandan Saha, Sébastien Tavenas
2014	—	`—`	Bornes infe'rieures et supe'rieures dans les circuits arithme'tiques. (Upper and lower bounds for arithmetic circuits). Sébastien Tavenas
2013	J	`jnl`	A tau-conjecture for Newton polygons. CoRR Pascal Koiran, Natacha Portier, Sébastien Tavenas, Stéphan Thomassé
2013	J	`jnl`	Detecting wheels. CoRR Emilie Diot, Sébastien Tavenas, Nicolas Trotignon
2013	B	`conf`	Improved Bounds for Reduction to Depth 4 and Depth 3. MFCS Sébastien Tavenas
2013	J	`jnl`	Improved bounds for reduction to depth 4 and depth 3 CoRR Sébastien Tavenas
2013	J	`jnl`	On the intersection of a sparse curve and a low-degree curve: A polynomial version of the lost theorem. CoRR Pascal Koiran, Natacha Portier, Sébastien Tavenas
2013	J	`jnl`	The complexity of Shortest Common Supersequence for inputs with no identical consecutive letters. CoRR Aurélie Lagoutte, Sébastien Tavenas
2012	J	`jnl`	A Wronskian Approach to the real τ-conjecture CoRR Pascal Koiran, Natacha Portier, Sébastien Tavenas