Finding an o(n2 log n) Algorithm Is Sometimes Hard

Lower bounds for linear degeneracy testing

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing

Lower bounds for linear degeneracy testing

Journal of the ACM (JACM)

Hardness of comparing two run-length encoded strings

Journal of Complexity

Error-tolerant content-based music-retrieval with mathematical morphology

CMMR'10 Proceedings of the 7th international conference on Exploring music contents

Discovering lag intervals for temporal dependencies

Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining