Home > Science > Mathematics > Geometry > Computational
In Proc. 1988 International Conference on Parallel Computing, vol. III, pp. 104-107. Constant-Time Geometry on PRAMs Quentin F. Stout EECS Department, University of Michigan Abstract: Given n points chosen uniformly and independently from the unit square, it is shown that a parallel random access machine (PRAM) with n processors can solve several geometric problems in constant expected time.
www.eecs.umich.edu/~qstout/abs/ICPP88geo.html
Post a Review
Do you have experience with or are you familiar with this website? Please post your comments / review below to share with the rest of the community.
Do you have experience with or are you familiar with this website? Please post your comments / review below to share with the rest of the community.
Please note, all comments are subject to review and can be removed at any time for any reason.
Disclaimer: eiNET is not affiliated in any way with the Constant-Time Geometry on PRAMs (www.eecs.umich.edu/~qstout/abs/ICPP88geo.html) website.
Views and opinions expressed may not be representative of eiNET or its owners but all effort is made to keep the site free of obscenities, illegal or otherwise malicious activity.
Are you the owner of this site? You can manage your listing here.