Jop Briët

According to our database1, Jop Briët authored at least 34 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On the Threshold for Szemerédi's Theorem with Random Differences.
Electron. J. Comb., 2024

Discreteness of Asymptotic Tensor Ranks (Extended Abstract).
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

Noisy Decoding by Shallow Circuits with Parities: Classical and Quantum (Extended Abstract).
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023
Orthogonal schedules in single round robin tournaments.
Oper. Res. Lett., September, 2023

Discreteness of asymptotic tensor ranks.
CoRR, 2023

Noisy decoding by shallow circuits with parities: classical and quantum.
CoRR, 2023

2022
Grothendieck inequalities characterize converses to the polynomial method.
CoRR, 2022

On Converses to the Polynomial Method.
Proceedings of the 17th Conference on the Theory of Quantum Computation, 2022

2021
High-Entropy Dual Functions and Locally Decodable Codes (Extended Abstract).
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

2020
Quasirandom quantum channels.
Quantum, 2020

2019
Outlaw Distributions and Locally Decodable Codes.
Theory Comput., 2019

Quantum Query Algorithms Are Completely Bounded Forms.
SIAM J. Comput., 2019

Bounding Quantum-Classical Separations for Classes of Nonlocal Games.
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

2018
Quantum Computation and Information - Introduction to the Special Theme.
ERCIM News, 2018

2017
Tight Hardness of the Non-Commutative Grothendieck Problem.
Theory Comput., 2017

Orthogonal rank and impossibility of quantum round elimination.
Quantum Inf. Comput., 2017

Gaussian width bounds with applications to arithmetic progressions in random settings.
CoRR, 2017

2016
On the orthogonal rank of Cayley graphs and impossibility of quantum round elimination.
CoRR, 2016

Revisiting the Sanders-Freiman-Ruzsa Theorem in $\mathbb{F}_p^n$ and its Application to Non-malleable Codes.
CoRR, 2016

Revisiting the Sanders-Bogolyubov-Ruzsa theorem in Fp<sup>n</sup> and its application to non-malleable codes.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Entanglement-Assisted Zero-Error Source-Channel Coding.
IEEE Trans. Inf. Theory, 2015

On the existence of 0/1 polytopes with high semidefinite extension complexity.
Math. Program., 2015

On Embeddings of ℓ<sub>1</sub><sup>k</sup> from Locally Decodable Codes.
Electron. Colloquium Comput. Complex., 2015

Round Elimination in Exact Communication Complexity.
Proceedings of the 10th Conference on the Theory of Quantum Computation, 2015

2014
Grothendieck Inequalities for Semidefinite Programs with Rank Constraint.
Theory Comput., 2014

Lower Bounds for Approximate LDCs.
Electron. Colloquium Comput. Complex., 2014

Tight Hardness of the Non-commutative Grothendieck Problem.
CoRR, 2014

Lower Bounds for Approximate LDC.
CoRR, 2014

2013
Multipartite entanglement in XOR games.
Quantum Inf. Comput., 2013

2012
Locally decodable codes and the failure of cotype for projective tensor products
CoRR, 2012

Violating the Shannon capacity of metric graphs with entanglement
CoRR, 2012

2010
Monotonicity Testing and Shortest-Path Routing on the Cube.
Electron. Colloquium Comput. Complex., 2010

The Positive Semidefinite Grothendieck Problem with Rank Constraint.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009
Locally Decodable Quantum Codes.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009


  Loading...