Rohit Chadha

981 total citations
30 papers, 262 citations indexed

About

Rohit Chadha is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Rohit Chadha has authored 30 papers receiving a total of 262 indexed citations (citations by other indexed papers that have themselves been cited), including 22 papers in Artificial Intelligence, 15 papers in Computational Theory and Mathematics and 13 papers in Computer Networks and Communications. Recurrent topics in Rohit Chadha's work include Formal Methods in Verification (15 papers), Cryptography and Data Security (10 papers) and Logic, Reasoning, and Knowledge (6 papers). Rohit Chadha is often cited by papers focused on Formal Methods in Verification (15 papers), Cryptography and Data Security (10 papers) and Logic, Reasoning, and Knowledge (6 papers). Rohit Chadha collaborates with scholars based in United States, France and United Kingdom. Rohit Chadha's co-authors include Mahesh Viswanathan, Andre Scedrov, Paulo Mateus, Amı́lcar Sernadas, Max Kanovich, A. Prasad Sistla, Steve Kremer, Vincent Cheval, Ştefan Ciobâcă and Luı́s Cruz-Filipe and has published in prestigious journals such as IEEE Access, Journal of the ACM and Theoretical Computer Science.

In The Last Decade

Rohit Chadha

25 papers receiving 247 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Rohit Chadha United States	10	193	126	78	52	32	30	262
Federico Olmedo Chile	7	211 1.1×	113 0.9×	32 0.4×	19 0.4×	25 0.8×	13	235
Herbert Wiklicky United Kingdom	10	255 1.3×	98 0.8×	118 1.5×	46 0.9×	22 0.7×	44	315
Alessandra Di Pierro Italy	11	368 1.9×	159 1.3×	134 1.7×	50 1.0×	28 0.9×	52	448
Johannes Borgström Sweden	8	170 0.9×	80 0.6×	66 0.8×	32 0.6×	12 0.4×	31	219
Joe Halpern United States	7	132 0.7×	72 0.6×	128 1.6×	59 1.1×	17 0.5×	9	268
Daniele Gorla Italy	10	205 1.1×	116 0.9×	116 1.5×	59 1.1×	31 1.0×	39	263
Ugo Dal Lago Italy	12	437 2.3×	346 2.7×	70 0.9×	34 0.7×	6 0.2×	76	465
Gary Levin United States	10	166 0.9×	131 1.0×	237 3.0×	53 1.0×	30 0.9×	24	385
Christian Urban Germany	11	422 2.2×	300 2.4×	46 0.6×	39 0.8×	5 0.2×	30	454
Amı́lcar Sernadas Portugal	14	568 2.9×	372 3.0×	169 2.2×	56 1.1×	10 0.3×	73	631

Countries citing papers authored by Rohit Chadha

Since Specialization

Citations

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

Fields of papers citing papers by Rohit Chadha

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Rohit Chadha

This figure shows the co-authorship network connecting the top 25 collaborators of Rohit Chadha. A scholar is included among the top collaborators of Rohit Chadha 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 Rohit Chadha. Rohit Chadha 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:

20 of 20 papers shown

1.

Chadha, Rohit, et al.. (2023). Analyzing Component Composability of Cloud Security Configurations. IEEE Access. 11. 139935–139951. 1 indexed citations

2.

Mathur, Umang, et al.. (2020). Exact quantitative probabilistic model checking through rational search. Formal Methods in System Design. 56(1-3). 90–126.

3.

Chadha, Rohit, et al.. (2020). Strongly bounded termination with applications to security and hardware synthesis. 1–10.

4.

Chadha, Rohit, et al.. (2018). Decidable and expressive classes of probabilistic automata. Journal of Computer and System Sciences. 100. 70–95.

5.

Chadha, Rohit, A. Prasad Sistla, & Mahesh Viswanathan. (2017). Verification of randomized security protocols. 1–12. 1 indexed citations

6.

Chadha, Rohit, A. Prasad Sistla, & Mahesh Viswanathan. (2017). Verification of randomized security protocols. abs 706 1019. 1–12. 2 indexed citations

7.

Mathur, Umang, et al.. (2017). Exact quantitative probabilistic model checking through rational search. 92–99. 3 indexed citations

8.

Chadha, Rohit, et al.. (2012). The Complexity of Quantitative Information Flow in Recursive Programs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 534–545. 1 indexed citations

9.

Chadha, Rohit, A. Prasad Sistla, & Mahesh Viswanathan. (2011). Probabilistic Büchi automata with non-extremal acceptance thresholds. 103–117. 3 indexed citations

10.

Chadha, Rohit, A. Prasad Sistla, & Mahesh Viswanathan. (2011). Power of Randomization in Automata on Infinite Strings. Logical Methods in Computer Science. Volume 7, Issue 3. 1 indexed citations

11.

Chadha, Rohit, A. Prasad Sistla, & Mahesh Viswanathan. (2010). Model Checking Concurrent Programs with Nondeterminism and Randomization. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 4 indexed citations

12.

Chadha, Rohit & Mahesh Viswanathan. (2009). Deciding branching time properties for asynchronous programs. Theoretical Computer Science. 410(42). 4169–4179. 4 indexed citations

13.

Chadha, Rohit, et al.. (2008). On the Expressiveness and Complexity of Randomization in Finite State Monitors. 190. 18–29. 5 indexed citations

14.

Chadha, Rohit, Luı́s Cruz-Filipe, Paulo Mateus, & Amı́lcar Sernadas. (2007). Reasoning about probabilistic sequential programs. Theoretical Computer Science. 379(1-2). 142–165. 18 indexed citations

15.

Chadha, Rohit, et al.. (2006). A Hybrid Intuitionistic Logic: Semantics and Decidability. Journal of Logic and Computation. 16(1). 27–59. 11 indexed citations

16.

Chadha, Rohit, Steve Kremer, & Andre Scedrov. (2006). Formal Analysis of Multiparty Contract Signing. Journal of Automated Reasoning. 36(1-2). 39–83. 17 indexed citations

17.

Chadha, Rohit, John C. Mitchell, Andre Scedrov, & Vitaly Shmatikov. (2005). Contract signing, optimism, and advantage. The Journal of Logic and Algebraic Programming. 64(2). 189–218. 9 indexed citations

18.

Scedrov, Andre & Rohit Chadha. (2003). A formal analysis of exchange of digital signatures. 1 indexed citations

19.

Chadha, Rohit, et al.. (2002). Automated test generation for improved protocol testing. 1. 167–171. 3 indexed citations

20.

Chadha, Rohit, Max Kanovich, & Andre Scedrov. (2001). Inductive methods and contract-signing protocols. 176–185. 40 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