Analysis of a heuristic for full trie minimization

Full Text: PdfPdf Buy this ArticleBuy this Article
Author: Douglas Comer Purdue Univ., West Lafayette, IN
Published in:
· Journal
ACM Transactions on Database Systems (TODS) TODS Homepage archive
Volume 6 Issue 3, Sept. 1981
Pages 513 - 537
ACM New York, NY, USA
table of contents doi>10.1145/319587.319618
Analysis of a heuristic for full trie minimization Published by ACM 1981 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 17
· Downloads (cumulative): 367
· Citation Count: 5


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