A highly-efficient wait-free universal construction

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Panagiota Fatourou FORTH ICS, Heraklion, Greece
Nikolaos D. Kallimanis Department of Compuer Science, University of Ioannina, Ioannina, Greece
Published in:
Cover Image
 
· Proceeding
SPAA '11 Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures
Pages 325-334
ACM New York, NY, USA ©2011
table of contents ISBN: 978-1-4503-0743-7 doi>10.1145/1989493.1989549
A highly-efficient wait-free universal construction Published by ACM 2011 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 9
· Downloads (12 Months): 78
· Downloads (cumulative): 234
· Citation Count: 6


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