Jop Briët

662 total citations
28 papers, 248 citations indexed

About

Jop Briët is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Jop Briët has authored 28 papers receiving a total of 248 indexed citations (citations by other indexed papers that have themselves been cited), including 19 papers in Artificial Intelligence, 10 papers in Computational Theory and Mathematics and 6 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Jop Briët's work include Quantum Computing Algorithms and Architecture (10 papers), Coding theory and cryptography (8 papers) and Complexity and Algorithms in Graphs (7 papers). Jop Briët is often cited by papers focused on Quantum Computing Algorithms and Architecture (10 papers), Coding theory and cryptography (8 papers) and Complexity and Algorithms in Graphs (7 papers). Jop Briët collaborates with scholars based in Netherlands, United States and Singapore. Jop Briët's co-authors include Peter Harremoës, Harry Buhrman, Ben Toner, David García-Soriano, Sivakanth Gopi, Troy Lee, Dion Gijswijt, Daniel Dadush, Thomas Vidick and Sebastian Pokutta and has published in prestigious journals such as Proceedings of the National Academy of Sciences, Physical Review A and Communications in Mathematical Physics.

In The Last Decade

Jop Briët

25 papers receiving 229 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Jop Briët Netherlands	8	151	77	73	49	22	28	248
Frank Vallentin Netherlands	8	52 0.3×	102 1.3×	24 0.3×	13 0.3×	112 5.1×	27	264
Bo-Ying Wang China	10	42 0.3×	114 1.5×	20 0.3×	17 0.3×	13 0.6×	23	266
Masayuki Noro Japan	7	49 0.3×	155 2.0×	12 0.2×	13 0.3×	17 0.8×	25	245
Mika Hirvensalo Finland	10	239 1.6×	188 2.4×	75 1.0×	12 0.2×	10 0.5×	32	326
Hans F. de Groote Germany	8	101 0.7×	79 1.0×	10 0.1×	19 0.4×	13 0.6×	11	196
Rainer Kemp Germany	8	113 0.7×	136 1.8×	22 0.3×	26 0.5×	14 0.6×	47	290
Minerva Catral United States	9	27 0.2×	193 2.5×	10 0.1×	39 0.8×	45 2.0×	37	275
Andrei Romashchenko Russia	7	99 0.7×	175 2.3×	12 0.2×	22 0.4×	4 0.2×	25	293
Artur Korniłowicz Poland	11	388 2.6×	308 4.0×	46 0.6×	15 0.3×	6 0.3×	66	527
Adam Naumowicz Poland	7	253 1.7×	177 2.3×	35 0.5×	14 0.3×	2 0.1×	27	341

Countries citing papers authored by Jop Briët

Since Specialization

Citations

This map shows the geographic impact of Jop Briët's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Jop Briët with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jop Briët more than expected).

Fields of papers citing papers by Jop Briët

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jop Briët. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Jop Briët. The network helps show where Jop Briët may publish in the future.

Co-authorship network of co-authors of Jop Briët

This figure shows the co-authorship network connecting the top 25 collaborators of Jop Briët. A scholar is included among the top collaborators of Jop Briët based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Jop Briët. Jop Briët is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Briët, Jop, et al.. (2024). Discreteness of Asymptotic Tensor Ranks (Extended Abstract). DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

Briët, Jop, et al.. (2023). Raising the roof on the threshold for Szemerédi's theorem with random differences. 231–237. 1 indexed citations

Briët, Jop, et al.. (2023). Orthogonal schedules in single round robin tournaments. Operations Research Letters. 51(5). 528–532.

Briët, Jop, et al.. (2023). Random restrictions of high-rank tensors and polynomial maps. 238–244. 1 indexed citations

Briët, Jop, et al.. (2021). Subspaces of tensors with high analytic rank. 1–9.

Briët, Jop & Ben Green. (2021). Multiple correlation sequences not approximable by nilsequences. Ergodic Theory and Dynamical Systems. 42(9). 2711–2722. 1 indexed citations

Briët, Jop, Zeev Dvir, & Sivakanth Gopi. (2019). . Theory of Computing. 15(1). 1–24. 3 indexed citations

Briët, Jop & Simon Perdrix. (2018). Quantum Computation and Information - Introduction to the Special Theme.. ERCIM news/ERCIM news online edition. 2018. 1 indexed citations

Arunachalam, Srinivasan, Jop Briët, & Carlos Palazuelos. (2018). Quantum Query Algorithms are Completely Bounded Forms. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 94. 21. 1 indexed citations

10.

Briët, Jop, Oded Regev, & Rishi Saket. (2017). . Theory of Computing. 13(1). 1–24.

11.

Briët, Jop, et al.. (2017). On the orthogonal rank and impossibility of quantum round elimination. Quantum Information and Computation. 17(1&2). 106–116. 1 indexed citations

12.

Briët, Jop, et al.. (2015). Round Elimination in Exact Communication Complexity. arXiv (Cornell University). 2 indexed citations

13.

Briët, Jop, et al.. (2014). . Theory of Computing. 10(1). 77–105. 10 indexed citations

14.

Briët, Jop, Harry Buhrman, Troy Lee, & Thomas Vidick. (2013). Multipartite entanglement in XOR games. Quantum Information and Computation. 13(3&4). 334–360. 7 indexed citations

15.

Regev, Oded, Assaf Naor, & Jop Briët. (2012). Locally decodable codes and the failure of cotype for projective tensor products. arXiv (Cornell University). 19(0). 120–130. 5 indexed citations

16.

Briët, Jop, et al.. (2012). Monotonicity testing and shortest-path routing on the cube. COMBINATORICA. 32(1). 35–53. 24 indexed citations

17.

Briët, Jop, Harry Buhrman, & Dion Gijswijt. (2012). Violating the Shannon capacity of metric graphs with entanglement. Proceedings of the National Academy of Sciences. 110(48). 19227–19232. 7 indexed citations

18.

Briët, Jop, Harry Buhrman, Troy Lee, & Thomas Vidick. (2011). All Schatten spaces endowed with the Schur product are Q-algebras. Journal of Functional Analysis. 262(1). 1–9. 4 indexed citations

19.

Briët, Jop, Harry Buhrman, & Dion Gijswijt. (2011). Separations between Shannon capacity and zero error entanglement assisted capacity. Data Archiving and Networked Services (DANS). 1 indexed citations

20.

Briët, Jop & Peter Harremoës. (2009). Properties of classical and quantum Jensen-Shannon divergence. Physical Review A. 79(5). 128 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact