A Parallel Algorithm for Finding a Separator in Planar Graphs - Hillel Gazit; Gary L. Miller (FOCS, 1987)

An Improved Parallel Algorithm that Computes the BFS Numbering of a Directed Graph. - Hillel Gazit; Gary L. Miller (Inf. Process. Lett., 1988)

Planar Separators and the Euclidean Norm. - Hillel Gazit; Gary L. Miller (SIGAL International Symposium on Algorithms, 1990)

A Deterministic Parallel Algorithm for Planar Graphs Isomorphism - Hillel Gazit (FOCS, 1991)

Optimal EREW Parallel Algorithms for Connectivity, Ear Decomposition and st-Numbering of Planar Graphs. - Hillel Gazit (IPPS, 1991)

An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph. - Hillel Gazit (SIAM J. Comput., 1991)

A Randomized Parallel Algorithm for Planar Graph Isomorphism. - Hillel Gazit; John H. Reif (J. Algorithms, 1998)