Hillel Gazit

According to our database, Hillel Gazit authored at least 7 papers between 1987 and 1998.

Collaborative distances:

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

1998

A Randomized Parallel Algorithm for Planar Graph Isomorphism.

Hillel Gazit, John H. Reif

J. Algorithms, 1998

1991

An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph.

Hillel Gazit

SIAM J. Comput., 1991

Optimal EREW Parallel Algorithms for Connectivity, Ear Decomposition and st-Numbering of Planar Graphs.

Hillel Gazit

Proceedings of the Fifth International Parallel Processing Symposium, Proceedings, Anaheim, California, USA, April 30, 1991

A Deterministic Parallel Algorithm for Planar Graphs Isomorphism

Hillel Gazit

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990

Planar Separators and the Euclidean Norm.

Hillel Gazit, Gary L. Miller

Proceedings of the Algorithms, 1990

1988

An Improved Parallel Algorithm that Computes the BFS Numbering of a Directed Graph.

Hillel Gazit, Gary L. Miller

Inf. Process. Lett., 1988

1987

A Parallel Algorithm for Finding a Separator in Planar Graphs

Hillel Gazit, Gary L. Miller

Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987