Searching for "On Finding Lowest Common Ancestors Simplification and Parallelization." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima Over Small Domains
by Omer Berkman, Yossi Matias, and Prabhakar L. Ragde, V. Ramach — 1998
… Science, Tel Aviv Univ., 1987. [34] B. Schieber and U. Vishkin. On finding lowest common ancestors…
Cited by 2 (0 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB