Rainer Schuler
Impact in
-
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
- semigroups and automata theory
- Computability, Logic, AI Algorithms
- Formal Methods in Verification
-
- Machine Learning and Algorithms
- Cryptography and Data Security
Papers in
-
- Complexity and Algorithms in Graphs 7
- Computability, Logic, AI Algorithms 6
- semigroups and automata theory 6
- Advanced Graph Theory Research 2
-
- Machine Learning and Algorithms 3
- Cryptography and Data Security 2
- Co-authors
- Hubert Hug (1 shared paper)Johannes Köbler (3 shared papers)V. Arvind (2 shared papers)Uwe Schöning (3 shared papers)Hans A. Kestler (5 shared papers)Osamu Watanabe (3 shared papers)Tomoyuki Yamakami (1 shared paper)Martin Mundhenk (1 shared paper)
In The Last Decade
Rainer Schuler
17 papers receiving 124 citations
Peers
Comparison fields: 5 of 44
- Computational Theory and Mathematics 82
- Artificial Intelligence 57
- Computer Networks and Communications 30
- Applied Psychology 3
- Molecular Biology 38
Countries citing papers authored by Rainer Schuler
This map shows the geographic impact of Rainer Schuler'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 Rainer Schuler with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Rainer Schuler more than expected).
Fields of papers citing papers by Rainer Schuler
This network shows the impact of papers produced by Rainer Schuler. 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 Rainer Schuler. The network helps show where Rainer Schuler may publish in the future.
Co-authors
The 25 scholars most cited alongside Rainer Schuler, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2004 | 43 | |
| 2 | 2003 | 27 | |
| 3 | 1995 | 9 | |
| 4 | 2008 | 8 | |
| 5 | 1995 | 7 | |
| 6 | 2021 | 5 | |
| 7 | 2021 | 5 | |
| 8 | 1991 | 4 | |
| 9 | 1995 | 4 | |
| 10 | 2006 | 4 | |
| 11 | 2000 | 4 | |
| 12 | 1996 | 3 | |
| 13 | 2022 | 3 | |
| 14 | 2017 | 3 | |
| 15 | 2002 | 2 | |
| 16 | 2004 | 2 | |
| 17 | 1998 | 2 | |
| 18 | Randomized Quicksort and the Entropy of the Random Number Generator | 2004 | 1 |
| 19 | 1997 | 0 | |
| 20 | 2002 | 0 |
About Rainer Schuler
Rainer Schuler is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Computer Networks and Communications, Molecular Biology and Statistics and Probability, having authored 20 papers that have together received 136 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (7 papers), Computability, Logic, AI Algorithms (6 papers), semigroups and automata theory (6 papers), Machine Learning and Algorithms (3 papers), Constraint Satisfaction and Optimization (3 papers), Cryptography and Data Security (2 papers), Advanced Graph Theory Research (2 papers) and Benford’s Law and Fraud Detection (2 papers). The work is most often cited by research in Computational Theory and Mathematics (82 citations), Artificial Intelligence (57 citations), Computer Networks and Communications (30 citations), Applied Psychology (3 citations) and Molecular Biology (38 citations). Rainer Schuler has collaborated with scholars based in Germany, Japan and India. Frequent co-authors include Hubert Hug, Johannes Köbler, V. Arvind, Uwe Schöning, Hans A. Kestler, Osamu Watanabe, Tomoyuki Yamakami, Martin Mundhenk, André Frotta Müller and Peter Kühn. Their work appears in journals such as Theory of Computing Systems, Journal of Theoretical Biology, Journal of Computer and System Sciences, IEEE Access and Journal of Algorithms.
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.