default search action
Jop Briët
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j13]Jop Briët, Davi Castro-Silva:
On the Threshold for Szemerédi's Theorem with Random Differences. Electron. J. Comb. 31(4) (2024) - [j12]Jop Briët, Francisco Escudero Gutiérrez, Sander Gribling:
Grothendieck inequalities characterize converses to the polynomial method. Quantum 8: 1526 (2024) - [c16]Jop Briët, Matthias Christandl, Itai Leigh, Amir Shpilka, Jeroen Zuiddam:
Discreteness of Asymptotic Tensor Ranks (Extended Abstract). ITCS 2024: 20:1-20:14 - [c15]Jop Briët, Harry Buhrman, Davi Castro-Silva, Niels M. P. Neumann:
Noisy Decoding by Shallow Circuits with Parities: Classical and Quantum (Extended Abstract). ITCS 2024: 21:1-21:11 - 2023
- [j11]Roel Lambers
, Jop Briët, Viresh Patel, Frits C. R. Spieksma
Orthogonal schedules in single round robin tournaments. Oper. Res. Lett. 51(5): 528-532 (2023) - [i22]Jop Briët, Harry Buhrman, Davi Castro-Silva, Niels M. P. Neumann:
Noisy decoding by shallow circuits with parities: classical and quantum. CoRR abs/2302.02870 (2023) - [i21]Jop Briët, Matthias Christandl, Itai Leigh, Amir Shpilka
Discreteness of asymptotic tensor ranks. CoRR abs/2306.01718 (2023) - 2022
- [c14]Jop Briët, Francisco Escudero Gutiérrez:
On Converses to the Polynomial Method. TQC 2022: 6:1-6:10 - [i20]Jop Briët, Francisco Escudero Gutiérrez:
On converses to the polynomial method. CoRR abs/2204.12303 (2022) - [i19]Jop Briët, Francisco Escudero Gutiérrez, Sander Gribling:
Grothendieck inequalities characterize converses to the polynomial method. CoRR abs/2212.08559 (2022) - 2021
- [c13]Jop Briët, Farrokh Labib:
High-Entropy Dual Functions and Locally Decodable Codes (Extended Abstract). ITCS 2021: 76:1-76:2 - 2020
- [j10]Tom Bannink, Jop Briët, Farrokh Labib, Hans Maassen:
Quasirandom quantum channels. Quantum 4: 298 (2020) - [c12]Tom Bannink, Jop Briët, Farrokh Labib, Hans Maassen:
Quasirandom Quantum Channels. TQC 2020: 5:1-5:20
2010 – 2019
- 2019
- [j9]Srinivasan Arunachalam, Jop Briët, Carlos Palazuelos:
Quantum Query Algorithms Are Completely Bounded Forms. SIAM J. Comput. 48(3): 903-925 (2019) - [j8]Jop Briët, Zeev Dvir, Sivakanth Gopi:
Outlaw Distributions and Locally Decodable Codes. Theory Comput. 15: 1-24 (2019) - [c11]Tom Bannink, Jop Briët, Harry Buhrman, Farrokh Labib, Troy Lee:
Bounding Quantum-Classical Separations for Classes of Nonlocal Games. STACS 2019: 12:1-12:11 - 2018
- [c10]Srinivasan Arunachalam, Jop Briët, Carlos Palazuelos
Quantum Query Algorithms are Completely Bounded Forms. ITCS 2018: 3:1-3:21 - [i18]Jop Briët, Harry Buhrman, Debbie W. Leung, Teresa Piovesan, Florian Speelman:
Round elimination in exact communication complexity. CoRR abs/1812.09290 (2018) - [i17]Jop Briët, Simon Perdrix:
Quantum Computation and Information - Introduction to the Special Theme. ERCIM News 2018(112) (2018) - 2017
- [j7]Jop Briët, Jeroen Zuiddam:
Orthogonal rank and impossibility of quantum round elimination. Quantum Inf. Comput. 17(1&2): 106-116 (2017) - [j6]Jop Briët, Oded Regev, Rishi Saket:
Tight Hardness of the Non-Commutative Grothendieck Problem. Theory Comput. 13(1): 1-24 (2017) - [c9]Jop Briët, Zeev Dvir, Sivakanth Gopi:
Outlaw Distributions and Locally Decodable Codes. ITCS 2017: 20:1-20:19 - [i16]Jop Briët, Sivakanth Gopi:
Gaussian width bounds with applications to arithmetic progressions in random settings. CoRR abs/1711.05624 (2017) - [i15]Srinivasan Arunachalam, Jop Briët, Carlos Palazuelos:
Quantum Query Algorithms are Completely Bounded Forms. CoRR abs/1711.07285 (2017) - 2016
- [c8]Divesh Aggarwal, Jop Briët:
Revisiting the Sanders-Bogolyubov-Ruzsa theorem in Fpn and its application to non-malleable codes. ISIT 2016: 1322-1326 - [i14]Divesh Aggarwal, Jop Briët:
Revisiting the Sanders-Freiman-Ruzsa Theorem in $\mathbb{F}_p^n$ and its Application to Non-malleable Codes. CoRR abs/1602.02788 (2016) - [i13]Jop Briët, Jeroen Zuiddam:
On the orthogonal rank of Cayley graphs and impossibility of quantum round elimination. CoRR abs/1608.06113 (2016) - [i12]Jop Briët, Zeev Dvir, Sivakanth Gopi:
Outlaw distributions and locally decodable codes. CoRR abs/1609.06355 (2016) - [i11]Jop Briët:
On Embeddings of l1k from Locally Decodable Codes. CoRR abs/1611.06385 (2016) - 2015
- [j5]Jop Briët, Daniel Dadush
On the existence of 0/1 polytopes with high semidefinite extension complexity. Math. Program. 153(1): 179-199 (2015) - [j4]Jop Briët, Harry Buhrman, Monique Laurent
Entanglement-Assisted Zero-Error Source-Channel Coding. IEEE Trans. Inf. Theory 61(2): 1124-1138 (2015) - [c7]Jop Briët, Oded Regev, Rishi Saket:
Tight Hardness of the Non-commutative Grothendieck Problem. FOCS 2015: 1108-1122 - [c6]Jop Briët, Harry Buhrman, Debbie W. Leung, Teresa Piovesan, Florian Speelman
Round Elimination in Exact Communication Complexity. TQC 2015: 206-225 - [i10]Jop Briët:
On Embeddings of ℓ1k from Locally Decodable Codes. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j3]Jop Briët, Fernando Mário de Oliveira Filho, Frank Vallentin:
Grothendieck Inequalities for Semidefinite Programs with Rank Constraint. Theory Comput. 10: 77-105 (2014) - [c5]Jop Briët, Zeev Dvir, Guangda Hu, Shubhangi Saraf:
Lower Bounds for Approximate LDCs. ICALP (1) 2014: 259-270 - [i9]Jop Briët, Zeev Dvir, Guangda Hu, Shubhangi Saraf:
Lower Bounds for Approximate LDC. CoRR abs/1402.6952 (2014) - [i8]Jop Briët, Oded Regev:
Tight Hardness of the Non-commutative Grothendieck Problem. CoRR abs/1412.4413 (2014) - [i7]Jop Briët, Zeev Dvir, Guangda Hu, Shubhangi Saraf:
Lower Bounds for Approximate LDCs. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j2]Jop Briët, Harry Buhrman, Troy Lee, Thomas Vidick:
Multipartite entanglement in XOR games. Quantum Inf. Comput. 13(3-4): 334-360 (2013) - [c4]Jop Briët, Daniel Dadush
On the Existence of 0/1 Polytopes with High Semidefinite Extension Complexity. ESA 2013: 217-228 - [i6]Jop Briët, Daniel Dadush, Sebastian Pokutta:
On the existence of 0/1 polytopes with high semidefinite extension complexity. CoRR abs/1305.3268 (2013) - 2012
- [j1]Jop Briët, Sourav Chakraborty, David García-Soriano
Monotonicity testing and shortest-path routing on the cube. Comb. 32(1): 35-53 (2012) - [i5]Jop Briët, Harry Buhrman, Dion Gijswijt:
Violating the Shannon capacity of metric graphs with entanglement. CoRR abs/1207.1779 (2012) - [i4]Jop Briët, Assaf Naor, Oded Regev:
Locally decodable codes and the failure of cotype for projective tensor products. CoRR abs/1208.0539 (2012) - 2010
- [c3]Jop Briët, Sourav Chakraborty, David García-Soriano
Monotonicity Testing and Shortest-Path Routing on the Cube. APPROX-RANDOM 2010: 462-475 - [c2]Jop Briët, Fernando Mário de Oliveira Filho, Frank Vallentin:
The Positive Semidefinite Grothendieck Problem with Rank Constraint. ICALP (1) 2010: 31-42 - [i3]Jop Briët, Fernando Mário de Oliveira Filho, Frank Vallentin:
Grothendieck inequalities for semidefinite programs with rank constraint. CoRR abs/1011.1754 (2010) - [i2]David García-Soriano, Arie Matsliah, Sourav Chakraborty, Jop Briët:
Monotonicity Testing and Shortest-Path Routing on the Cube. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c1]Jop Briët, Ronald de Wolf:
Locally Decodable Quantum Codes. STACS 2009: 219-230 - [i1]Jop Briët, Fernando Mário de Oliveira Filho, Frank Vallentin:
The positive semidefinite Grothendieck problem with rank constraint. CoRR abs/0910.5765 (2009)
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 2025-03-27 23:30 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: