SIGN IN
SIGN UP
Efficient bundle sorting
Full Text:
PDF
Get this Article
Authors:
Yossi Matias
Department of Computer Science, Tel-Aviv University, Tel-Aviv 69978 Israel
Eran Segal
Department of Computer Science, Stanford University, Stanford, CA and Tel-Aviv University
Jeffrey Scott Vitter
Department of Computer Science, Duke University, Durham, NC and I.N.R.I.A. in Sophia Antipolis, France
Published in:
· Proceeding
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Pages 839-848
Society for Industrial and Applied Mathematics
Philadelphia, PA
, USA
©2000
table of contents
ISBN:0-89871-453-2
2000 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 1
· Downloads (cumulative): 276
· Citation Count: 9
Tools and Resources
Buy this Article
Recommend the ACM DL
to your organization
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Author Tags
algorithms
design
discrete mathematics
experimentation
measurement
performance
randomness, geometry and discrete structures
sorting and searching
theory
verification
Contact Us
|
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
**
Advertisements
Powered by
Did you know the ACM DL App is now available?
Did you know your Organization can subscribe to the ACM Digital Library?
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder