Self-archived: 19 August 2011
This page hosts my self-archived (and free) version of the following paper:
Searching a bitstream in linear time for the longest substring of any given density
Algorithmica 61:3 (2011), pp. 555–579.
Click here to download the paper.
The content of the self-archived version is essentially the same as for the published version, and references have been brought up-to-date where appropriate.
The copyright holder is Springer, and the original publication is available at www.springerlink.com.