 | 2003 |
|---|
| 18 |       | Uday P. Khedker,
Dhananjay M. Dhamdhere,
Alan Mycroft:
Bidirectional data flow analysis for type inferencing.
Computer Languages, Systems & Structures 29(1-2): 15-44 (2003) |
| 17 | | Dhananjay M. Dhamdhere,
K. Gururaja,
Prajakta G. Ganu:
A compact execution history for dynamic slicing.
Inf. Process. Lett. 85(3): 145-152 (2003) |
| 2002 |
|---|
| 16 | | Dhananjay M. Dhamdhere:
E-path_PRE: partial redundancy elimination made easy.
SIGPLAN Notices 37(8): 53-65 (2002) |
| 1999 |
|---|
| 15 |  | Uday P. Khedker,
Dhananjay M. Dhamdhere:
Bidirectional Data Flow Analysis: Myth and Reality.
SIGPLAN Notices 34(6): 47-57 (1999) |
| 1998 |
|---|
| 14 | | Dhananjay M. Dhamdhere,
K. V. Sankaranarayanan:
Dynamic Currency Determination in Optimized Programs.
ACM Trans. Program. Lang. Syst. 20(6): 1111-1130 (1998) |
| 1997 |
|---|
| 13 | | Dhananjay M. Dhamdhere,
Sridhar R. Iyer,
E. Kishore Kumar Reddy:
Distributed Termination Detection for Dynamic Systems.
Parallel Computing 22(14): 2025-2045 (1997) |
| 1995 |
|---|
| 12 | | Vikram M. Dhaneshwar,
Dhananjay M. Dhamdhere:
Strength reduction of large expressions.
J. Prog. Lang. 3(2): (1995) |
| 1994 |
|---|
| 11 | | 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) |
| 10 | | 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) |
| 1993 |
|---|
| 9 | | Dhananjay M. Dhamdhere,
Uday P. Khedker:
Complexity of Bidirectional Data Flow Analysis.
POPL 1993: 397-408 |
| 8 | | 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) |
| 1992 |
|---|
| 7 | | Dhananjay M. Dhamdhere,
Barry K. Rosen,
F. Kenneth Zadeck:
How to Analyze Large Programs Efficiently and Informatively.
PLDI 1992: 212-223 |
| 1991 |
|---|
| 6 | | 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 |
|---|
| 5 | | 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) |
| 4 | | A. Balachandran,
Dhananjay M. Dhamdhere,
S. Biswas:
Efficient Retargetable Code Generation Using Bottom-up Tree Pattern Matching.
Comput. Lang. 15(3): 127-140 (1990) |
| 1988 |
|---|
| 3 | | Dhananjay M. Dhamdhere:
Register Assignment Using Code Placement Techniques.
Comput. Lang. 13(2): 75-93 (1988) |
| 2 | | Dhananjay M. Dhamdhere:
A fast algorithm for code movement optimisation.
SIGPLAN Notices 23(10): 172-180 (1988) |
| 1983 |
|---|
| 1 | | Dhananjay M. Dhamdhere,
J. S. Keith:
Characterization of Program Loops in Code Optimization.
Comput. Lang. 8(2): 69-76 (1983) |
