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