Voor de beste ervaring schakelt u JavaScript in en gebruikt u een moderne browser!
Je gebruikt een niet-ondersteunde browser. Deze site kan er anders uitzien dan je verwacht.

Dr. J. (Jeroen) Zuiddam

Universitair Docent (Assistant Professor)
Faculteit der Natuurwetenschappen, Wiskunde en Informatica
Korteweg-de Vries Instituut

Bezoekadres
  • Science Park 107
  • Kamernummer: F3.16
Postadres
  • Postbus 94248
    1090 GE Amsterdam
Contactgegevens
Social media
  • Publicaties

    2023

    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

    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

    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

    Prijs / subsidie

    • Zuiddam, J. (2021). Veni 2021.

    2018

    • Zuiddam, J. (2018). Algebraic complexity, asymptotic spectra and entanglement polytopes. [Thesis, externally prepared, Universiteit van Amsterdam]. Institute for Logic, Language and Computation. [details]
    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