Triply-Logarithmic Parallel Upper and Lo
β
Omer Berkman; Yossi Matias; Prabhakar Ragde
π
Article
π
1998
π
Elsevier Science
π
English
β 193 KB
We consider the problem of computing the minimum of n values, and several w well-known generalizations prefix minima, range minima, and all nearest smaller Ε½ . x w x values ANSV for input elements drawn from the integer domain 1 ΠΈΠΈΠΈ s , where s G n. In this article we give simple and efficient algo