Dhananjay M. Dhamdhere

According to our database, Dhananjay M. Dhamdhere authored at least 19 papers between 1980 and 2003.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2003

A compact execution history for dynamic slicing.

Dhananjay M. Dhamdhere, K. Gururaja, Prajakta G. Ganu

Inf. Process. Lett., 2003

Bidirectional data flow analysis for type inferencing.

Uday P. Khedker, Dhananjay M. Dhamdhere, Alan Mycroft

Comput. Lang. Syst. Struct., 2003

2002

E-path_PRE: partial redundancy elimination made easy.

Dhananjay M. Dhamdhere

ACM SIGPLAN Notices, 2002

1999

Bidirectional Data Flow Analysis: Myth and Reality.

Uday P. Khedker, Dhananjay M. Dhamdhere

ACM SIGPLAN Notices, 1999

1998

Dynamic Currency Determination in Optimized Programs.

Dhananjay M. Dhamdhere, K. V. Sankaranarayanan

ACM Trans. Program. Lang. Syst., 1998

1997

Distributed Termination Detection for Dynamic Systems.

Dhananjay M. Dhamdhere, Sridhar R. Iyer, E. Kishore Kumar Reddy

Parallel Comput., 1997

1995

Strength reduction of large expressions.

Vikram M. Dhaneshwar, Dhananjay M. Dhamdhere

J. Program. Lang., 1995

1994

A Generalized Theory of Bit Vector Data Flow Analysis.

Uday P. Khedker, Dhananjay M. Dhamdhere

ACM Trans. Program. Lang. Syst., 1994

A Token Based k-Resilient Mutual Exclusion Algorithm for Distributed Systems.

Dhananjay M. Dhamdhere, Sandeep S. Kulkarni

Inf. Process. Lett., 1994

1993

An Elimination Algorithm for Bidirectional Data Flow Problems Using Edge Placement.

Dhananjay M. Dhamdhere, Harish Patil

ACM Trans. Program. Lang. Syst., 1993

Complexity of Bidirectional Data Flow Analysis.

Dhananjay M. Dhamdhere, Uday P. Khedker

Proceedings of the Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1993

1992

How to Analyze Large Programs Efficiently and Informatively.

Dhananjay M. Dhamdhere, Barry K. Rosen, F. Kenneth Zadeck

Proceedings of the ACM SIGPLAN'92 Conference on Programming Language Design and Implementation (PLDI), 1992

1991

Practical Adaptation of the Global Optimization Algorithm of Morel and Renvoise.

Dhananjay M. Dhamdhere

ACM Trans. Program. Lang. Syst., 1991

1990

A Usually Linear Algorithm for Register Assignment Using Edge Placement of Load and Store Instructions.

Dhananjay M. Dhamdhere

Comput. Lang., 1990

Efficient Retargetable Code Generation Using Bottom-up Tree Pattern Matching.

Arunachalam Balachandran, Dhananjay M. Dhamdhere, Supratim Biswas

Comput. Lang., 1990

1988

A fast algorithm for code movement optimisation.

Dhananjay M. Dhamdhere

ACM SIGPLAN Notices, 1988

Register Assignment Using Code Placement Techniques.

Dhananjay M. Dhamdhere

Comput. Lang., 1988

1983

Characterization of Program Loops in Code Optimization.

Dhananjay M. Dhamdhere, J. S. Keith

Comput. Lang., 1983

1980

A composite algorithm for strength reduction and code movement optimization.

Dhananjay M. Dhamdhere, J. R. Isaac

Int. J. Parallel Program., 1980