Citations per year, relative to Pavel Hrubeš Pavel Hrubeš (= 1×)
peers
John Abbott
Countries citing papers authored by Pavel Hrubeš
Since
Specialization
Citations
This map shows the geographic impact of Pavel Hrubeš'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 Pavel Hrubeš with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Pavel Hrubeš more than expected).
This network shows the impact of papers produced by Pavel Hrubeš. 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 Pavel Hrubeš. The network helps show where Pavel Hrubeš may publish in the future.
Co-authorship network of co-authors of Pavel Hrubeš
This figure shows the co-authorship network connecting the top 25 collaborators of Pavel Hrubeš.
A scholar is included among the top collaborators of Pavel Hrubeš 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 Pavel Hrubeš. Pavel Hrubeš 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.
Hrubeš, Pavel & Amir Yehudayoff. (2023). Shadows of Newton polytopes. Israel Journal of Mathematics. 256(1). 311–343.1 indexed citations
2.
Hrubeš, Pavel. (2020). . Theory of Computing. 16(1). 1–12.1 indexed citations
3.
Hrubeš, Pavel. (2019). On the complexity of computing a random Boolean function over the reals.. 26. 36.1 indexed citations
Hrubeš, Pavel. (2015). On hardness of multilinearization, and VNP completeness in characteristics two.. Electronic colloquium on computational complexity. 22. 67.1 indexed citations
6.
Hrubeš, Pavel & Avi Wigderson. (2015). . Theory of Computing. 11(1). 357–393.10 indexed citations
7.
Hrubeš, Pavel. (2013). A note on semantic cutting planes.. Electronic colloquium on computational complexity. 20. 128.4 indexed citations
8.
Hrubeš, Pavel. (2013). . Theory of Computing. 9(1). 403–411.2 indexed citations
9.
Hrubeš, Pavel & Amir Yehudayoff. (2012). Formulas are exponentially stronger than monotone circuits in non-commutative setting.. Electronic colloquium on computational complexity. 19. 61.1 indexed citations
10.
Hrubeš, Pavel. (2012). A note on the real $\tau$-conjecture and the distribution of roots.. Electronic colloquium on computational complexity. 19. 121.1 indexed citations
Hrubeš, Pavel. (2011). How much commutativity is needed to prove polynomial identities. Electronic colloquium on computational complexity. 18. 88.1 indexed citations
13.
Hrubeš, Pavel & Amir Yehudayoff. (2011). . Theory of Computing. 7(1). 119–129.7 indexed citations
Hrubeš, Pavel, Avi Wigderson, & Amir Yehudayoff. (2010). Non-commutative circuits and the sum-of-squares problem.. Electronic colloquium on computational complexity. 17. 21.1 indexed citations
16.
Hrubeš, Pavel, Avi Wigderson, & Amir Yehudayoff. (2010). Relationless completeness and separations.. Electronic colloquium on computational complexity. 17. 40.1 indexed citations
Hrubeš, Pavel, Stasys Jukna, Alexander S. Kulikov, & Pavel Pudlák. (2009). On convex complexity measures.. Electronic colloquium on computational complexity. 16. 40.1 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.