Rüdiger Reischuk

1.5k total citations
53 papers, 723 citations indexed

About

Rüdiger Reischuk is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Rüdiger Reischuk has authored 53 papers receiving a total of 723 indexed citations (citations by other indexed papers that have themselves been cited), including 30 papers in Artificial Intelligence, 29 papers in Computational Theory and Mathematics and 13 papers in Computer Networks and Communications. Recurrent topics in Rüdiger Reischuk's work include Algorithms and Data Compression (16 papers), semigroups and automata theory (15 papers) and Complexity and Algorithms in Graphs (10 papers). Rüdiger Reischuk is often cited by papers focused on Algorithms and Data Compression (16 papers), semigroups and automata theory (15 papers) and Complexity and Algorithms in Graphs (10 papers). Rüdiger Reischuk collaborates with scholars based in Germany, United States and Israel. Rüdiger Reischuk's co-authors include Stephen Cook, Cynthia Dwork, Danny Dolev, Wolfgang J. Paul, W. Paul, Bodo Manthey, Maciej Liśkiewicz, Claude Puech, Christian Schindelhauer and Thomas Zeugmann and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Rüdiger Reischuk

47 papers receiving 651 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Rüdiger Reischuk Germany 10 396 372 326 83 66 53 723
Martin Dietzfelbinger Germany 13 259 0.7× 369 1.0× 302 0.9× 93 1.1× 66 1.0× 56 629
Karl Abrahamson Canada 10 294 0.7× 327 0.9× 192 0.6× 120 1.4× 90 1.4× 23 553
Faith E. Fich Canada 15 373 0.9× 419 1.1× 359 1.1× 229 2.8× 91 1.4× 51 802
Adam L. Buchsbaum United States 14 202 0.5× 333 0.9× 296 0.9× 72 0.9× 35 0.5× 41 623
Stephen Alstrup Denmark 14 300 0.8× 281 0.8× 194 0.6× 94 1.1× 50 0.8× 43 604
Joel Seiferas United States 15 517 1.3× 525 1.4× 186 0.6× 125 1.5× 163 2.5× 47 827
D. H. Younger Canada 8 350 0.9× 493 1.3× 94 0.3× 35 0.4× 125 1.9× 17 817
Leslie M. Goldschlager Australia 9 396 1.0× 217 0.6× 158 0.5× 65 0.8× 24 0.4× 12 530
Ivan M. Havel Czechia 13 381 1.0× 246 0.7× 184 0.6× 42 0.5× 66 1.0× 46 576
P. van Emde Boas Netherlands 8 208 0.5× 296 0.8× 130 0.4× 44 0.5× 65 1.0× 18 556

Countries citing papers authored by Rüdiger Reischuk

Since Specialization
Citations

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

Fields of papers citing papers by Rüdiger Reischuk

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Rüdiger Reischuk

This figure shows the co-authorship network connecting the top 25 collaborators of Rüdiger Reischuk. A scholar is included among the top collaborators of Rüdiger Reischuk 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 Rüdiger Reischuk. Rüdiger Reischuk 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.
Reischuk, Rüdiger, et al.. (2022). Dynamic Kernels for Hitting Sets and Set Packing. Algorithmica. 84(11). 3459–3488.
2.
Reischuk, Rüdiger, et al.. (2020). Hardness of k -anonymous microaggregation. Discrete Applied Mathematics. 303. 149–158. 1 indexed citations
3.
Liśkiewicz, Maciej, et al.. (2019). Proper learning of k-term DNF formulas from satisfying assignments. Journal of Computer and System Sciences. 106. 129–144.
4.
Liśkiewicz, Maciej, et al.. (2017). Security levels in steganography – Insecurity does not imply detectability. Theoretical Computer Science. 692. 25–45. 5 indexed citations
5.
Bein, Wolfgang, Lawrence L. Larmore, John Noga, & Rüdiger Reischuk. (2009). Knowledge State Algorithms. Algorithmica. 60(3). 653–678. 4 indexed citations
6.
Bein, Wolfgang, Lawrence L. Larmore, & Rüdiger Reischuk. (2008). Knowledge States: A Tool for Randomized Online Algorithms. Hawaii International Conference on System Sciences. 476–476. 1 indexed citations
7.
Manthey, Bodo & Rüdiger Reischuk. (2005). Smoothed Analysis of the Height of Binary Search Trees. Electronic colloquium on computational complexity. 2 indexed citations
8.
Manthey, Bodo & Rüdiger Reischuk. (2005). The intractability of computing the Hamming distance. Theoretical Computer Science. 337(1-3). 331–346. 8 indexed citations
9.
Reischuk, Rüdiger, et al.. (1999). Malign Distributions for Average Case Circuit Complexity. Information and Computation. 150(2). 187–208.
10.
Reischuk, Rüdiger & Thomas Zeugmann. (1998). Learning one-variable pattern languages in linear average time. 198–208. 8 indexed citations
11.
Puech, Claude & Rüdiger Reischuk. (1996). STACS 96 : 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996 : proceedings. Springer eBooks. 2 indexed citations
12.
Dietzfelbinger, Martin, Mirosław Kutyłowski, & Rüdiger Reischuk. (1995). Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write PRAMs. Electronic colloquium on computational complexity. 2.
13.
Reischuk, Rüdiger, et al.. (1993). Different Modes of Communication. SIAM Journal on Computing. 22(5). 913–934. 8 indexed citations
14.
Reischuk, Rüdiger, et al.. (1988). On Different Modes of Communication (Extended Abstract). 162–172. 1 indexed citations
15.
Brandstädt, Andreas, Klaus Jansen, & Rüdiger Reischuk. (1987). Graph-Theoretic Concepts in Computer Science. Lecture notes in computer science. 8 indexed citations
16.
Reischuk, Rüdiger. (1985). A new solution for the Byzantine generals problem. Information and Control. 64(1-3). 23–42. 29 indexed citations
17.
Paul, W. & Rüdiger Reischuk. (1981). On time versus space II. Journal of Computer and System Sciences. 22(3). 312–327. 29 indexed citations
18.
Paul, Wolfgang J. & Rüdiger Reischuk. (1980). On alternation II. Acta Informatica. 14(4). 30 indexed citations
19.
Paul, Wolfgang J., et al.. (1980). On alternation. Acta Informatica. 14(3). 243–255. 43 indexed citations
20.
Reischuk, Rüdiger. (1978). Improved Bounds on the Problem of Time-Space Trade-Off in the Pebble Game (preliminary version). 84–91. 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