Keydomet: faster prefix-based key comparison
Abstract
References
Index Terms
- Keydomet: faster prefix-based key comparison
Recommendations
Prefix Reversals on Binary and Ternary Strings
Given a permutation $\pi$, the application of prefix reversal $f^{(i)}$ to $\pi$ reverses the order of the first $i$ elements of $\pi$. The problem of sorting by prefix reversals (also known as pancake flipping), made famous by Gates and Papadimitriou (...
A d-step approach to the maximum number of distinct squares and runs in strings
Fraenkel and Simpson conjectured in 1998 that the number of distinct squares in a string is at most its length. Kolpakov and Kucherov conjectured in 1999 that the number of runs in a string is also at most its length. Since then, both conjectures ...
An incomplex algorithm for fast suffix array construction
The suffix array of a string is a permutation of all starting positions of the string's suffixes that are lexicographically sorted. We present a practical algorithm for suffix array construction that consists of two easy-to-implement components. First ...
Comments
Information & Contributors
Information
Published In
- General Chair:
- Moshik Hershcovitch,
- Program Chairs:
- Ashvin Goel,
- Adam Morrison
Sponsors
In-Cooperation
- USENIX Assoc: USENIX Assoc
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Poster
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 71Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in