SIGN IN
SIGN UP
Lower Bounds for Selection in
X
+
Y
and Other Multisets
Full Text:
PDF
Buy this Article
Authors:
Donald B. Johnson
Computer Science Department, The Pennsylvania State University, University Park, PA
Samuel D. Kashdan
Computer Science Department, The Pennsylvania State University, University Park, PA
Published in:
· Journal
Journal of the ACM (JACM)
JACM Homepage
archive
Volume 25 Issue 4, Oct. 1978
Pages 556-570
ACM
New York, NY
, USA
table of contents
doi>
10.1145/322092.322097
1978 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 35
· Downloads (cumulative): 515
· Citation Count: 2
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
complexity measures and classes
general
measurement
performance
theory
verification
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 Guide to Computing Literature
All Tags
Export Formats
Save to Binder