Charanjit S. Jutla

32 papers receiving 1.3k citations

Hit Papers

Dynamic Searchable Encryption in Very-Large Databases: Da...20142026201820222014100200300400

Peers

Charanjit S. Jutla
Comparison fields: 5 of 50
  • Artificial Intelligence 1.2k
  • Computational Theory and Mathematics 732
  • Information Systems 301
  • Computer Vision and Pattern Recognition 217
  • Computer Networks and Communications 178
Replace David A. Plaisted with:
David A. Plaisted United States
Giorgio Levi Italy
Thomas Schwentick Germany
Yuliang Zheng Australia
Andre Scedrov United States
Андрей Воронков United Kingdom
Eli Ben‐Sasson Israel
Donald Beaver United States
Ilkka Niemelä Finland
Frank Neven Belgium
Charanjit S. Jutla relative to David A. Plaisted United States David A. Plaisted's profile →
Citations per field
00.5×8.2×
David A. Plaisted · 1×
Citations per year

Countries citing papers authored by Charanjit S. Jutla

Since Specialization
Citations

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

Fields of papers citing papers by Charanjit S. Jutla

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Charanjit S. Jutla

This figure shows the co-authorship network connecting the top 25 collaborators of Charanjit S. Jutla. A scholar is included among the top collaborators of Charanjit S. Jutla 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 Charanjit S. Jutla. Charanjit S. Jutla 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
#WorkIndexed citations
1 1
2 2
3
Obfuscation Using Tensor Products.
2
4
Dynamic Searchable Encryption in Very-Large Databases: Data Structures and Implementationbreakdown →
414
5 2
6 2
7
IBM Research Report On the Circuit Complexity of Isomorphic Galois Field Transformations
2
8 42
9
Efficient Rijndael Encryption Implementation with Composite Field Arithmetic
6
10
Parallelizable Encryption Mode with Almost Free Message Integrity
1
11 57
12
Towards sound approaches to counteract power-analysis attacks
2
13 63
14
MARS - a candidate cipher for AES
79
15 4
16 3
17
On a Fixpoint Semantics and the Design of Proof Rules for Fair ParallelPrograms
1
18
Tree Automata, Mu-Calculus and Determinacy (Extended Abstract)
78
19
On Simultaneously Determinizing and Complementing omega-Automata (Extended Abstract)
4
20
The Complexity of Tree Automata and Logics of Programs (Extended Abstract)
30

About Charanjit S. Jutla

Charanjit S. Jutla is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Graphics and Computer-Aided Design, having authored 32 papers that have together received 1.4k indexed citations. Recurring topics across this work include Logic, programming, and type systems (12 papers), Cryptography and Data Security (11 papers) and Formal Methods in Verification (11 papers). The work is most often cited by research in Computational Theory and Mathematics (732 citations), Artificial Intelligence (1.2k citations) and Software (109 citations). Charanjit S. Jutla has collaborated with scholars based in United States, Netherlands and France. Frequent co-authors include E. Allen Emerson, Stanisław Jarecki, Hugo Krawczyk, Michael Steiner, Joseph Jaeger, Marcel‐Cătălin Roşu, David M. Cash, M.-C. Rosu, Rosario Gennaro and Juan A. Garay. Their work appears in journals such as IEEE Transactions on Information Theory, SIAM Journal on Computing and Theoretical Computer Science.

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