default search action
Sébastien Tavenas
Person information
- affiliation: Université Savoie Mont Blanc, Chambéry, France
- affiliation: ENS Lyon, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas:
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits. Commun. ACM 67(2): 101-108 (2024) - [c14]Hervé Fournier, Nutan Limaye
, Srikanth Srinivasan
On the Power of Homogeneous Algebraic Formulas. STOC 2024: 141-151 - 2023
- [c13]Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan
Towards Optimal Depth-Reductions for Algebraic Formulas. CCC 2023: 28:1-28:19 - [i20]Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas:
Towards Optimal Depth-Reductions for Algebraic Formulas. CoRR abs/2302.06984 (2023) - [i19]Hervé Fournier, Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas:
On the Power of Homogeneous Algebraic Formulas. Electron. Colloquium Comput. Complex. TR23 (2023) - [i18]Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas:
Towards Optimal Depth-Reductions for Algebraic Formulas. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j10]Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas:
Guest Column: Lower Bounds Against Constant-Depth Algebraic Circuits. SIGACT News 53(2): 40-62 (2022) - [c12]Nutan Limaye, Srikanth Srinivasan
On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials. CCC 2022: 32:1-32:23 - [c11]Sébastien Tavenas, Nutan Limaye, Srikanth Srinivasan
Set-multilinear and non-commutative formula lower bounds for iterated matrix multiplication. STOC 2022: 416-425 - [i17]Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas:
On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j9]Clément Lagisquet, Edita Pelantová
On the Markov numbers: Fixed numerator, denominator, and sum conjectures. Adv. Appl. Math. 130: 102227 (2021) - [c10]Nutan Limaye, Srikanth Srinivasan
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits. FOCS 2021: 804-814 - [i16]Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas:
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits. Electron. Colloquium Comput. Complex. TR21 (2021) - [i15]Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas:
New Non-FPT Lower Bounds for Some Arithmetic Formulas. Electron. Colloquium Comput. Complex. TR21 (2021)
2010 – 2019
- 2019
- [j8]Neeraj Kayal, Vineet Nair, Chandan Saha, Sébastien Tavenas:
Reconstruction of Full Rank Algebraic Branching Programs. ACM Trans. Comput. Theory 11(1): 2:1-2:56 (2019) - [c9]Hervé Fournier, Guillaume Malod, Maud Szusterman, Sébastien Tavenas:
Nonnegative Rank Measures and Monotone Algebraic Branching Programs. FSTTCS 2019: 15:1-15:14 - [i14]Hervé Fournier, Guillaume Malod, Maud Szusterman, Sébastien Tavenas:
Nonnegative rank measures and monotone algebraic branching programs. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j7]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): 1-46 (2018) - 2017
- [j6]Jean-Daniel Boissonnat, Karthik C. S.
Building Efficient and Compact Data Structures for Simplicial Complexes. Algorithmica 79(2): 530-567 (2017) - [c8]Neeraj Kayal, Vineet Nair, Chandan Saha, Sébastien Tavenas:
Reconstruction of Full Rank Algebraic Branching Programs. CCC 2017: 21:1-21:61 - [i13]Neeraj Kayal, Vineet Nair, Chandan Saha, Sébastien Tavenas:
Reconstruction of full rank Algebraic Branching Programs. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j5]Meena Mahajan
VNP=VP in the multilinear world. Inf. Process. Lett. 116(2): 179-182 (2016) - [c7]Karthik C. S.
On the Sensitivity Conjecture for Disjunctive Normal Forms. FSTTCS 2016: 15:1-15:15 - [c6]Neeraj Kayal, Chandan Saha, Sébastien Tavenas:
An Almost Cubic Lower Bound for Depth Three Arithmetic Circuits. ICALP 2016: 33:1-33:15 - [c5]Mitali Bafna, Satyanarayana V. Lokam, Sébastien Tavenas, Ameya Velingker:
On the Sensitivity Conjecture for Read-k Formulas. MFCS 2016: 16:1-16:14 - [c4]Neeraj Kayal, Chandan Saha, Sébastien Tavenas:
On the size of homogeneous and of depth four formulas with low individual degree. STOC 2016: 626-632 - [i12]Karthik C. S., Sébastien Tavenas:
On the Sensitivity Conjecture for Disjunctive Normal Forms. CoRR abs/1607.05189 (2016) - [i11]Mitali Bafna, Satyanarayana V. Lokam, Sébastien Tavenas, Ameya Velingker:
On the Sensitivity Conjecture for Read-k Formulas. Electron. Colloquium Comput. Complex. TR16 (2016) - [i10]Neeraj Kayal, Chandan Saha, Sébastien Tavenas:
An almost Cubic Lower Bound for Depth Three Arithmetic Circuits. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j4]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): 48-63 (2015) - [j3]Pascal Koiran, Natacha Portier, Sébastien Tavenas, Stéphan Thomassé:
A $$\tau $$ τ -Conjecture for Newton Polygons. Found. Comput. Math. 15(1): 185-197 (2015) - [j2]Sébastien Tavenas:
Improved bounds for reduction to depth 4 and depth 3. Inf. Comput. 240: 2-11 (2015) - [j1]Pascal Koiran, Natacha Portier, Sébastien Tavenas:
A Wronskian approach to the real τ-conjecture. J. Symb. Comput. 68: 195-214 (2015) - [c3]Jean-Daniel Boissonnat, Karthik C. S.
Building Efficient and Compact Data Structures for Simplicial Complexes. SoCG 2015: 642-656 - [c2]Ignacio García-Marco
Log-Concavity and Lower Bounds for Arithmetic Circuits. MFCS (2) 2015: 361-371 - [i9]Jean-Daniel Boissonnat, Karthik C. S., Sébastien Tavenas:
Building Efficient and Compact Data Structures for Simplicial Complexes. CoRR abs/1503.07444 (2015) - [i8]Ignacio García-Marco, Pascal Koiran, Sébastien Tavenas:
Log-concavity and lower bounds for arithmetic circuits. CoRR abs/1503.07705 (2015) - [i7]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. TR15 (2015) - 2014
- [b1]Sébastien Tavenas:
Bornes infe'rieures et supe'rieures dans les circuits arithme'tiques. (Upper and lower bounds for arithmetic circuits). École normale supérieure de Lyon, France, 2014 - 2013
- [c1]Sébastien Tavenas:
Improved Bounds for Reduction to Depth 4 and Depth 3. MFCS 2013: 813-824 - [i6]Sébastien Tavenas:
Improved bounds for reduction to depth 4 and depth 3. CoRR abs/1304.5777 (2013) - [i5]Pascal Koiran, Natacha Portier, Sébastien Tavenas, Stéphan Thomassé:
A tau-conjecture for Newton polygons. CoRR abs/1308.2286 (2013) - [i4]Emilie Diot, Sébastien Tavenas, Nicolas Trotignon:
Detecting wheels. CoRR abs/1308.6433 (2013) - [i3]Aurélie Lagoutte, Sébastien Tavenas:
The complexity of Shortest Common Supersequence for inputs with no identical consecutive letters. CoRR abs/1309.0422 (2013) - [i2]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 abs/1310.2447 (2013) - 2012
- [i1]Pascal Koiran, Natacha Portier, Sébastien Tavenas:
A Wronskian Approach to the real τ-conjecture. CoRR abs/1205.1015 (2012)
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-10-28 21:16 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: