World's Best Scientists 2026 revealed!
Anindya Banerjee

Anindya Banerjee

D-Index & Metrics

Computer Science

D-Index
31
Citations
4129
World Ranking
13659
National Ranking
5446

Anindya Banerjee publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Anindya Banerjee sits on this spectrum.

32–41 publications: 7 scientists 42–51 publications: 22 scientists 52–61 publications: 82 scientists 62–71 publications: 134 scientists 72–81 publications: 249 scientists 82–91 publications: 324 scientists 92–101 publications: 421 scientists 102–111 publications: 420 scientists 112–121 publications: 497 scientists 122–131 publications: 544 scientists 132–141 publications: 555 scientists 142–151 publications: 609 scientists 152–161 publications: 559 scientists 162–171 publications: 534 scientists 172–181 publications: 556 scientists 182–191 publications: 583 scientists 192–201 publications: 519 scientists 202–211 publications: 508 scientists 212–221 publications: 490 scientists 222–231 publications: 437 scientists 232–241 publications: 423 scientists 242–251 publications: 408 scientists 252–261 publications: 377 scientists 262–271 publications: 301 scientists 272–281 publications: 335 scientists 282–291 publications: 320 scientists 292–301 publications: 293 scientists 302–311 publications: 250 scientists 312–321 publications: 238 scientists 322–331 publications: 206 scientists 332–341 publications: 209 scientists 342–351 publications: 208 scientists 352–361 publications: 162 scientists 362–371 publications: 176 scientists 372–381 publications: 127 scientists 382–391 publications: 158 scientists 392–401 publications: 128 scientists 402–411 publications: 104 scientists 412–421 publications: 94 scientists 422–431 publications: 99 scientists 432–441 publications: 83 scientists 442–451 publications: 108 scientists 452–461 publications: 73 scientists 462–471 publications: 77 scientists 472–481 publications: 69 scientists 482–491 publications: 84 scientists 492–501 publications: 62 scientists 502–511 publications: 54 scientists 512–521 publications: 57 scientists 522–531 publications: 51 scientists 532–541 publications: 51 scientists 542–551 publications: 32 scientists 552–561 publications: 38 scientists 562–571 publications: 28 scientists 572–581 publications: 43 scientists 582–591 publications: 33 scientists 592–601 publications: 41 scientists 602–611 publications: 32 scientists 612–621 publications: 28 scientists 622–631 publications: 25 scientists 632–641 publications: 27 scientists 642–651 publications: 17 scientists 652–661 publications: 20 scientists 662–671 publications: 17 scientists 672–681 publications: 15 scientists 682–691 publications: 14 scientists 692–701 publications: 21 scientists 702–711 publications: 13 scientists 712–721 publications: 12 scientists 722–731 publications: 19 scientists 732–741 publications: 14 scientists 742–751 publications: 12 scientists 752–761 publications: 10 scientists 762–771 publications: 10 scientists 772–781 publications: 11 scientists 782–791 publications: 10 scientists 792–801 publications: 11 scientists 802–811 publications: 8 scientists 812–821 publications: 8 scientists 822–831 publications: 7 scientists 832–841 publications: 11 scientists 842–851 publications: 10 scientists 852–861 publications: 5 scientists 862–871 publications: 9 scientists 872–881 publications: 4 scientists 882–891 publications: 6 scientists 892–901 publications: 3 scientists 902–911 publications: 6 scientists 912–921 publications: 3 scientists 922–931 publications: 2 scientists 932–941 publications: 2 scientists 942–951 publications: 2 scientists 952–961 publications: 3 scientists 962–971 publications: 3 scientists 972–981 publications: 3 scientists 982–990 publications: 5 scientists 991+ publications: 100 scientists
32 publications 991+

This scientist: 116 publications — 13th percentile

13% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Anindya Banerjee D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Anindya Banerjee sits on this spectrum.

30–31 D-Index: 879 scientists 32–33 D-Index: 983 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 968 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 763 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 518 scientists 54–55 D-Index: 500 scientists 56–57 D-Index: 458 scientists 58–59 D-Index: 400 scientists 60–61 D-Index: 337 scientists 62–63 D-Index: 308 scientists 64–65 D-Index: 292 scientists 66–67 D-Index: 249 scientists 68–69 D-Index: 213 scientists 70–71 D-Index: 192 scientists 72–73 D-Index: 189 scientists 74–75 D-Index: 165 scientists 76–77 D-Index: 139 scientists 78–79 D-Index: 119 scientists 80–81 D-Index: 121 scientists 82–83 D-Index: 113 scientists 84–85 D-Index: 88 scientists 86–87 D-Index: 87 scientists 88–89 D-Index: 75 scientists 90–91 D-Index: 69 scientists 92–93 D-Index: 57 scientists 94–95 D-Index: 46 scientists 96–97 D-Index: 38 scientists 98–99 D-Index: 34 scientists 100–101 D-Index: 36 scientists 102–103 D-Index: 27 scientists 104–105 D-Index: 37 scientists 106–107 D-Index: 18 scientists 108–109 D-Index: 31 scientists 110–111 D-Index: 19 scientists 112–113 D-Index: 16 scientists 114–115 D-Index: 12 scientists 116–117 D-Index: 20 scientists 118–119 D-Index: 15 scientists 120–121 D-Index: 5 scientists 122–123 D-Index: 20 scientists 124–125 D-Index: 8 scientists 126–127 D-Index: 5 scientists 128–129 D-Index: 7 scientists 130 D-Index: 3 scientists 131+ D-Index: 98 scientists
30 D-Index 131+

This scientist: 31 D-Index — 6th percentile

6% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

Overview

Anindya Banerjee is affiliated with the Madrid Institute for Advanced Studies in Spain and has an interdisciplinary research profile spanning Medicine and Computer Science. Their work frequently intersects subfields such as Artificial Intelligence, Cardiology and Cardiovascular Medicine, Surgery, Computational Theory and Mathematics, and Radiology, Nuclear Medicine, and Imaging.

Their research addresses several main topics, notably Formal Methods in Verification, Logic, Programming and Type Systems, Coronary Interventions and Diagnostics, Software Testing and Debugging Techniques, Bayesian Modeling and Causal Inference, Security and Verification in Computing, and Cardiovascular Issues in Pregnancy.

Anindya Banerjee's recent papers include:

  • "A Theory of Slicing for Imperative Probabilistic Programs" (2020) published in ACM Transactions on Programming Languages and Systems
  • "On algebraic abstractions for concurrent separation logics" (2021) published in Proceedings of the ACM on Programming Languages
  • "A Relational Program Logic with Data Abstraction and Dynamic Framing" (2022) published in ACM Transactions on Programming Languages and Systems
  • "Formally Verified Samplers from Probabilistic Programs with Loops and Conditioning" (2023) published in Proceedings of the ACM on Programming Languages
  • "Semantic Foundations of Higher-Order Probabilistic Programs in Isabelle/HOL" (2023) published in Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

The scientist has collaborated frequently with several co-authors, notably Shashikant Singh, Subhas Pramanik, Debasish Das, Abhinav Kumar, and Ramana Nagasamudram.

Anindya Banerjee's work has appeared in diverse publication venues, including:

  • Indian Heart Journal
  • arXiv (Cornell University)
  • Oxford Bulletin of Economics and Statistics
  • Cureus
  • Journal of the American College of Cardiology

Best Publications

  • A core calculus of dependency

    Martín Abadi;Anindya Banerjee;Nevin Heintze;Jon G. Riecke

  • Stack-based access control and secure information flow

    Anindya Banerjee;David A. Naumann

  • Merlin: specification inference for explicit information flow problems

    Benjamin Livshits;Aditya V. Nori;Sriram K. Rajamani;Anindya Banerjee

  • A logic for information flow in object-oriented programs

    Torben Amtoft;Sruthi Bandhakavi;Anindya Banerjee

  • Secure information flow and pointer con .nement in a java-like language

    Unknown

  • Automata-based confidentiality monitoring

    Gurvan Le Guernic;Anindya Banerjee;Thomas Jensen;David A. Schmidt

  • Expressive Declassification Policies and Modular Static Enforcement

    A. Banerjee;D.A. Naumann;S. Rosenberg

  • Regional Logic for Local Reasoning about Global Invariants

    Anindya Banerjee;David A. Naumann;Stan Rosenberg

  • Information Flow Analysis in Logical Form

    Torben Amtoft;Anindya Banerjee

  • Mechanized verification of fine-grained concurrent programs

    Ilya Sergey;Aleksandar Nanevski;Anindya Banerjee

  • Ownership confinement ensures representation independence for object-oriented programs

    Anindya Banerjee;David A. Naumann

  • Verification of Information Flow and Access Control Policies with Dependent Types

    Aleksandar Nanevski;Anindya Banerjee;Deepak Garg

  • A new foundation for control dependence and slicing for modern program structures

    Venkatesh Prasad Ranganath;Torben Amtoft;Anindya Banerjee;John Hatcliff

  • Representation independence, confinement and access control [extended abstract]

    Anindya Banerjee;David A. Naumann

  • History-based access control and secure information flow

    Anindya Banerjee;David A. Naumann

  • A modular, polyvariant and type-based closure analysis

    Anindya Banerjee

  • Beyond Stack Inspection: A Unified Access-Control and Information-Flow Security Model

    M. Pistoia;A. Banerjee;D.A. Naumann

  • A new foundation for control-dependence and slicing for modern program structures

    Venkatesh Prasad Ranganath;Torben Amtoft;Anindya Banerjee;Matthew B. Dwyer

  • Confidentiality enforcement using dynamic information flow analyses

    David Schmidt;Anindya Banerjee;Gurvan Le Guernic

  • Effectively-Propositional Reasoning about Reachability in Linked Data Structures

    Shachar Itzhaky;Anindya Banerjee;Neil Immerman;Aleksandar Nanevski

  • Using access control for secure information flow in a Java-like language

    A. Banerjee;D.A. Naumann

  • Dependent Type Theory for Verification of Information Flow and Access Control Policies

    Aleksandar Nanevski;Anindya Banerjee;Deepak Garg

Frequent Co-Authors

Andrei Sabelfeld
Andrei Sabelfeld Chalmers University of Technology
Marco Pistoia
Marco Pistoia JPMorgan Chase & Co (United States)
John Hatcliff
John Hatcliff Kansas State University
Matthew B. Dwyer
Matthew B. Dwyer University of Virginia
Olivier Danvy
Olivier Danvy National University of Singapore
Neil Immerman
Neil Immerman University of Massachusetts Amherst
Mooly Sagiv
Mooly Sagiv Tel Aviv University
Sriram K. Rajamani
Sriram K. Rajamani Microsoft (United States)
Martín Abadi
Martín Abadi Google (United States)
Benjamin Livshits
Benjamin Livshits Imperial College London

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online degrees opens up multiple pathways for those interested in pursuing Computer Science in the USA. Many students start with an associates degree online, offering a cost-effective introduction to core concepts and technical skills. This option is especially appealing for those seeking flexibility or juggling work and study.

With growing demand for advanced technology roles, pursuing one of the most useful masters degrees in fields like computer science, data analysis, or cybersecurity can significantly enhance your career prospects. These reputable programs build on foundational knowledge and position graduates for leadership roles or specialized careers.

Budget-conscious students can also benefit from researching the cheapest online college options. These accredited programs provide quality education without overwhelming student debt, making them ideal for many learners.

Concerned about past grades? Don’t be discouraged. There are best online colleges that accept low gpa, allowing you to continue your education and advance in your desired career, even if your academic record isn’t perfect.

Best Scientists Citing Anindya Banerjee

Trending Scientists

Recently Published Articles