Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Rajeev Raman University of Leicester, Leicester, UK
Venkatesh Raman Institute of Mathematical Sciences, Chennai, India
Srinivasa Rao Satti University of Waterloo, Waterloo, Canada
Published in:
Cover Image
 
· Journal
ACM Transactions on Algorithms (TALG) TALG Homepage archive
Volume 3 Issue 4, November 2007
Article No. 43
ACM New York, NY, USA
table of contents doi>10.1145/1290672.1290680
Succinct indexable dictionaries with applications to encoding <i>k</i>-ary trees, prefix sums and multisets Published by ACM 2007 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 16
· Downloads (12 Months): 95
· Downloads (cumulative): 589
· Citation Count: 39


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