SIGN IN
SIGN UP
Self-organizing search lists using probabilistic back-pointers
Full Text:
PDF
Buy this Article
Authors:
J. H. Hester
Univ. of California, Irvine
D. H. Hirschberg
Univ. of California, Irvine
Published in:
· Magazine
Communications of the ACM
CACM Homepage
archive
Volume 30 Issue 12, Dec. 1987
Pages 1074-1079
ACM
New York, NY
, USA
table of contents
doi>
10.1145/33447.33453
1987 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 5
· Downloads (cumulative): 235
· Citation Count: 0
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
lists, stacks, and queues
probabilistic algorithms
sorting and searching
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