Miller; Stout (2-dimensional Convex Hull)
Revision as of 10:36, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(logn)$ time using $O(n)$ processors == Space Complexity == $O(n)$ total? words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == EREW PRAM, possibly others (see paper) == Year == 1988 == Reference == https://cse.buffalo.edu/faculty/miller/Papers/IEEETC88a.pdf")
Time Complexity
$O(logn)$ time using $O(n)$ processors
Space Complexity
$O(n)$ total? words
()
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
EREW PRAM, possibly others (see paper)
Year
1988