SIGN IN
SIGN UP
Storing a Sparse Table with
0
(1) Worst Case Access Time
Full Text:
PDF
Buy this Article
Authors:
Michael L. Fredman
Univ. of California, San Diego, La Jolla
János Komlós
Endre Szemerédi
Published in:
· Journal
Journal of the ACM (JACM)
JACM Homepage
archive
Volume 31 Issue 3, July 1984
Pages 538-544
ACM
New York, NY
, USA
table of contents
doi>
10.1145/828.1884
1984 Article
Bibliometrics
· Downloads (6 Weeks): 12
· Downloads (12 Months): 109
· Downloads (cumulative): 1,986
· Citation Count: 209
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
measurement
performance
sorting and searching
tables
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