SIGN IN
SIGN UP
The random access hierarchy
Full Text:
PDF
Buy this Article
Author:
Dale Myers
Published in:
· Proceeding
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Pages 355-364
ACM
New York, NY
, USA
©1983
table of contents
ISBN:0-89791-099-0
doi>
10.1145/800061.808766
1983 Article
Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 17
· Downloads (cumulative): 227
· Citation Count: 0
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'13
Share:
|
Tags:
bounded-action devices
complexity measures and classes
files
first-order definability
polylog space
random access
sublinear time
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