default search action
Jeroen Zuiddam
Person information
- affiliation: University of Amsterdam, Korteweg-de Vries Institute for Mathematics, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c9]Jop Briët, Matthias Christandl, Itai Leigh, Amir Shpilka, Jeroen Zuiddam:
Discreteness of Asymptotic Tensor Ranks (Extended Abstract). ITCS 2024: 20:1-20:14 - [i28]David de Boer, Pjotr Buys, Jeroen Zuiddam:
The asymptotic spectrum distance, graph limits, and the Shannon capacity. CoRR abs/2404.16763 (2024) - 2023
- [j11]Matthias Christandl
, Fulvio Gesmundo
A Gap in the Subrank of Tensors. SIAM J. Appl. Algebra Geom. 7(4): 742-767 (2023) - [i27]Jop Briët, Matthias Christandl, Itai Leigh, Amir Shpilka
Discreteness of asymptotic tensor ranks. CoRR abs/2306.01718 (2023) - [i26]Fulvio Gesmundo, Jeroen Zuiddam:
The next gap in the subrank of 3-tensors. CoRR abs/2307.06115 (2023) - 2022
- [c8]Harm Derksen, Visu Makam, Jeroen Zuiddam:
Subrank and Optimal Reduction of Scalar Multiplications to Generic Tensors. CCC 2022: 9:1-9:23 - [c7]Matthias Christandl, Omar Fawzi
Larger Corner-Free Sets from Combinatorial Degenerations. ITCS 2022: 48:1-48:20 - [i25]Harm Derksen, Visu Makam, Jeroen Zuiddam:
Subrank and Optimal Reduction of Scalar Multiplications to Generic Tensors. CoRR abs/2205.15168 (2022) - [i24]Matthias Christandl, Fulvio Gesmundo, Jeroen Zuiddam:
A Gap in the Subrank of Tensors. CoRR abs/2212.01668 (2022) - 2021
- [j10]Matthias Christandl
Border Rank Nonadditivity for Higher Order Tensors. SIAM J. Matrix Anal. Appl. 42(2): 503-527 (2021) - [j9]Yinan Li
Quantum Asymptotic Spectra of Graphs and Non-Commutative Graphs, and Quantum Shannon Capacities. IEEE Trans. Inf. Theory 67(1): 416-432 (2021) - [j8]Matthias Christandl, Péter Vrana, Jeroen Zuiddam:
Barriers for Fast Matrix Multiplication from Irreversibility. Adv. Math. Commun. 17: 1-32 (2021) - [c6]Robert Robere, Jeroen Zuiddam:
Amortized Circuit Complexity, Formal Complexity Measures, and Catalytic Algorithms. FOCS 2021: 759-769 - [i23]Matthias Christandl, Omar Fawzi, Hoang Ta, Jeroen Zuiddam:
Communication Complexity, Corner-Free Sets and the Symmetric Subrank of Tensors. CoRR abs/2104.01130 (2021) - [i22]Matthias Christandl, Omar Fawzi, Hoang Ta, Jeroen Zuiddam:
Larger Corner-Free Sets from Combinatorial Degenerations. CoRR abs/2111.08262 (2021) - [i21]Robert Robere, Jeroen Zuiddam:
Amortized Circuit Complexity, Formal Complexity Measures, and Catalytic Algorithms. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j7]Srinivasan Arunachalam, Péter Vrana
The Asymptotic Induced Matching Number of Hypergraphs: Balanced Binary Strings. Electron. J. Comb. 27(3): 3 (2020) - [c5]Swastik Kopparty, Guy Moshkovitz, Jeroen Zuiddam:
Geometric Rank of Tensors and Subrank of Matrix Multiplication. CCC 2020: 35:1-35:21 - [i20]Swastik Kopparty, Guy Moshkovitz, Jeroen Zuiddam:
Geometric rank of tensors and subrank of matrix multiplication. CoRR abs/2002.09472 (2020) - [i19]Matthias Christandl, François Le Gall, Vladimir Lysikov
Barriers for rectangular matrix multiplication. CoRR abs/2003.03019 (2020) - [i18]Matthias Christandl, Fulvio Gesmundo, Mateusz Michalek, Jeroen Zuiddam:
Border rank non-additivity for higher order tensors. CoRR abs/2007.05458 (2020) - [i17]Matthias Christandl, Vladimir Lysikov
Weighted Slice Rank and a Minimax Correspondence to Strassen's Spectra. CoRR abs/2012.14412 (2020) - [i16]Matthias Christandl, François Le Gall, Vladimir Lysikov, Jeroen Zuiddam:
Barriers for Rectangular Matrix Multiplication. Electron. Colloquium Comput. Complex. TR20 (2020) - [i15]Swastik Kopparty, Guy Moshkovitz, Jeroen Zuiddam:
Geometric Rank of Tensors and Subrank of Matrix Multiplication. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j6]Matthias Christandl, Jeroen Zuiddam:
Tensor surgery and tensor rank. Comput. Complex. 28(1): 27-56 (2019) - [j5]Matthias Christandl, Péter Vrana
Asymptotic tensor rank of graph tensors: beyond matrix multiplication. Comput. Complex. 28(1): 57-111 (2019) - [j4]Jeroen Zuiddam:
The Asymptotic Spectrum of Graphs and the Shannon Capacity. Comb. 39(5): 1173-1184 (2019) - [c4]Matthias Christandl
Barriers for Fast Matrix Multiplication from Irreversibility. CCC 2019: 26:1-26:17 - [i14]Srinivasan Arunachalam, Péter Vrana, Jeroen Zuiddam:
The asymptotic induced matching number of hypergraphs: balanced binary strings. CoRR abs/1905.03148 (2019) - 2018
- [j3]Markus Bläser, Matthias Christandl, Jeroen Zuiddam:
The border support rank of two-by-two matrix multiplication is seven. Chic. J. Theor. Comput. Sci. 2018 (2018) - [j2]Karl Bringmann, Christian Ikenmeyer, Jeroen Zuiddam
On Algebraic Branching Programs of Small Width. J. ACM 65(5): 32:1-32:29 (2018) - [c3]Matthias Christandl, Péter Vrana
Universal points in the asymptotic spectrum of tensors. STOC 2018: 289-296 - [i13]Jeroen Zuiddam:
The asymptotic spectrum of graphs and the Shannon capacity. CoRR abs/1807.00169 (2018) - [i12]Yinan Li, Jeroen Zuiddam:
Quantum asymptotic spectra of graphs and non-commutative graphs, and quantum Shannon capacities. CoRR abs/1810.00744 (2018) - [i11]Matthias Christandl, Péter Vrana, Jeroen Zuiddam:
Barriers for fast matrix multiplication from irreversibility. CoRR abs/1812.06952 (2018) - 2017
- [j1]Jop Briët, Jeroen Zuiddam:
Orthogonal rank and impossibility of quantum round elimination. Quantum Inf. Comput. 17(1&2): 106-116 (2017) - [c2]Karl Bringmann, Christian Ikenmeyer, Jeroen Zuiddam:
On Algebraic Branching Programs of Small Width. CCC 2017: 20:1-20:31 - [c1]Harry Buhrman, Matthias Christandl, Jeroen Zuiddam:
Nondeterministic Quantum Communication Complexity: the Cyclic Equality Game and Iterated Matrix Multiplication. ITCS 2017: 24:1-24:18 - [i10]Karl Bringmann, Christian Ikenmeyer, Jeroen Zuiddam:
On algebraic branching programs of small width. CoRR abs/1702.05328 (2017) - [i9]Matthias Christandl, Asger Kjærulff Jensen, Jeroen Zuiddam:
Tensor rank is not multiplicative under the tensor product. CoRR abs/1705.09379 (2017) - [i8]Markus Bläser, Matthias Christandl, Jeroen Zuiddam:
The border support rank of two-by-two matrix multiplication is seven. CoRR abs/1705.09652 (2017) - [i7]Matthias Christandl, Péter Vrana, Jeroen Zuiddam:
Universal points in the asymptotic spectrum of tensors. CoRR abs/1709.07851 (2017) - [i6]Karl Bringmann, Christian Ikenmeyer, Jeroen Zuiddam:
On algebraic branching programs of small width. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [i5]Harry Buhrman, Matthias Christandl, Jeroen Zuiddam:
Nondeterministic quantum communication complexity: the cyclic equality game and iterated matrix multiplication. CoRR abs/1603.03757 (2016) - [i4]Matthias Christandl, Jeroen Zuiddam:
Tensor surgery and tensor rank. CoRR abs/1606.04085 (2016) - [i3]Jop Briët, Jeroen Zuiddam:
On the orthogonal rank of Cayley graphs and impossibility of quantum round elimination. CoRR abs/1608.06113 (2016) - [i2]Matthias Christandl, Péter Vrana, Jeroen Zuiddam:
Asymptotic tensor rank of graph tensors: beyond matrix multiplication. CoRR abs/1609.07476 (2016) - 2015
- [i1]Jeroen Zuiddam:
A note on the gap between rank and border rank. CoRR abs/1504.05597 (2015)
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-12-12 20:59 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: