SIGN IN
SIGN UP
A linear probing sort and its analysis(Preliminary Draft)
Full Text:
PDF
Buy this Article
Authors:
Gaston H. Gonnet
J. Ian Munro
Published in:
· Proceeding
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Pages 90-95
ACM
New York, NY
, USA
©1981
table of contents
doi>
10.1145/800076.802461
1981 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 11
· Downloads (cumulative): 304
· Citation Count: 3
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC '14
Share:
|
Tags:
algorithms
distribution functions
probabilistic computation
sorting and searching
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 Guide to Computing Literature
All Tags
Export Formats
Save to Binder