I/O Efficient Algorithms for Serial and Parallel Suffix Tree Construction
Serial and Parallel Methods for I/O Efficient Suffix Tree Construction
Solving Optimization Problems with Diseconomies of Scale via Decoupling
ACM Trans. Database Syst.
2014 IEEE 55th Annual Symposium on Foundations of Computer Science
Amol Ghoting
Maxim Sviridenko
A Unified Rounding Algorithm For Unrelated Machines Scheduling Problems