Searching for "An Optimal Randomized Parallel Algorithm for the Single Function Coarsest Partition Problem." – 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.

Θ(log n) and Ω(log^O(1) n) Time Bounds for Parallel Automata Minimisation
by Clive N. Galley — 1997
…] Galley C., and Iliopoulos C., A simple parallel algorithm for the single function coarsest partition…
Add To MetaCart

Showing 1 through 1.

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