Search the dblp DataBase

Publications of Author

1. Dorit Dor, Shay Halperin, Uri Zwick
   All Pairs Almost Shortest Paths. [Citation Graph (0, 0)][DBLP]
   FOCS, 1996, pp:452-461 [Conf]
   
2. Eran Halperin, Shay Halperin, Tzvika Hartman, Ron Shamir
   Handling long targets and errors in sequencing by hybridization. [Citation Graph (0, 0)][DBLP]
   RECOMB, 2002, pp:176-185 [Conf]
   
3. Shay Halperin, Uri Zwick
   Optimal randomized EREW PRAM Algorithms for Finding Spanning Forests and for other Basic Graph Connectivity Problems. [Citation Graph (0, 0)][DBLP]
   SODA, 1996, pp:438-447 [Conf]
   
4. Shay Halperin, Uri Zwick
   An Optimal Randomized Logarithmic Time Connectivity algorithm for the EREW PRAM (Extended Abstract). [Citation Graph (0, 0)][DBLP]
   SPAA, 1994, pp:1-10 [Conf]
   
5. Dorit Dor, Shay Halperin, Uri Zwick
   All Pairs Almost Shortest Paths [Citation Graph (0, 0)][DBLP]
   Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:40, pp:- [Journal]
   
6. Shay Halperin, Uri Zwick
   Optimal Randomized EREW PRAM Algorithms for Finding Spanning Forests. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2001, v:39, n:1, pp:1-46 [Journal]
   
7. Eran Halperin, Shay Halperin, Tzvika Hartman, Ron Shamir
   Handling Long Targets and Errors in Sequencing by Hybridization. [Citation Graph (0, 0)][DBLP]
   Journal of Computational Biology, 2003, v:10, n:3/4, pp:483-497 [Journal]
   
8. Shay Halperin, Uri Zwick
   An Optimal Randomised Logarithmic Time Connectivity Algorithm for the EREW PRAM. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1996, v:53, n:3, pp:395-416 [Journal]
   
9. Dorit Dor, Shay Halperin, Uri Zwick
   All-Pairs Almost Shortest Paths. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2000, v:29, n:5, pp:1740-1759 [Journal]