Dr. J. (Jeroen) Zuiddam
Universitair Docent (Assistant Professor)
Faculteit der Natuurwetenschappen, Wiskunde en Informatica
Korteweg-de Vries Instituut
Bezoekadres
- Science Park 107
- Kamernummer: F2.44
Postadres
-
Postbus 94248
1090 GE Amsterdam
Contactgegevens
Social media
-
Publicaties
2023
- Christandl, M., Gesmundo, F., & Zuiddam, J. (2023). A Gap in the Subrank of Tensors. SIAM Journal on Applied Algebra and Geometry, 7(4), 742-767. https://doi.org/10.1137/22M1543276
- Christandl, M., Lysikov, V., & Zuiddam, J. (2023). Weighted slice rank and a minimax correspondence to Strassen's spectra. Journal des Mathematiques Pures et Appliquees, 172, 299-329. https://doi.org/10.1016/j.matpur.2023.02.006
- Christandl, M., Vrana, P., & Zuiddam, J. (2023). Universal points in the asymptotic spectrum of tensors. Journal of the American Mathematical Society, 36(1), 31-79. https://doi.org/10.1090/jams/996 [details]
- Kopparty, S., Moshkovitz, G., & Zuiddam, J. (2023). Geometric Rank of Tensors and Subrank of Matrix Multiplication. Discrete Analysis, 2023. https://doi.org/10.19086/da.73322, https://doi.org/10.48550/arXiv.2002.09472
2022
Christandl, M., Fawzi, O., Ta, H., & Zuiddam, J. (2022). Larger Corner-Free Sets from Combinatorial Degenerations. In M. Braverman (Ed.), 13th Innovations in Theoretical Computer Science Conference: ITCS 2022, January 31-February 3, 2022, Berkeley, CA, USA Article 48 (Leibniz International Proceedings in Informatics; Vol. 215). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITCS.2022.48 [details]- Derksen, H., Makam, V., & Zuiddam, J. (2022). Subrank and Optimal Reduction of Scalar Multiplications to Generic Tensors. In S. Lovett (Ed.), 37th Computational Complexity Conference: CCC 2022, July 20-23, 2022, Philadelphia, USA Article 9 (Leibniz International Proceedings in Informatics; Vol. 234). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CCC.2022.9 [details]
- Robere, R., & Zuiddam, J. (2022). Amortized Circuit Complexity, Formal Complexity Measures, and Catalytic Algorithms. In Proceedings: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science: 7-10 February 2022, virtual conference (pp. 759-769). (FOCS; Vol. 2021). IEEE Computer Society. https://doi.org/10.1109/FOCS52979.2021.00079 [details]
2021
- Christandl, M., Gesmundo, F., Michałek, M., & Zuiddam, J. (2021). Border rank nonadditivity for higher order tensors. SIAM Journal on Matrix Analysis and Applications, 42(2), 503-527. https://doi.org/10.1137/20M1357366 [details]
- Christandl, M., Vrana, P., & Zuiddam, J. (2021). Barriers for Fast Matrix Multiplication from Irreversibility. Theory of Computing, 17, Article 2. https://doi.org/10.4086/toc.2021.v017a002 [details]
- Christandl, M., Vrana, P., & Zuiddam, J. (2021). Barriers for fast matrix multiplication from irreversibility. Theory of Computing, 17, Article 2. Advance online publication. https://doi.org/10.4086/toc.2021.v017a002, https://doi.org/10.4230/LIPIcs.CCC.2019.26
- Li, Y., & Zuiddam, J. (2021). Quantum Asymptotic Spectra of Graphs and Non-Commutative Graphs, and Quantum Shannon Capacities. IEEE Transactions on Information Theory, 67(1), 416-432. https://doi.org/10.1109/TIT.2020.3032686 [details]
2020
- Arunachalam, S., Vrana, P., & Zuiddam, J. (2020). The asymptotic induced matching number of hypergraphs: Balanced binary strings. Electronic Journal of Combinatorics, 27(3), Article P3.12. https://doi.org/10.37236/9019 [details]
- Kopparty, S., Moshkovitz, G., & Zuiddam, J. (2020). Geometric rank of tensors and subrank of matrix multiplication. In S. Saraf (Ed.), 35th Computational Complexity Conference: CCC 2020, July 28–31, 2020, Saarbrücken, Germany (Virtual Conference) Article 35 (Leibniz International Proceedings in Informatics; Vol. 169). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CCC.2020.35 [details]
2019
- Christandl, M., & Zuiddam, J. (2019). Tensor surgery and tensor rank. Computational Complexity, 28(1), 27-56. https://doi.org/10.1007/s00037-018-0164-8 [details]
- Christandl, M., Vrana, P., & Zuiddam, J. (2019). Asymptotic tensor rank of graph tensors: beyond matrix multiplication. Computational Complexity, 28(1), 57-111. https://doi.org/10.1007/s00037-018-0172-8 [details]
- Christandl, M., Vrana, P., & Zuiddam, J. (2019). Barriers for fast matrix multiplication from irreversibility. In A. Shpilka (Ed.), 34th Computational Complexity Conference: CCC 2019, July 18–20, 2019, New Brunswick, NJ, USA Article 26 (Leibniz International Proceedings in Informatics; Vol. 137). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CCC.2019.26 [details]
- Zuiddam, J. (2019). The Asymptotic Spectrum of Graphs and the Shannon Capacity. Combinatorica, 39(5), 1173-1184. https://doi.org/10.1007/s00493-019-3992-5 [details]
2018
- Bringmann, K., Ikenmeyer, C., & Zuiddam, J. (2018). On algebraic branching programs of small width. Journal of the ACM, 65(5), Article 32. Advance online publication. https://doi.org/10.1145/3209663 [details]
- Christandl, M., Jensen, A. K., & Zuiddam, J. (2018). Tensor rank is not multiplicative under the tensor product. Linear Algebra and Its Applications, 543, 125-139. https://doi.org/10.1016/j.laa.2017.12.020 [details]
- Christandl, M., Vrana, P., & Zuiddam, J. (2018). Universal points in the asymptotic spectrum of tensors. In I. Diakonikolas, D. Kempe, & M. Henzinger (Eds.), STOC'18: proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing : June 25-29, 2018, Los Angeles, CA, USA (pp. 289-296). Association for Computing Machinery. https://doi.org/10.1145/3188745.3188766 [details]
2017
- Bringmann, K., Ikenmeyer, C., & Zuiddam, J. (2017). On algebraic branching programs of small width. In R. O'Donnell (Ed.), 32nd Computational Complexity Conference: CCC 2017, July 6-9, 2017, Riga, Latvia Article 20 (Leibniz International Proceedings in Informatics; Vol. 79). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CCC.2017.20 [details]
- Briët, J., & Zuiddam, J. (2017). On the orthogonal rank of Cayley graphs and impossibility of quantum round elimination. Quantum Information & Computation, 17(1&2), 106-116. https://doi.org/10.26421/QIC17.1-2 [details]
- Buhrman, H., Christandl, M., & Zuiddam, J. (2017). Nondeterministic quantum communication complexity: The cyclic equality game and iterated matrix multiplication. In C. H. Papadimitriou (Ed.), 8th Innovations in Theoretical Computer Science Conference: ICTS 2017, Januar 9-11, 2017, Berkeley, CA, USA Article 24 (Leibniz International Proceedings in Informatics; Vol. 67). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITCS.2017.24 [details]
- Zuiddam, J. (2017). A note on the gap between rank and border rank. Linear Algebra and Its Applications, 525, 33-44. https://doi.org/10.1016/j.laa.2017.03.015 [details]
2016
- Buhrman, H., Christandl, M., Perry, C., & Zuiddam, J. (2016). Clean Quantum and Classical Communication Protocols. Physical Review Letters, 117(23), Article 230503. https://doi.org/10.1103/PhysRevLett.117.230503 [details]
Prijs / subsidie
- Zuiddam, J. (2021). Veni 2021.
This list of publications is extracted from the UvA-Current Research Information System. Questions? Ask the library or the Pure staff of your faculty / institute. Log in to Pure to edit your publications. Log in to Personal Page Publication Selection tool to manage the visibility of your publications on this list. -
Nevenwerkzaamheden
Geen nevenwerkzaamheden
Christandl, M., Fawzi, O., Ta, H., & Zuiddam, J. (2022). Larger Corner-Free Sets from Combinatorial Degenerations. In M. Braverman (Ed.), 13th Innovations in Theoretical Computer Science Conference: ITCS 2022, January 31-February 3, 2022, Berkeley, CA, USA Article 48 (Leibniz International Proceedings in Informatics; Vol. 215). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.