A time complexity lower bound for randomized implementations of some shared objects

Full Text: PdfPdf Buy this ArticleBuy this Article
Author: Prasad Jayanti Department of Computer Science, Dartmouth College, Hanover, NH
Published in:
Cover Image
 
· Proceeding
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Pages 201 - 210
ACM New York, NY, USA ©1998
table of contents ISBN:0-89791-977-7 doi>10.1145/277697.277735
A time complexity lower bound for randomized implementations of some shared objects Published by ACM 1998 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 12
· Downloads (cumulative): 234
· Citation Count: 14


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder