SIGN IN
SIGN UP
Anti-presistence: history independent data structures
Full Text:
Pdf
Buy this Article
Authors:
Moni Naor
Dept. of Computer Science and Applied Math, Weizmann Institute
Vanessa Teague
Dept. of Computer Science, Stanford University
Published in:
· Proceeding
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Pages 492 - 501
ACM
New York, NY
, USA
©2001
table of contents
ISBN:1-58113-349-9
doi>
10.1145/380752.380844
2001 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 31
· Downloads (cumulative): 331
· Citation Count: 16
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:
algorithms
algorithms
anti-persistence
data structures
hash table
history independence
human factors
measurement
performance
privacy
privacy
security
security
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