Jop Briët

Full Name

Dr. J. Briët

J.Briet@cwi.nl

Phone

+31 20 592 4193

Room

L238

Department(s)

Algorithms and Complexity

Function(s)

Researcher

Briët, J., Buhrman, H., Castro-Silva, D., & Neumann, N. (2024). Noisy decoding by shallow circuits with parities: Classical and quantum (extended abstract). In Innovations in Theoretical Computer Science Conference (pp. 21:1–21:11). doi:10.4230/LIPIcs.ITCS.2024.21
Briët, J., Christandl, M., Leigh, I., Shpilka, A., & Zuiddam, J. (2024). Discreteness of asymptotic tensor ranks. In Innovations in Theoretical Computer Science Conference (pp. 20:1–20:14). doi:10.4230/LIPIcs.ITCS.2024.20
Lambers, R., Briët, J., Patel, V., Spieksma, F., & Yıldız, M. A. (2023). Orthogonal schedules in single round robin tournaments. Operations Research Letters, 51(5), 528–532. doi:10.1016/j.orl.2023.08.002
Briët, J., & Castro-Silva, D. (2023). Raising the roof on the threshold for Szemerédi‘s theorem with random differences. In Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, EUROCOMB'23 (pp. 231–237). doi:10.5817/CZ.MUNI.EUROCOMB23-032
Briët, J., & Castro-Silva, D. (2023). Random restrictions of high-rank tensors and polynomial maps. In Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, EUROCOMB'23 (pp. 238–244). doi:10.5817/CZ.MUNI.EUROCOMB23-033
Briët, J., & Escudero Gutiérrez, F. (2022). On converses to the polynomial method. In Conference on the Theory of Quantum Computation, Communication and Cryptography (pp. 6:1–6:10). doi:10.4230/LIPIcs.TQC.2022.6
Briët, J., Holmes, D., & Kang, R. (2022). Steps towards openness and fairness in scientific publishing. Nieuw Archief voor Wiskunde, 5(23), 53–55.
Briët, J., & Green, B. (2021). Multiple correlation sequences not approximable by nilsequences. Ergodic Theory and Dynamical Systems, 42(9), 2711–2722. doi:10.1017/etds.2021.66
Briët, J., & Labib, F. (2021). High-entropy dual functions over finite fields and locally decodable codes. Forum of Mathematics, Sigma, 9(e19). doi:10.1017/fms.2021.1
Briët, J., & Labib, F. (2021). High-entropy dual functions over finite fields and locally decodable codes. In Innovations in Theoretical Computer Science Conference. doi:10.4230/LIPIcs.ITCS.2021.76

Outstanding paper award TQC (2020)
Andreas Bonn medal (2013)
Stieltjesprijs (2011)

Editor: Theory of Computing
Editor: Special issue of ERCIM news
Board Member: KWG
Chair: Publication committee of PWN
Board Member: MathOA
Board Member: Quantum.Amsterdam
Speaker: Invited speaker: Arithmetic progressions in random settings and locally decodable codes. Workshop on Additive Combinatorics. Harvard University
Speaker: Invited speaker: SDP-based approximation algorithms and Grothendieck inequalties. Aachen–Bonn–Cologne (ABC) lectures. Cologne
Speaker: Invited speaker: Quantum query algorithms are not entangled games. Focus week on quantum computing. ICMAT, Madrid
Speaker: Invited speaker: Arithmetic progressions in nonlocal games and quantum query algorithms. Workshop on analytical and combinatorial methods in quantum information theory. International Centre for Mathematical Sciences (ICMS), Edinburgh
Speaker: Invited speaker: Multiplayer XOR games and tensor norms. Workshop on Connes embedding problem. Banff international research station
Speaker: Invited speaker: Dual functions inapproximable by higher-order characters. Webinar on Additive Combinatorics
Speaker: Invited speaker: Unavoidable patterns. Landelijke Interuniversitaire Mathematische Olympiade (LIMO)
Speaker: Invited speaker: Noisy decoding with small circuits and polynomial equidistribution. Workshop on Tensors in Algebraic Complexity and Combinatorics. Centre de recherches mathematiques (CRM), Montreal
Speaker: Invited speaker: Polynomial maps with biased input-distributions. Workshop on Additive Combinatorics and Algebraic Connections. IAS, Princeton
Speaker: Invited speaker: Structure versus randomness and applications. Mathematics colloquium. University of Amsterdam
Speaker: Invited speaker: Discreteness of asymptotic slice rank and asymptotic subrank. SIAM mini-symposium on Asymptotic Algebra and Geometry. TU Eindhoven.
Speaker: Invited speaker: Randomness and structure in combinatorics, analysis and computer science. Joint mathematics colloquium. Universidad Carlos III, Madrid
Speaker: Invited speaker: Grothendieck inequalities and quantum query algorithms. Workshop on Functional Analysis and Quantum Information. ICMAT, Madrid
Lecturer: Mastermath course on additive combinatorics
Committee member: 19th Annual Conference on Theory of Quantum Computation, Communication and Cryptography (TQC'24)

Veni Innovational Research Grant NWO (2014)
Rubicon (2012)

Networks (Networks)

Jop Briët

Publications

Awards

Professional activities

Grants

Current projects with external funding

Jop Briët

Publications

Awards

Professional activities

Grants

Current projects with external funding

Cookies