(c) 2009 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
W.-K. Hon, R. Shah, and J. S. Vitter. “Space-Efficient Framework for Top-k String Retrieval Problems,” in preparation. An extended abstract appears in Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS ’09), Atlanta, GA, October 2009, 713–722. http://dx.doi.org/10.1109/FOCS.2009.19
Items in KU ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
We want to hear from you! Please
share your stories
about how Open Access to this item benefits YOU.
The University of Kansas prohibits discrimination on the basis of race, color, ethnicity, religion, sex, national origin, age, ancestry, disability, status as a veteran, sexual orientation, marital status, parental status, gender identity, gender expression and genetic information in the University’s programs and activities. The following person has been designated to handle inquiries regarding the non-discrimination policies: Director of the Office of Institutional Opportunity and Access, IOA@ku.edu, 1246 W. Campus Road, Room 153A, Lawrence, KS, 66045, (785)864-6414, 711 TTY.