Find all intervals that overlap with a given interval
I believe that interval trees offer a solution to your problem.  Basically, you store your intervals in the interval tree data structure; then, to find all intervals that overlap with $[t_0,t_1]$, you do a query into the interval tree.  This should solve your problem and run faster than $O(n)$ time.