This map shows the geographic impact of Guy Kindler'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 Guy Kindler with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Guy Kindler more than expected).
This network shows the impact of papers produced by Guy Kindler. 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 Guy Kindler. The network helps show where Guy Kindler may publish in the future.
Co-authorship network of co-authors of Guy Kindler
This figure shows the co-authorship network connecting the top 25 collaborators of Guy Kindler.
A scholar is included among the top collaborators of Guy Kindler 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 Guy Kindler. Guy Kindler is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Filmus, Yuval, Yuval Ishai, Avi Kaplan, & Guy Kindler. (2020). Limits of Preprocessing. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).
Kindler, Guy, Ryan O’Donnell, & David Witmer. (2015). Continuous analogues of the Most Informative Function problem. arXiv (Cornell University).1 indexed citations
5.
Dinur, Irit, et al.. (2014). Direct Sum Testing.. Electronic colloquium on computational complexity. 21. 2.1 indexed citations
Kindler, Guy, Assaf Naor, & Gideon Schechtman. (2008). The UGC hardness threshold of the ep Grothendieck problem. Symposium on Discrete Algorithms. 64–73.5 indexed citations
12.
Arora, Sanjeev, Eli Berger, Elad Hazan, Guy Kindler, & Muli Safra. (2005). On Non-Approximability for Quadratic Programs. Electronic colloquium on computational complexity.16 indexed citations
13.
Kindler, Guy, Ryan O’Donnell, Subhash Khot, & Elchanan Mossel. (2005). Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?. Electronic colloquium on computational complexity.19 indexed citations
14.
Barak, Boaz, Guy Kindler, Ronen Shaltiel, Benny Sudakov, & Avi Wigderson. (2005). Simulating independence. 1–10.43 indexed citations
Fischer, Eldar, Guy Kindler, Dana Ron, Muli Safra, & Alex Samorodnitsky. (2004). Testing juntas. Journal of Computer and System Sciences. 68(4). 753–787.58 indexed citations
Kindler, Guy & Muli Safra. (2003). Noise-Resistant Boolean-Functions are Juntas. 34(4). 54–6.21 indexed citations
19.
Dinur, Irit, Eldar Fischer, Guy Kindler, Ran Raz, & Muli Safra. (1999). PCP characterizations of NP. 29–40.25 indexed citations
20.
Dinur, Irit, Guy Kindler, & Muli Safra. (1998). Approximating CVP to Within Almost Polynomial Factor is NP-Hard. Electronic colloquium on computational complexity. 5.2 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.