default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDhananjay M. Dhamdhere
Refine list
refinements active!
zoomed in on 19 of 19 records
view refined list in
export refined list as
refine by search term
refine by type
- |
- no options
- temporarily not available
refine by coauthor
- no options
- temporarily not available
refine by orcid
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by access 
- no options
- temporarily not available
2000 – 2009
- 2003
[j17]Uday P. Khedker, Dhananjay M. Dhamdhere, Alan Mycroft
:
Bidirectional data flow analysis for type inferencing. Comput. Lang. Syst. Struct. 29(1-2): 15-44 (2003)- [j16]Dhananjay M. Dhamdhere, K. Gururaja, Prajakta G. Ganu:
A compact execution history for dynamic slicing. Inf. Process. Lett. 85(3): 145-152 (2003) - 2002
- [j15]Dhananjay M. Dhamdhere:
E-path_PRE: partial redundancy elimination made easy. ACM SIGPLAN Notices 37(8): 53-65 (2002) - no results
1990 – 1999
- 1999
- [j14]Uday P. Khedker, Dhananjay M. Dhamdhere:
Bidirectional Data Flow Analysis: Myth and Reality. ACM SIGPLAN Notices 34(6): 47-57 (1999) - 1998
- [j13]Dhananjay M. Dhamdhere, K. V. Sankaranarayanan:
Dynamic Currency Determination in Optimized Programs. ACM Trans. Program. Lang. Syst. 20(6): 1111-1130 (1998) - 1997
- [j12]Dhananjay M. Dhamdhere, Sridhar R. Iyer, E. Kishore Kumar Reddy:
Distributed Termination Detection for Dynamic Systems. Parallel Comput. 22(14): 2025-2045 (1997) - 1995
- [j11]Vikram M. Dhaneshwar, Dhananjay M. Dhamdhere:
Strength reduction of large expressions. J. Program. Lang. 3(2) (1995) - 1994
- [j10]Dhananjay M. Dhamdhere, Sandeep S. Kulkarni:
A Token Based k-Resilient Mutual Exclusion Algorithm for Distributed Systems. Inf. Process. Lett. 50(3): 151-157 (1994) - [j9]Uday P. Khedker, Dhananjay M. Dhamdhere:
A Generalized Theory of Bit Vector Data Flow Analysis. ACM Trans. Program. Lang. Syst. 16(5): 1472-1511 (1994) - 1993
- [j8]Dhananjay M. Dhamdhere, Harish Patil:
An Elimination Algorithm for Bidirectional Data Flow Problems Using Edge Placement. ACM Trans. Program. Lang. Syst. 15(2): 312-336 (1993) - [c2]Dhananjay M. Dhamdhere, Uday P. Khedker:
Complexity of Bidirectional Data Flow Analysis. POPL 1993: 397-408 - 1992
- [c1]Dhananjay M. Dhamdhere, Barry K. Rosen, F. Kenneth Zadeck:
How to Analyze Large Programs Efficiently and Informatively. PLDI 1992: 212-223 - 1991
- [j7]Dhananjay M. Dhamdhere:
Practical Adaptation of the Global Optimization Algorithm of Morel and Renvoise. ACM Trans. Program. Lang. Syst. 13(2): 291-294 (1991) - 1990
- [j6]Dhananjay M. Dhamdhere:
A Usually Linear Algorithm for Register Assignment Using Edge Placement of Load and Store Instructions. Comput. Lang. 15(1): 83-94 (1990) - [j5]Arunachalam Balachandran, Dhananjay M. Dhamdhere, Supratim Biswas:
Efficient Retargetable Code Generation Using Bottom-up Tree Pattern Matching. Comput. Lang. 15(3): 127-140 (1990) - no results
1980 – 1989
- 1988
- [j4]Dhananjay M. Dhamdhere:
Register Assignment Using Code Placement Techniques. Comput. Lang. 13(2): 75-93 (1988) - [j3]Dhananjay M. Dhamdhere:
A fast algorithm for code movement optimisation. ACM SIGPLAN Notices 23(10): 172-180 (1988) - 1983
- [j2]Dhananjay M. Dhamdhere, J. S. Keith:
Characterization of Program Loops in Code Optimization. Comput. Lang. 8(2): 69-76 (1983) - 1980
- [j1]Dhananjay M. Dhamdhere, J. R. Isaac:
A composite algorithm for strength reduction and code movement optimization. Int. J. Parallel Program. 9(3): 243-273 (1980) - no results
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-07-02 19:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
