Fast Low Memory T-Transform: string complexity in linear time and space with applications to Android app store security.
This thesis presents flott, the Fast Low Memory T-Transform, the currently fastest and most memory efficient linear time and space algorithm available to compute the string complexity measure T-complexity. The flott algorithm uses 64.3% less memory and in our experiments runs asymptotically 20% fast...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | English en |
| Published: |
2012
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1828/3924 |