Recursive star-tree parallel data structure. Zbl 0770.68044
Berkman, Omer; Vishkin, Uzi |
|
1993
|
Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values. Zbl 0782.68031
Berkman, Omer; Schieber, Baruch; Vishkin, Uzi |
|
1993
|
Finding level-ancestors in trees. Zbl 0806.68027
Berkman, Omer; Vishkin, Uzi |
|
1994
|
The subtree max gap problem with application to parallel string covering. Zbl 1096.68775
Berkman, Omer; Iliopoulos, Costas S.; Park, Kunsoo |
|
1995
|
On parallel integer merging. Zbl 0781.68062
Berkman, Omer; Vishkin, Uzi |
|
1993
|
The subtree max gap problem with application to parallel string covering. Zbl 0876.68081
Ben-Amram, Amir M.; Berkman, Omer; Iliopoulos, Costas S.; Park, Kunsoo |
|
1994
|
Triply-logarithmic parallel upper and lower bounds for minimum and range minima over small domains. Zbl 0919.68072
Berkman, Omer; Matias, Yossi; Ragde, Prabhakar |
|
1998
|
A fast parallel algorithm for finding the convex hull of a sorted point set. Zbl 0854.68039
Berkman, Omer; Schieber, Baruch; Vishkin, Uzi |
|
1996
|
Randomized range-maxima in nearly-constant parallel time. Zbl 0770.68060
Berkman, Omer; Matias, Yossi; Vishkin, Uzi |
|
1992
|
All cycles are edge-magic. Zbl 1066.05124
Berkman, Omer; Parnas, Michal; Roditty, Yehuda |
|
2001
|
Efficient dynamic traitor tracing. Zbl 0954.68067
Berkman, Omer; Parnas, Michal; Sgall, Jiří |
|
2000
|
Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs. Zbl 1504.68280
Berkman, O.; Matias, Y.; Ragde, P. |
|
1993
|
Efficient dynamic traitor tracing. Zbl 0992.68063
Berkman, Omer; Parnas, Michal; Sgall, Jirí |
|
2001
|
Almost fully-parallel parentheses matching. Zbl 0814.68071
Berkman, Omer; Vishkin, Uzi |
|
1995
|
All cycles are edge-magic. Zbl 1066.05124
Berkman, Omer; Parnas, Michal; Roditty, Yehuda |
|
2001
|
Efficient dynamic traitor tracing. Zbl 0992.68063
Berkman, Omer; Parnas, Michal; Sgall, Jirí |
|
2001
|
Efficient dynamic traitor tracing. Zbl 0954.68067
Berkman, Omer; Parnas, Michal; Sgall, Jiří |
|
2000
|
Triply-logarithmic parallel upper and lower bounds for minimum and range minima over small domains. Zbl 0919.68072
Berkman, Omer; Matias, Yossi; Ragde, Prabhakar |
|
1998
|
A fast parallel algorithm for finding the convex hull of a sorted point set. Zbl 0854.68039
Berkman, Omer; Schieber, Baruch; Vishkin, Uzi |
|
1996
|
The subtree max gap problem with application to parallel string covering. Zbl 1096.68775
Berkman, Omer; Iliopoulos, Costas S.; Park, Kunsoo |
|
1995
|
Almost fully-parallel parentheses matching. Zbl 0814.68071
Berkman, Omer; Vishkin, Uzi |
|
1995
|
Finding level-ancestors in trees. Zbl 0806.68027
Berkman, Omer; Vishkin, Uzi |
|
1994
|
The subtree max gap problem with application to parallel string covering. Zbl 0876.68081
Ben-Amram, Amir M.; Berkman, Omer; Iliopoulos, Costas S.; Park, Kunsoo |
|
1994
|
Recursive star-tree parallel data structure. Zbl 0770.68044
Berkman, Omer; Vishkin, Uzi |
|
1993
|
Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values. Zbl 0782.68031
Berkman, Omer; Schieber, Baruch; Vishkin, Uzi |
|
1993
|
On parallel integer merging. Zbl 0781.68062
Berkman, Omer; Vishkin, Uzi |
|
1993
|
Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs. Zbl 1504.68280
Berkman, O.; Matias, Y.; Ragde, P. |
|
1993
|
Randomized range-maxima in nearly-constant parallel time. Zbl 0770.68060
Berkman, Omer; Matias, Yossi; Vishkin, Uzi |
|
1992
|