Introduction to fast algorithms for time–frequency analysis
If you are interested in discrete linear systems (either time-frequency or time-scale), you could invest in multirate filter banks, that provide tools for computing, optimizing, etc, such as the polyphase matrix or the lifting scheme. A  tutorial paper is 


Multirate digital filters, filter banks, polyphase networks and Applications: A Tutorial by P. P. Vaidyanathan.


An earlier reference is 


Frequency-domain and multirate adaptive filtering by J. Shynk.


However, additional notes could be helpful on you side whether you need:


specificities: amount of memory, real-time constraints, quantization
analysis only or analysis/synthesis
linear or nonlinear time-frequency
discrete or discrete approximation to continuous
fast in number of operations, convergence, or using hardware capabilities (finite-precision, approximate versions, etc.)


If you do consider sliding windows for Fourier analysis, this can be cast into the framework of modulated complex  oversampled filterbanks, for which fast algorithms do exist, see for instance:


Fast Implementation of Oversampled Modulated Filter Banks, 2000, S. Weiss and R.W. Stewart