Adaptive sampling strategies for quickselects

doi:10.1145/1798596.1798606

Adaptive sampling strategies for quickselects

Full Text:

PDF

Buy this Article

Authors:	Conrado Martínez	Universitat Politècnica de Catalunya, Barcelona, Spain
	Daniel Panario	Carleton University, Ottawa, Canada
	Alfredo Viola	Universidad de la República, Casilla de Correo, Uruguay

Published in:

	· Journal
	ACM Transactions on Algorithms (TALG) TALG Homepage archive
	Volume 6 Issue 3, June 2010 Article No. 53 ACM New York, NY, USA table of contents doi>10.1145/1798596.1798606

	2010 Article Research Refereed
Bibliometrics
· Downloads (6 Weeks): 12 · Downloads (12 Months): 62 · Downloads (cumulative): 197 · Citation Count: 1

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: algorithms analytic combinatorics average-case analysis divide-and-conquer find general quickselect sampling selection theory

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder