Jop Briët - RankMe

54 papers A* 2A 8B 1Journal 37Unranked 6

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	A near-optimal quadratic Goldreich-Levin algorithm (extended abstract). SODA Jop Briët, Davi Castro-Silva
2025	J	`jnl`	A near-optimal Quadratic Goldreich-Levin algorithm. CoRR Jop Briët, Davi Castro-Silva
2025	J	`jnl`	Clifford testing: algorithms and lower bounds. CoRR Marcel Hinsche, Zongbo Bao, Philippe van Dordrecht, Jens Eisert, Jop Briët, Jonas Helsen
2024	A	`conf`	Discreteness of Asymptotic Tensor Ranks (Extended Abstract). ITCS Jop Briët, Matthias Christandl, Itai Leigh, Amir Shpilka, Jeroen Zuiddam
2024	J	`jnl`	Grothendieck inequalities characterize converses to the polynomial method. Quantum Jop Briët, Francisco Escudero Gutiérrez, Sander Gribling
2024	A	`conf`	Noisy Decoding by Shallow Circuits with Parities: Classical and Quantum (Extended Abstract). ITCS Jop Briët, Harry Buhrman, Davi Castro-Silva, Niels M. P. Neumann
2024	J	`jnl`	On the Threshold for Szemerédi's Theorem with Random Differences. Electron. J. Comb. Jop Briët, Davi Castro-Silva
2023	J	`jnl`	Discreteness of asymptotic tensor ranks. CoRR Jop Briët, Matthias Christandl, Itai Leigh, Amir Shpilka, Jeroen Zuiddam
2023	J	`jnl`	Noisy decoding by shallow circuits with parities: classical and quantum. CoRR Jop Briët, Harry Buhrman, Davi Castro-Silva, Niels M. P. Neumann
2023	J	`jnl`	Orthogonal schedules in single round robin tournaments. Oper. Res. Lett. Roel Lambers, Jop Briët, Viresh Patel, Frits C. R. Spieksma, Mehmet Akif Yildiz
2022	J	`jnl`	Grothendieck inequalities characterize converses to the polynomial method. CoRR Jop Briët, Francisco Escudero Gutiérrez, Sander Gribling
2022	—	`conf`	On Converses to the Polynomial Method. TQC Jop Briët, Francisco Escudero Gutiérrez
2022	J	`jnl`	On converses to the polynomial method. CoRR Jop Briët, Francisco Escudero Gutiérrez
2021	A	`conf`	High-Entropy Dual Functions and Locally Decodable Codes (Extended Abstract). ITCS Jop Briët, Farrokh Labib
2020	—	`conf`	Quasirandom Quantum Channels. TQC Tom Bannink, Jop Briët, Farrokh Labib, Hans Maassen
2020	J	`jnl`	Quasirandom quantum channels. Quantum Tom Bannink, Jop Briët, Farrokh Labib, Hans Maassen
2019	A	`conf`	Bounding Quantum-Classical Separations for Classes of Nonlocal Games. STACS Tom Bannink, Jop Briët, Harry Buhrman, Farrokh Labib, Troy Lee
2019	J	`jnl`	Outlaw Distributions and Locally Decodable Codes. Theory Comput. Jop Briët, Zeev Dvir, Sivakanth Gopi
2019	J	`jnl`	Quantum Query Algorithms Are Completely Bounded Forms. SIAM J. Comput. Srinivasan Arunachalam, Jop Briët, Carlos Palazuelos
2018	J	`jnl`	Quantum Computation and Information - Introduction to the Special Theme. ERCIM News Jop Briët, Simon Perdrix
2018	A	`conf`	Quantum Query Algorithms are Completely Bounded Forms. ITCS Srinivasan Arunachalam, Jop Briët, Carlos Palazuelos
2018	J	`jnl`	Round elimination in exact communication complexity. CoRR Jop Briët, Harry Buhrman, Debbie W. Leung, Teresa Piovesan, Florian Speelman
2017	J	`jnl`	Gaussian width bounds with applications to arithmetic progressions in random settings. CoRR Jop Briët, Sivakanth Gopi
2017	J	`jnl`	Orthogonal rank and impossibility of quantum round elimination. Quantum Inf. Comput. Jop Briët, Jeroen Zuiddam
2017	A	`conf`	Outlaw Distributions and Locally Decodable Codes. ITCS Jop Briët, Zeev Dvir, Sivakanth Gopi
2017	J	`jnl`	Quantum Query Algorithms are Completely Bounded Forms. CoRR Srinivasan Arunachalam, Jop Briët, Carlos Palazuelos
2017	J	`jnl`	Tight Hardness of the Non-Commutative Grothendieck Problem. Theory Comput. Jop Briët, Oded Regev, Rishi Saket
2016	J	`jnl`	On Embeddings of l CoRR Jop Briët
2016	J	`jnl`	On the orthogonal rank of Cayley graphs and impossibility of quantum round elimination. CoRR Jop Briët, Jeroen Zuiddam
2016	J	`jnl`	Outlaw distributions and locally decodable codes. CoRR Jop Briët, Zeev Dvir, Sivakanth Gopi
2016	B	`conf`	Revisiting the Sanders-Bogolyubov-Ruzsa theorem in Fp ISIT Divesh Aggarwal, Jop Briët
2016	J	`jnl`	Revisiting the Sanders-Freiman-Ruzsa Theorem in $\mathbb{F}_p^n$ and its Application to Non-malleable Codes. CoRR Divesh Aggarwal, Jop Briët
2015	J	`jnl`	Entanglement-Assisted Zero-Error Source-Channel Coding. IEEE Trans. Inf. Theory Jop Briët, Harry Buhrman, Monique Laurent, Teresa Piovesan, Giannicola Scarpa
2015	J	`jnl`	On Embeddings of ℓ Electron. Colloquium Comput. Complex. Jop Briët
2015	J	`jnl`	On the existence of 0/1 polytopes with high semidefinite extension complexity. Math. Program. Jop Briët, Daniel Dadush, Sebastian Pokutta
2015	—	`conf`	Round Elimination in Exact Communication Complexity. TQC Jop Briët, Harry Buhrman, Debbie W. Leung, Teresa Piovesan, Florian Speelman
2015	A*	`conf`	Tight Hardness of the Non-commutative Grothendieck Problem. FOCS Jop Briët, Oded Regev, Rishi Saket
2014	J	`jnl`	Grothendieck Inequalities for Semidefinite Programs with Rank Constraint. Theory Comput. Jop Briët, Fernando Mário de Oliveira Filho, Frank Vallentin
2014	J	`jnl`	Lower Bounds for Approximate LDC. CoRR Jop Briët, Zeev Dvir, Guangda Hu, Shubhangi Saraf
2014	—	`conf`	Lower Bounds for Approximate LDCs. ICALP (1) Jop Briët, Zeev Dvir, Guangda Hu, Shubhangi Saraf
2014	J	`jnl`	Lower Bounds for Approximate LDCs. Electron. Colloquium Comput. Complex. Jop Briët, Zeev Dvir, Guangda Hu, Shubhangi Saraf
2014	J	`jnl`	Tight Hardness of the Non-commutative Grothendieck Problem. CoRR Jop Briët, Oded Regev
2013	J	`jnl`	Multipartite entanglement in XOR games. Quantum Inf. Comput. Jop Briët, Harry Buhrman, Troy Lee, Thomas Vidick
2013	A	`conf`	On the Existence of 0/1 Polytopes with High Semidefinite Extension Complexity. ESA Jop Briët, Daniel Dadush, Sebastian Pokutta
2013	J	`jnl`	On the existence of 0/1 polytopes with high semidefinite extension complexity CoRR Jop Briët, Daniel Dadush, Sebastian Pokutta
2012	J	`jnl`	Locally decodable codes and the failure of cotype for projective tensor products CoRR Jop Briët, Assaf Naor, Oded Regev
2012	J	`jnl`	Monotonicity testing and shortest-path routing on the cube. Comb. Jop Briët, Sourav Chakraborty, David García-Soriano, Arie Matsliah
2012	J	`jnl`	Violating the Shannon capacity of metric graphs with entanglement CoRR Jop Briët, Harry Buhrman, Dion Gijswijt
2010	J	`jnl`	Grothendieck inequalities for semidefinite programs with rank constraint CoRR Jop Briët, Fernando Mário de Oliveira Filho, Frank Vallentin
2010	—	`conf`	Monotonicity Testing and Shortest-Path Routing on the Cube. APPROX-RANDOM Jop Briët, Sourav Chakraborty, David García-Soriano, Arie Matsliah
2010	J	`jnl`	Monotonicity Testing and Shortest-Path Routing on the Cube. Electron. Colloquium Comput. Complex. David García-Soriano, Arie Matsliah, Sourav Chakraborty, Jop Briët
2010	—	`conf`	The Positive Semidefinite Grothendieck Problem with Rank Constraint. ICALP (1) Jop Briët, Fernando Mário de Oliveira Filho, Frank Vallentin
2009	A	`conf`	Locally Decodable Quantum Codes. STACS Jop Briët, Ronald de Wolf
2009	J	`jnl`	The positive semidefinite Grothendieck problem with rank constraint. CoRR Jop Briët, Fernando Mário de Oliveira Filho, Frank Vallentin