Dov Harel

According to our database, Dov Harel authored at least 6 papers between 1980 and 1999.

Collaborative distances:

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

1999

Dominators in Linear Time.

Stephen Alstrup, Dov Harel, Peter W. Lauridsen, Mikkel Thorup

SIAM J. Comput., 1999

1988

A Graph Compaction Approach to Fault Simulation.

Dov Harel, Balakrishnan Krishnamurthy

Proceedings of the 25th ACM/IEEE Conference on Design Automation, 1988

1987

The Star Graph: An Attractive Alternative to the n-Cube.

Sheldon B. Akers Jr., Balakrishnan Krishnamurthy, Dov Harel

Proceedings of the International Conference on Parallel Processing, 1987

1985

A Linear Time Algorithm for Finding Dominators in Flow Graphs and Related Problems

Dov Harel

Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

1984

Fast Algorithms for Finding Nearest Common Ancestors.

Dov Harel, Robert Endre Tarjan

SIAM J. Comput., 1984

1980

A Linear Time Algorithm for the Lowest Common Ancestors Problem (Extended Abstract)

Dov Harel

Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980