Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
29
Voted
QUEUE
2010
57
views
more
QUEUE 2010
»
Keeping Bits Safe: How Hard Can It Be?
15 years 1 months ago
Download
www.lockss.org
David S. H. Rosenthal
Real-time Traffic
QUEUE 2010
|
claim paper
Related Content
»
Free Bits PCPs and NonApproximability Towards Tight Results
»
Free Bits PCPs and NonapproximabilityTowards Tight Results
»
Improving the safety of homeless young people with mobile phones values form and function
»
Attested appendonly memory making adversaries stick to their word
more »
Post Info
More Details (n/a)
Added
30 Jan 2011
Updated
30 Jan 2011
Type
Journal
Year
2010
Where
QUEUE
Authors
David S. H. Rosenthal
Comments
(0)
Researcher Info
QUEUE 2006 Study Group
Computer Vision