Dhananjay M. Dhamdhere

640 total citations
23 papers, 440 citations indexed

About

Dhananjay M. Dhamdhere is a scholar working on Hardware and Architecture, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Dhananjay M. Dhamdhere has authored 23 papers receiving a total of 440 indexed citations (citations by other indexed papers that have themselves been cited), including 17 papers in Hardware and Architecture, 11 papers in Artificial Intelligence and 9 papers in Computer Networks and Communications. Recurrent topics in Dhananjay M. Dhamdhere's work include Parallel Computing and Optimization Techniques (17 papers), Distributed systems and fault tolerance (8 papers) and Logic, programming, and type systems (8 papers). Dhananjay M. Dhamdhere is often cited by papers focused on Parallel Computing and Optimization Techniques (17 papers), Distributed systems and fault tolerance (8 papers) and Logic, programming, and type systems (8 papers). Dhananjay M. Dhamdhere collaborates with scholars based in India, United Kingdom and United States. Dhananjay M. Dhamdhere's co-authors include Uday P. Khedker, F. Kenneth Zadeck, Barry K. Rosen, Harish Patil, Athula Balachandran, Sandeep S. Kulkarni, Sridhar Iyer and Alan Mycroft and has published in prestigious journals such as ACM SIGPLAN Notices, ACM Transactions on Programming Languages and Systems and Parallel Computing.

In The Last Decade

Dhananjay M. Dhamdhere

23 papers receiving 395 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Dhananjay M. Dhamdhere India 13 325 247 162 159 113 23 440
Benjamin Goldberg United States 14 300 0.9× 373 1.5× 178 1.1× 103 0.6× 234 2.1× 40 531
Mahadevan Ganapathi United States 11 371 1.1× 288 1.2× 128 0.8× 156 1.0× 89 0.8× 25 525
Oliver Rüthing Germany 8 418 1.3× 318 1.3× 210 1.3× 175 1.1× 143 1.3× 17 562
Steven Tjiang United States 5 287 0.9× 137 0.6× 123 0.8× 72 0.5× 58 0.5× 6 354
Massimiliano Poletto United States 5 296 0.9× 200 0.8× 150 0.9× 69 0.4× 51 0.5× 6 386
Limor Fix United States 9 216 0.7× 121 0.5× 176 1.1× 106 0.7× 184 1.6× 20 424
Cliff Click United States 9 424 1.3× 367 1.5× 254 1.6× 130 0.8× 85 0.8× 12 584
Motohiro Kawahito Japan 11 513 1.6× 389 1.6× 259 1.6× 143 0.9× 85 0.8× 26 639
Steven M. German United States 11 185 0.6× 239 1.0× 82 0.5× 154 1.0× 382 3.4× 25 510
Toshio Suganuma Japan 13 506 1.6× 340 1.4× 281 1.7× 130 0.8× 60 0.5× 23 611

Countries citing papers authored by Dhananjay M. Dhamdhere

Since Specialization
Citations

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

Fields of papers citing papers by Dhananjay M. Dhamdhere

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Dhananjay M. Dhamdhere

This figure shows the co-authorship network connecting the top 25 collaborators of Dhananjay M. Dhamdhere. A scholar is included among the top collaborators of Dhananjay M. Dhamdhere 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 Dhananjay M. Dhamdhere. Dhananjay M. Dhamdhere 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
1.
Dhamdhere, Dhananjay M., et al.. (2003). A compact execution history for dynamic slicing. Information Processing Letters. 85(3). 145–152. 9 indexed citations
2.
Dhamdhere, Dhananjay M.. (2002). E-path_PRE. ACM SIGPLAN Notices. 37(8). 53–65. 6 indexed citations
3.
Khedker, Uday P. & Dhananjay M. Dhamdhere. (1999). Bidirectional data flow analysis. ACM SIGPLAN Notices. 34(6). 47–57. 9 indexed citations
4.
Dhamdhere, Dhananjay M., et al.. (1998). Dynamic currency determination in optimized programs. ACM Transactions on Programming Languages and Systems. 20(6). 1111–1130. 8 indexed citations
5.
Dhamdhere, Dhananjay M., et al.. (1997). Distributed termination detection for dynamic systems. Parallel Computing. 22(14). 2025–2045. 9 indexed citations
6.
Khedker, Uday P. & Dhananjay M. Dhamdhere. (1994). A generalized theory of bit vector data flow analysis. ACM Transactions on Programming Languages and Systems. 16(5). 1472–1511. 36 indexed citations
7.
Dhamdhere, Dhananjay M. & Sandeep S. Kulkarni. (1994). A token based k-resilient mutual exclusion algorithm for distributed systems. Information Processing Letters. 50(3). 151–157. 12 indexed citations
8.
Dhamdhere, Dhananjay M. & Harish Patil. (1993). An elimination algorithm for bidirectional data flow problems using edge placement. ACM Transactions on Programming Languages and Systems. 15(2). 312–336. 25 indexed citations
9.
Dhamdhere, Dhananjay M. & Uday P. Khedker. (1993). Complexity of bi-directional data flow analysis. 397–408. 13 indexed citations
10.
Dhamdhere, Dhananjay M. & Uday P. Khedker. (1993). Complexity of Bidirectional Data Flow Analysis.. 397–408. 10 indexed citations
11.
Dhamdhere, Dhananjay M., Barry K. Rosen, & F. Kenneth Zadeck. (1992). How to analyze large programs efficiently and informatively. 212–223. 57 indexed citations
12.
Dhamdhere, Dhananjay M., Barry K. Rosen, & F. Kenneth Zadeck. (1992). How to analyze large programs efficiently and informatively. ACM SIGPLAN Notices. 27(7). 212–223. 7 indexed citations
13.
Dhamdhere, Dhananjay M.. (1991). Practical adaption of the global optimization algorithm of Morel and Renvoise. ACM Transactions on Programming Languages and Systems. 13(2). 291–294. 65 indexed citations
14.
Dhamdhere, Dhananjay M.. (1990). A usually linear algorithm for register assignment using edge placement of load and store instructions. Computer Languages. 15(2). 83–94. 11 indexed citations
15.
Dhamdhere, Dhananjay M.. (1989). A new algorithm for composite hoisting and strength reduction optimisation. International Journal of Computer Mathematics. 27(1). 1–14. 13 indexed citations
16.
Dhamdhere, Dhananjay M.. (1988). A fast algorithm for code movement optimisation. ACM SIGPLAN Notices. 23(10). 172–180. 34 indexed citations
17.
Dhamdhere, Dhananjay M.. (1988). Register assignment using code placement techniques. Computer Languages. 13(2). 75–93. 18 indexed citations
18.
Dhamdhere, Dhananjay M., et al.. (1983). Characterization of program loops in code optimization. Computer Languages. 8(2). 69–76. 9 indexed citations
19.
Dhamdhere, Dhananjay M., et al.. (1982). A composite hoisting-strength reduction transformation for global program optimization part I. International Journal of Computer Mathematics. 11(1). 21–41. 33 indexed citations
20.
Dhamdhere, Dhananjay M., et al.. (1980). A composite algorithm for strength reduction and code movement optimization. International Journal of Parallel Programming. 9(3). 243–273. 13 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

Rankless by CCL
2026