
Search the dblp DataBase
Hillel Gazit:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Hillel Gazit, Gary L. Miller
An Improved Parallel Algorithm that Computes the BFS Numbering of a Directed Graph. [Citation Graph (1, 0)][DBLP] Inf. Process. Lett., 1988, v:28, n:2, pp:6165 [Journal]
 Hillel Gazit
An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph [Citation Graph (0, 0)][DBLP] FOCS, 1986, pp:492501 [Conf]
 Hillel Gazit
A Deterministic Parallel Algorithm for Planar Graphs Isomorphism [Citation Graph (0, 0)][DBLP] FOCS, 1991, pp:723732 [Conf]
 Hillel Gazit, Gary L. Miller
A Parallel Algorithm for Finding a Separator in Planar Graphs [Citation Graph (0, 0)][DBLP] FOCS, 1987, pp:238248 [Conf]
 Hillel Gazit
Optimal EREW Parallel Algorithms for Connectivity, Ear Decomposition and stNumbering of Planar Graphs. [Citation Graph (0, 0)][DBLP] IPPS, 1991, pp:8491 [Conf]
 Hillel Gazit, Gary L. Miller
Planar Separators and the Euclidean Norm. [Citation Graph (0, 0)][DBLP] SIGAL International Symposium on Algorithms, 1990, pp:338347 [Conf]
 Hillel Gazit, John H. Reif
A Randomized Parallel Algorithm for Planar Graph Isomorphism. [Citation Graph (0, 0)][DBLP] SPAA, 1990, pp:210219 [Conf]
 Hillel Gazit, John H. Reif
A Randomized Parallel Algorithm for Planar Graph Isomorphism. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1998, v:28, n:2, pp:290314 [Journal]
 Hillel Gazit
An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1991, v:20, n:6, pp:10461067 [Journal]
Search in 0.003secs, Finished in 0.003secs
