Claus-Peter Schnorr

615 total citations
17 papers, 201 citations indexed

About

Claus-Peter Schnorr is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Information Systems. According to data from OpenAlex, Claus-Peter Schnorr has authored 17 papers receiving a total of 201 indexed citations (citations by other indexed papers that have themselves been cited), including 8 papers in Artificial Intelligence, 7 papers in Computational Theory and Mathematics and 3 papers in Information Systems. Recurrent topics in Claus-Peter Schnorr's work include Cryptography and Data Security (5 papers), Coding theory and cryptography (4 papers) and Computability, Logic, AI Algorithms (4 papers). Claus-Peter Schnorr is often cited by papers focused on Cryptography and Data Security (5 papers), Coding theory and cryptography (4 papers) and Computability, Logic, AI Algorithms (4 papers). Claus-Peter Schnorr collaborates with scholars based in Germany, France and United States. Claus-Peter Schnorr's co-authors include Brian LaMacchia, M.J. Coster, Antoine Joux, Jacques Stern and Andrew Odlyzko and has published in prestigious journals such as Probability Theory and Related Fields, Lecture notes in computer science and Computational Complexity.

In The Last Decade

Claus-Peter Schnorr

16 papers receiving 176 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Claus-Peter Schnorr Germany 5 135 120 26 18 18 17 201
Gudmund Skovbjerg Frandsen Denmark 9 124 0.9× 118 1.0× 25 1.0× 25 1.4× 14 0.8× 38 187
Leonard H. Soicher United Kingdom 9 125 0.9× 79 0.7× 8 0.3× 8 0.4× 122 6.8× 31 284
Jun Tarui Japan 8 136 1.0× 179 1.5× 5 0.2× 30 1.7× 43 2.4× 19 219
Divesh Aggarwal Singapore 7 180 1.3× 63 0.5× 82 3.2× 28 1.6× 31 1.7× 26 236
Stål Aanderaa Norway 6 144 1.1× 126 1.1× 94 3.6× 15 0.8× 25 1.4× 10 242
Leen Torenvliet Netherlands 10 162 1.2× 208 1.7× 3 0.1× 35 1.9× 7 0.4× 39 252
M.J. Coster Netherlands 5 94 0.7× 42 0.3× 26 1.0× 13 0.7× 20 1.1× 9 135
László Csirmaz Hungary 9 199 1.5× 174 1.4× 12 0.5× 42 2.3× 48 2.7× 25 243
Danièle Beauquier France 8 117 0.9× 197 1.6× 8 0.3× 18 1.0× 12 0.7× 22 246
Miki Hermann France 7 126 0.9× 185 1.5× 5 0.2× 63 3.5× 10 0.6× 24 251

Countries citing papers authored by Claus-Peter Schnorr

Since Specialization
Citations

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

Fields of papers citing papers by Claus-Peter Schnorr

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Claus-Peter Schnorr

This figure shows the co-authorship network connecting the top 25 collaborators of Claus-Peter Schnorr. A scholar is included among the top collaborators of Claus-Peter Schnorr 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 Claus-Peter Schnorr. Claus-Peter Schnorr is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

17 of 17 papers shown
1.
Schnorr, Claus-Peter. (2011). Accelerated Slide- and LLL-Reduction.. Electronic colloquium on computational complexity. 18. 50. 3 indexed citations
2.
Schnorr, Claus-Peter. (1998). Security of Allmost ALL Discrete Log Bits. Electronic colloquium on computational complexity. 5. 4 indexed citations
3.
Schnorr, Claus-Peter. (1996). Security of 2t-Root Identification and Signatures. Lecture notes in computer science. 3. 143–156. 1 indexed citations
4.
Schnorr, Claus-Peter, et al.. (1995). Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction. Lecture notes in computer science. 2. 1–12. 6 indexed citations
5.
Coster, M.J., Antoine Joux, Brian LaMacchia, et al.. (1992). Improved low-density subset sum algorithms. Computational Complexity. 2(2). 111–128. 97 indexed citations
6.
Schnorr, Claus-Peter. (1989). Efficient Identification and Signatures for Smart Cards (Abstract).. 688–689. 2 indexed citations
7.
Schnorr, Claus-Peter, et al.. (1987). The Multiplicative Complexity of Quadratic Boolean Forms. 141–150. 3 indexed citations
8.
Schnorr, Claus-Peter, et al.. (1984). RSA-Bits are 0.5 + epsilon Secure.. 113–126. 1 indexed citations
9.
Schnorr, Claus-Peter, et al.. (1982). Ein Effizienzvergleich der Factorisierungsverfahren von Morrison-Brillhart und Schroeppel.. 331–351. 1 indexed citations
10.
Schnorr, Claus-Peter. (1976). Optimal Algorithms for Self-Reducible Problems.. International Colloquium on Automata, Languages and Programming. 322–337. 56 indexed citations
11.
Schnorr, Claus-Peter. (1973). Lower Bounds for the Product of Time and Space Requirements of Turing Machine Computations.. 153–161. 4 indexed citations
12.
Schnorr, Claus-Peter. (1972). Does the Computational Speed-up Concern Programming?. International Colloquium on Automata, Languages and Programming. 585–591. 4 indexed citations
13.
Schnorr, Claus-Peter. (1971). Optimal Gödel Numberings.. IFIP Congress. 56–58. 2 indexed citations
14.
Schnorr, Claus-Peter. (1971). Komplexität von Algorithmen mit Anwendung auf die Analysis. Archive for Mathematical Logic. 14(1-2). 54–68. 2 indexed citations
15.
Schnorr, Claus-Peter, et al.. (1969). Pullbackkonstruktionen bei Semi-Thuesystemen.. Journal of automata, languages and combinatorics. 5(1). 27–36. 6 indexed citations
16.
Schnorr, Claus-Peter. (1969). Eine Bemerkung zum Begriff der zuf�lligen Folge. Probability Theory and Related Fields. 14(1). 27–35. 9 indexed citations
17.
Schnorr, Claus-Peter. (1967). Freie assoziative Systeme.. Journal of automata, languages and combinatorics. 3. 319–340.

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

Breakdown of academic impact, for papers by Gudmund Skovbjerg Frandsen Breakdown of academic impact, for papers by Leonard H. Soicher Breakdown of academic impact, for papers by Jun Tarui Breakdown of academic impact, for papers by Divesh Aggarwal Breakdown of academic impact, for papers by Stål Aanderaa Breakdown of academic impact, for papers by Leen Torenvliet Breakdown of academic impact, for papers by M.J. Coster Breakdown of academic impact, for papers by László Csirmaz Breakdown of academic impact, for papers by Danièle Beauquier Breakdown of academic impact, for papers by Miki Hermann
Rankless by CCL
2026