A persistent union-find data structure

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Sylvain Conchon Université Paris-Sud, Orsay, France
Jean-Christophe Filliâtre CNRS, Orsay, France
Published in:
· Proceeding
ML '07 Proceedings of the 2007 workshop on Workshop on ML
Pages 37-46
ACM New York, NY, USA ©2007
table of contents ISBN: 978-1-59593-676-9 doi>10.1145/1292535.1292541
A persistent union-find data structure Published by ACM 2007 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 6
· Downloads (12 Months): 53
· Downloads (cumulative): 421
· Citation Count: 8


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