Citations per year, relative to Thomas Thierauf Thomas Thierauf (= 1×)
peers
Stathis Zachos
Countries citing papers authored by Thomas Thierauf
Since
Specialization
Citations
This map shows the geographic impact of Thomas Thierauf'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 Thomas Thierauf with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Thomas Thierauf more than expected).
This network shows the impact of papers produced by Thomas Thierauf. 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 Thomas Thierauf. The network helps show where Thomas Thierauf may publish in the future.
Co-authorship network of co-authors of Thomas Thierauf
This figure shows the co-authorship network connecting the top 25 collaborators of Thomas Thierauf.
A scholar is included among the top collaborators of Thomas Thierauf 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 Thomas Thierauf. Thomas Thierauf is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Thierauf, Thomas, et al.. (2014). Reachability in K {3, 3} -free and K 5 -free Graphs is in Unambiguous Logspace.. 2014.2 indexed citations
6.
Saxena, Nitin, et al.. (2014). Deterministic Identity Testing for Sum of Read Once ABPs. arXiv (Cornell University). 21. 158.1 indexed citations
7.
Datta, Samir, et al.. (2010). Graph Isomorphism for K {3, 3} -free and K 5 -free graphs is in Log-space.. Electronic colloquium on computational complexity. 17. 50.4 indexed citations
8.
Thierauf, Thomas, et al.. (2009). Reachability in K_{3, 3}-free Graphs and K_5-free Graphs is in Unambiguous Log-Space.. Electronic colloquium on computational complexity. 16. 29.3 indexed citations
9.
Mahajan, Meena, et al.. (2006). On the bipartite unique perfect matching problem.
10.
Thierauf, Thomas, et al.. (2004). On Closure Properties of GapL. Electronic colloquium on computational complexity.1 indexed citations
Agrawal, Manindra & Thomas Thierauf. (2000). The Formula Isomorphism Problem. SIAM Journal on Computing. 30(3). 990–1009.16 indexed citations
14.
Fenner, Stephen, et al.. (1999). Complements of Multivalued Functions.. 1999.10 indexed citations
15.
Fenner, Stephen, et al.. (1999). . 5(1). 1–20.1 indexed citations
16.
Thierauf, Thomas. (1998). The Isomorphism Problem for Read-Once Branching Programs and Arithmetic Circuits.. 1998.8 indexed citations
17.
Agrawal, Manindra, Richard Beigel, & Thomas Thierauf. (1996). Modulo Information from Nonadaptive Queries to NP. Electronic colloquium on computational complexity. 3.1 indexed citations
18.
Agrawal, Manindra & Thomas Thierauf. (1996). The Boolean Isomorphism Problem. Electronic colloquium on computational complexity. 3.2 indexed citations
Ogiwara, Mitsunori, Thomas Thierauf, Seinosuke Toda, & Osamu Watanabe. (1993). On closure properties of #P in the context of PF ○ #P. 139–146.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.