C. P. Schnorr

550 total citations
5 papers, 236 citations indexed

About

C. P. Schnorr is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Discrete Mathematics and Combinatorics. According to data from OpenAlex, C. P. Schnorr has authored 5 papers receiving a total of 236 indexed citations (citations by other indexed papers that have themselves been cited), including 2 papers in Computational Theory and Mathematics, 1 paper in Computer Networks and Communications and 1 paper in Discrete Mathematics and Combinatorics. Recurrent topics in C. P. Schnorr's work include Markov Chains and Monte Carlo Methods (1 paper), Advanced Topology and Set Theory (1 paper) and Optimization and Search Problems (1 paper). C. P. Schnorr is often cited by papers focused on Markov Chains and Monte Carlo Methods (1 paper), Advanced Topology and Set Theory (1 paper) and Optimization and Search Problems (1 paper). C. P. Schnorr collaborates with scholars based in Germany and United States. C. P. Schnorr's co-authors include H. W. Lenstra and Jeffrey C. Lagarias and has published in prestigious journals such as SIAM Journal on Computing, COMBINATORICA and Theory of Computing Systems.

In The Last Decade

C. P. Schnorr

5 papers receiving 212 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
C. P. Schnorr Germany	5	136	118	73	49	19	5	236
David Gillman United States	8	62 0.5×	105 0.9×	67 0.9×	20 0.4×	28 1.5×	12	244
Gerd Wechsung Germany	10	308 2.3×	164 1.4×	72 1.0×	32 0.7×	16 0.8×	34	368
Luděk Kučera Czechia	8	177 1.3×	102 0.9×	75 1.0×	29 0.6×	29 1.5×	35	303
Robin A. Moser Switzerland	4	191 1.4×	78 0.7×	55 0.8×	21 0.4×	23 1.2×	5	259
Richard Schroeppel United States	7	68 0.5×	149 1.3×	78 1.1×	24 0.5×	12 0.6×	11	241
Hervé Daudé France	9	98 0.7×	48 0.4×	106 1.5×	21 0.4×	6 0.3×	13	172
Jonathan F. Buss Canada	8	215 1.6×	96 0.8×	98 1.3×	33 0.7×	16 0.8×	20	314
Danièle Beauquier France	8	197 1.4×	117 1.0×	18 0.2×	12 0.2×	8 0.4×	22	246
Kevin J. Compton United States	13	259 1.9×	215 1.8×	46 0.6×	17 0.3×	38 2.0×	33	393
Bohdan S. Majewski Australia	6	64 0.5×	152 1.3×	87 1.2×	23 0.5×	18 0.9×	7	246

Countries citing papers authored by C. P. Schnorr

Since Specialization

Citations

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

Fields of papers citing papers by C. P. Schnorr

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of C. P. Schnorr

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

All Works

Sort: Min cites: Since: Top N: Style:

5 of 5 papers shown

1.

Lagarias, Jeffrey C., H. W. Lenstra, & C. P. Schnorr. (1990). Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice. COMBINATORICA. 10(4). 333–348. 146 indexed citations

2.

Schnorr, C. P.. (1979). Bottlenecks and Edge Connectivity in Unsymmetrical Networks. SIAM Journal on Computing. 8(2). 265–274. 24 indexed citations

3.

Schnorr, C. P.. (1978). An Algorithm for Transitive Closure with Linear Expected Time. SIAM Journal on Computing. 7(2). 127–133. 37 indexed citations

4.

Schnorr, C. P., et al.. (1975). A characterization of complexity sequences. Mathematical logic quarterly. 21(1). 47–56. 6 indexed citations

5.

Schnorr, C. P.. (1974). Optimal enumerations and optimal gödel numberings. Theory of Computing Systems. 8(2). 182–191. 23 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