Omer Berkman

Recursive star-tree parallel data-structure

This paper introduces a novel parallel data structure called the recursive star-tree (denoted “

Highly parallelizable problems

{}^ *

Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values

-tree”). For its definition a generalization of the

Finding level-ancestors in trees

*

On Parallel Integer Merging

functional is used (where for a function

Efficient Dynamic Traitor Tracing

f * f(n) = \min \{ {i|f^{(i)} (n) \leqslant 1} \}

Some triply-logarithmic parallel algorithms

and

Almost fully-parallel parentheses matching

f^{(i)}

A FAST PARALLEL ALGORITHM FOR FINDING THE CONVEX HULL OF A SORTED POINT SET

is the ith iterate of f). Recursive

Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains

{}^ *