Shay Halperin

According to our database, Shay Halperin authored at least 6 papers between 1994 and 2003.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2003

Handling Long Targets and Errors in Sequencing by Hybridization.

Eran Halperin, Shay Halperin, Tzvika Hartman, Ron Shamir

J. Comput. Biol., 2003

2001

Optimal Randomized EREW PRAM Algorithms for Finding Spanning Forests.

Shay Halperin, Uri Zwick

J. Algorithms, 2001

2000

All-Pairs Almost Shortest Paths.

Dorit Dor, Shay Halperin, Uri Zwick

SIAM J. Comput., 2000

1996

An Optimal Randomised Logarithmic Time Connectivity Algorithm for the EREW PRAM.

Shay Halperin, Uri Zwick

J. Comput. Syst. Sci., 1996

Optimal randomized EREW PRAM Algorithms for Finding Spanning Forests and for other Basic Graph Connectivity Problems.

Shay Halperin, Uri Zwick

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

1994

An Optimal Randomized Logarithmic Time Connectivity algorithm for the EREW PRAM (Extended Abstract).

Shay Halperin, Uri Zwick

Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994