Charles Rackoff

9.7k citations
40 papers · 3.5k · 1 hit paper · h-index 17

Impact in

    • Complexity and Algorithms in Graphs
    • Computability, Logic, AI Algorithms
    • Formal Methods in Verification
    • Cryptography and Data Security
    • Privacy-Preserving Technologies in Data
    • Cryptographic Implementations and Security

Papers in

Charles Rackoff

38 papers receiving 3.1k citations

Charles Rackoff's Hit Papers

The Knowledge Complexity of Interactive Proof Systems 1989 · 1.4k citations
1.4k0+12+24Years since publication4008001.2k

Peers

Charles Rackoff
Comparison fields: 5 of 86
  • Computational Theory and Mathematics 1.5k
  • Artificial Intelligence 2.6k
  • Computer Networks and Communications 790
  • Information Systems 716
  • Computer Vision and Pattern Recognition 413
Replace Michael Ben-Or with:
Michael Ben-Or Israel
Eyal Kushilevitz Israel
Salil Vadhan United States
Howard Karloff United States
Michael O. Rabin United States
C. P. Schnorr Germany
Shlomo Moran Israel
Marek Karpiński Germany
Neil Immerman United States
Jack Minker United States
Charles Rackoff relative to Michael Ben-Or Israel Michael Ben-Or's profile →
Citations per field
00.5×1.5×
Michael Ben-Or · 1×
Citations per year

Countries citing papers authored by Charles Rackoff

Since Specialization
Citations

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

Fields of papers citing papers by Charles Rackoff

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authors

The 25 scholars most cited alongside Charles Rackoff, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Charles Rackoff Line = papers co-authored together Charles Rackoff links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 40 papers — load more, or switch the sort, to bring in the rest.

#Work
1
The Knowledge Complexity of Interactive Proof Systems
Hit paper breakdown →
19891351
2 1985477
3 1979403
4 1988294
5 1983149
6 1978139
7 1979110
8 197594
9 198061
10 198257
11 199346
12 200339
13 200037
14 198336
15 200227
16 197224
17 198617
18 200514
19 200813
20 198112

About Charles Rackoff

Charles Rackoff is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Computer Networks and Communications, Molecular Biology and Computer Vision and Pattern Recognition, having authored 40 papers that have together received 3.5k indexed citations. Recurring topics across this work include Computability, Logic, AI Algorithms (13 papers), Complexity and Algorithms in Graphs (13 papers), Cryptography and Data Security (12 papers), Cryptographic Implementations and Security (9 papers), Chaos-based Image/Signal Encryption (6 papers), DNA and Biological Computing (6 papers), semigroups and automata theory (6 papers) and Logic, Reasoning, and Knowledge (5 papers). The work is most often cited by research in Computational Theory and Mathematics (1.5k citations), Artificial Intelligence (2.6k citations), Computer Networks and Communications (790 citations), Information Systems (716 citations) and Computer Vision and Pattern Recognition (413 citations). Charles Rackoff has collaborated with scholars based in Canada, United States and Israel. Frequent co-authors include Silvio Micali, Shafi Goldwasser, Michael Luby, Jeanne Ferrante, László Lovász, Richard J. Lipton, Romas Aleliunas, Richard M. Karp, S. J. Berkowitz and Stephen Cook. Their work appears in journals such as SIAM Journal on Computing, Journal of Cryptology, Journal of Symbolic Logic, Theoretical Computer Science and Lecture notes in mathematics.

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