1998 |
9 | | Hillel Gazit,
John H. Reif:
A Randomized Parallel Algorithm for Planar Graph Isomorphism.
J. Algorithms 28(2): 290-314 (1998) |
1991 |
8 | | Hillel Gazit:
A Deterministic Parallel Algorithm for Planar Graphs Isomorphism
FOCS 1991: 723-732 |
7 | | Hillel Gazit:
Optimal EREW Parallel Algorithms for Connectivity, Ear Decomposition and st-Numbering of Planar Graphs.
IPPS 1991: 84-91 |
6 | | Hillel Gazit:
An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph.
SIAM J. Comput. 20(6): 1046-1067 (1991) |
1990 |
5 | | Hillel Gazit,
Gary L. Miller:
Planar Separators and the Euclidean Norm.
SIGAL International Symposium on Algorithms 1990: 338-347 |
4 | EE | Hillel Gazit,
John H. Reif:
A Randomized Parallel Algorithm for Planar Graph Isomorphism.
SPAA 1990: 210-219 |
1988 |
3 | | Hillel Gazit,
Gary L. Miller:
An Improved Parallel Algorithm that Computes the BFS Numbering of a Directed Graph.
Inf. Process. Lett. 28(2): 61-65 (1988) |
1987 |
2 | | Hillel Gazit,
Gary L. Miller:
A Parallel Algorithm for Finding a Separator in Planar Graphs
FOCS 1987: 238-248 |
1986 |
1 | | Hillel Gazit:
An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph
FOCS 1986: 492-501 |