default search action
Giorgio Ottaviani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [i6]Aldo Conca, Simone Naldi, Giorgio Ottaviani, Bernd Sturmfels:
Taylor Polynomials of Rational Functions. CoRR abs/2304.00712 (2023) - 2021
- [j14]Giorgio Ottaviani
, Luca Sodomaco
Asymptotics of degrees and ED degrees of Segre products. Adv. Appl. Math. 130: 102242 (2021) - 2020
- [j13]Giorgio Ottaviani, Luca Sodomaco
The distance function from a real algebraic variety. Comput. Aided Geom. Des. 82: 101927 (2020) - [i5]Giorgio Ottaviani, Philipp Reichenbach
Tensor Rank and Complexity. CoRR abs/2004.01492 (2020)
2010 – 2019
- 2019
- [j12]Luca Chiantini
The Geometry of Rank Decompositions of Matrix Multiplication I: 2 × 2 Matrices. Exp. Math. 28(3): 322-327 (2019) - [j11]Hannah Markwig, Bernard Mourrain, Giorgio Ottaviani:
Foreword on the special issue of JSC on the occasion of MEGA 2017. J. Symb. Comput. 91: 1-2 (2019) - 2018
- [j10]Gunnar Fløystad, Joe Kileel, Giorgio Ottaviani:
The Chow form of the essential variety in computer vision. J. Symb. Comput. 86: 97-119 (2018) - 2017
- [j9]Jan Draisma, Giorgio Ottaviani, Fabrice Rouillier:
Foreword. J. Symb. Comput. 79: 1-3 (2017) - [j8]Luca Chiantini
Effective Criteria for Specific Identifiability of Tensors and Forms. SIAM J. Matrix Anal. Appl. 38(2): 656-681 (2017) - 2016
- [j7]Jan Draisma, Emil Horobet, Giorgio Ottaviani, Bernd Sturmfels, Rekha R. Thomas:
The Euclidean Distance Degree of an Algebraic Variety. Found. Comput. Math. 16(1): 99-149 (2016) - [i4]Gunnar Fløystad, Joe Kileel, Giorgio Ottaviani:
The Chow Form of the Essential Variety in Computer Vision. CoRR abs/1604.04372 (2016) - [i3]Luca Chiantini, Christian Ikenmeyer, J. M. Landsberg, Giorgio Ottaviani:
The geometry of rank decompositions of matrix multiplication I: 2x2 matrices. CoRR abs/1610.08364 (2016) - 2015
- [j6]Joseph M. Landsberg, Giorgio Ottaviani:
New Lower Bounds for the Border Rank of Matrix Multiplication. Theory Comput. 11: 285-298 (2015) - 2014
- [j5]Shmuel Friedland, Giorgio Ottaviani:
The Number of Singular Vector Tuples and Uniqueness of Best Rank-One Approximation of Tensors. Found. Comput. Math. 14(6): 1209-1242 (2014) - [j4]Luca Chiantini
An Algorithm For Generic and Low-Rank Specific Identifiability of Complex Tensors. SIAM J. Matrix Anal. Appl. 35(4): 1265-1287 (2014) - [j3]Giorgio Ottaviani, Pierre-Jean Spaenlehauer
Exact Solutions in Structured Low-Rank Approximation. SIAM J. Matrix Anal. Appl. 35(4): 1521-1542 (2014) - [c1]Jan Draisma, Emil Horobet, Giorgio Ottaviani, Bernd Sturmfels, Rekha R. Thomas:
The euclidean distance degree. SNC 2014: 9-16 - 2013
- [j2]Luke Oeding
Eigenvectors of tensors and algorithms for Waring decomposition. J. Symb. Comput. 54: 9-35 (2013) - [i2]Giorgio Ottaviani, Pierre-Jean Spaenlehauer, Bernd Sturmfels:
Algebraic Methods for Structured Low-Rank Approximation. CoRR abs/1311.2376 (2013) - 2012
- [j1]Luca Chiantini
On Generic Identifiability of 3-Tensors of Small Rank. SIAM J. Matrix Anal. Appl. 33(3): 1018-1037 (2012) - 2011
- [i1]J. M. Landsberg, Giorgio Ottaviani:
New lower bounds for the border rank of matrix multiplication. CoRR abs/1112.6007 (2011)
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-04-24 23:18 CEST 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: