An optimal randomized planar convex hull algorithm with good empirical performance

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An optimal randomized planar convex hull algorithm with good empirical performance

Full text

Pdf (552 KB)

Source

ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures table of contents

Santa Barbara, California, United States

Pages: 21 - 26

Year of Publication: 1995

ISBN:0-89791-717-0

Authors

Martin Dyer	University of Leeds, Leeds LS2 9JT, UK
Jonathan Nash	University of Leeds, Leeds LS2 9JT, UK
Peter Dew	University of Leeds, Leeds LS2 9JT, UK

Sponsors

European Theoretical :
IEEE : Institute of Electrical and Electronics Engineers
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 6, Citation Count: 0

Additional Information:

references index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/215399.215407 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	N. Alon and J. Spencer, The Probabzlistic Method, Wiley, Chichester, 1992.
	2	Frank Dehne , Andreas Fabri , Andrew Rau-Chaplin, Scalable parallel geometric algorithms for coarse grained multicomputers, Proceedings of the ninth annual symposium on Computational geometry, p.298-307, May 18-21, 1993, San Diego, California, United States [doi>10.1145/160985.161154]
	3	A. Aggarwal, B. Chazelle, L. Guibas, C. O'Dunlaing and C. Yap, Parallel Computational Geometry, Algorithmica, vol. 3, pp 293-327, 1988.
	4	Richard Cole, Parallel merge sort, SIAM Journal on Computing, v.17 n.4, p.770-785, August 1988 [doi>10.1137/0217049]
	5	J. M. Nash, A Study of the XPRAM Model for Parallel Computing, Ph.D. Thesis, School of Computer Studies, University of Leeds, UK, 1993.
	6	L. G. Valiant, Optimality of a Two-Phase Strategy for Routing in {nterconnectwn Networks, IEEE Transactions on Computers, vol. c32 no. 9, pp 861- 863, 1983.
	7	V. Kumar and A. Gupta, Analyzing $calabdity of Parallel Algorithms and Architectures, Technical Report, University of Minnesota, 1992.
	8	J. M. Nash and P. M. Dew, Scalable Data Sharing on a Message Passing Machine, in Transputer Applications and Systems '94, IOS Press, Amsterdam, pp 718-738, 1994.
	9	L. G. Valiant, General purpose parallel architectures, Handbook of theoretical computer science (vol. A): algorithms and complexity, MIT Press, Cambridge, MA, 1991