Steffen Reith

597 total citations
20 papers, 167 citations indexed

About

Steffen Reith is a scholar working on Artificial Intelligence, Computer Networks and Communications and Computational Theory and Mathematics. According to data from OpenAlex, Steffen Reith has authored 20 papers receiving a total of 167 indexed citations (citations by other indexed papers that have themselves been cited), including 11 papers in Artificial Intelligence, 9 papers in Computer Networks and Communications and 8 papers in Computational Theory and Mathematics. Recurrent topics in Steffen Reith's work include Constraint Satisfaction and Optimization (6 papers), Physical Unclonable Functions (PUFs) and Hardware Security (5 papers) and Complexity and Algorithms in Graphs (5 papers). Steffen Reith is often cited by papers focused on Constraint Satisfaction and Optimization (6 papers), Physical Unclonable Functions (PUFs) and Hardware Security (5 papers) and Complexity and Algorithms in Graphs (5 papers). Steffen Reith collaborates with scholars based in Germany, France and Australia. Steffen Reith's co-authors include Heribert Vollmer, Christian Glaßer, Henning Schnoor, Klaus W. Wagner, Ulrich Hertrampf, Nadia Creignou, Jean‐Pierre Seifert, Marc Stöttinger, Sorin A. Huss and Michael Kasper and has published in prestigious journals such as SHILAP Revista de lepidopterología, Theoretical Computer Science and Discrete Applied Mathematics.

In The Last Decade

Steffen Reith

17 papers receiving 146 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Steffen Reith Germany 7 90 75 64 59 8 20 167
Christian Glaßer Germany 7 74 0.8× 123 1.6× 68 1.1× 82 1.4× 36 197
Pierre-Louis Cayrel France 6 55 0.6× 20 0.3× 37 0.6× 114 1.9× 8 1.0× 25 151
Daniel Mölle Germany 5 61 0.7× 106 1.4× 33 0.5× 12 0.2× 6 0.8× 6 130
Madhu Sudan India 5 76 0.8× 131 1.7× 130 2.0× 80 1.4× 2 0.3× 12 258
Hovhannes A. Harutyunyan Canada 10 244 2.7× 102 1.4× 75 1.2× 6 0.1× 9 1.1× 60 269
M. Nikhil Krishnan India 8 245 2.7× 38 0.5× 45 0.7× 65 1.1× 4 0.5× 24 263
Jung Yeon Hwang South Korea 8 84 0.9× 39 0.5× 24 0.4× 191 3.2× 7 0.9× 20 212
Farzin Haddadpour United States 7 62 0.7× 21 0.3× 36 0.6× 76 1.3× 8 1.0× 7 115
Anoosheh Heidarzadeh United States 8 148 1.6× 24 0.3× 91 1.4× 109 1.8× 1 0.1× 31 226
Roopsha Samanta United States 7 54 0.6× 23 0.3× 52 0.8× 24 0.4× 15 1.9× 18 112

Countries citing papers authored by Steffen Reith

Since Specialization
Citations

This map shows the geographic impact of Steffen Reith'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 Steffen Reith with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Steffen Reith more than expected).

Fields of papers citing papers by Steffen Reith

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Steffen Reith. 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 Steffen Reith. The network helps show where Steffen Reith may publish in the future.

Co-authorship network of co-authors of Steffen Reith

This figure shows the co-authorship network connecting the top 25 collaborators of Steffen Reith. A scholar is included among the top collaborators of Steffen Reith 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 Steffen Reith. Steffen Reith 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
2.
Weber, Arnd, Sylvain Guilley, Marc Stöttinger, et al.. (2023). Verified Value Chains, Innovation and Competition. 470–476. 1 indexed citations
3.
Weber, Arnd, Gernot Heiser, Anupam Chattopadhyay, et al.. (2020). Sichere IT ohne Schwachstellen und Hintertüren. SHILAP Revista de lepidopterología. 29(1). 30–36. 3 indexed citations
4.
Weber, Arnd, et al.. (2018). Souveränität und die IT-Wertschöpfungskette. Datenschutz und Datensicherheit - DuD. 42(5). 291–293. 1 indexed citations
5.
Weber, Arnd, et al.. (2018). Open Source Value Chains for Addressing Security Issues Efficiently. Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft). 22. 599–606. 2 indexed citations
6.
Reith, Steffen, et al.. (2013). On a FPGA-based method for authentication using Edwards curves. 5350. 1–7. 1 indexed citations
7.
Creignou, Nadia, et al.. (2012). Complexity classifications for different equivalence and audit problems for Boolean circuits. Logical Methods in Computer Science. Volume 8, Issue 3. 1 indexed citations
8.
Stöttinger, Marc, et al.. (2012). Side-channel resistant AES architecture utilizing randomized composite field representations. 5479. 125–128. 5 indexed citations
9.
Reith, Steffen, et al.. (2010). On FPGA-Based Implementations of the SHA-3 Candidate Grøstl. 316–321. 4 indexed citations
10.
Creignou, Nadia, et al.. (2009). The Complexity of Problems for Quantified Constraints. Theory of Computing Systems. 47(2). 454–490. 7 indexed citations
11.
Creignou, Nadia, et al.. (2005). Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation. Electronic colloquium on computational complexity. 4 indexed citations
12.
Glaßer, Christian, Steffen Reith, & Heribert Vollmer. (2005). The complexity of base station positioning in cellular networks. Discrete Applied Mathematics. 148(1). 1–12. 20 indexed citations
13.
Reith, Steffen, et al.. (2005). Bases for Boolean co-clones. Information Processing Letters. 96(2). 59–66. 29 indexed citations
14.
Reith, Steffen & Klaus W. Wagner. (2005). The Complexity of Problems Defined by Boolean Circuits. 141–156. 11 indexed citations
15.
Reith, Steffen & Heribert Vollmer. (2003). Optimal satisfiability for propositional calculi and constraint satisfaction problems. Information and Computation. 186(1). 1–19. 8 indexed citations
16.
Reith, Steffen & Klaus W. Wagner. (2001). On boolean lowness and boolean highness. Theoretical Computer Science. 261(2). 305–321. 4 indexed citations
17.
Glaßer, Christian, et al.. (2001). A polynomial-time approximation scheme for base station positioning in UMTS networks. 52–59. 54 indexed citations
18.
Hertrampf, Ulrich, Steffen Reith, & Heribert Vollmer. (2000). A note on closure properties of logspace MOD classes. Information Processing Letters. 75(3). 91–93. 11 indexed citations
19.
Reith, Steffen. (1999). Low- und High-Mengen in der Booleschen Hierarchie.
20.
Reith, Steffen & Heribert Vollmer. (1998). The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae. ArXiv.org. 5. 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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026