SIGN IN
SIGN UP
Optimal suffix selection
Full Text:
Pdf
Buy this Article
Authors:
Gianni Franceschini
University of Pisa, Pisa, Italy
S. Muthukrishnan
Google Inc., New York, NY
Published in:
· Proceeding
STOC '07
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
ACM
New York, NY
, USA
©2007
table of contents
ISBN: 978-1-59593-631-8
doi>
10.1145/1250790.1250840
2007 Article
Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 17
· Citation Count: 0
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'12
Share:
|
Tags:
algorithms
nonnumerical algorithms and problems
order statistics
selection
strings
suffixes
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder