default search action

combined dblp search
author search
venue search
publication search

ask others

Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID

"Searching a bitstream in linear time for the longest substring of any ..."

Benjamin A. Burton (2009)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2018-08-13

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/abs-0910-3503
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-0910-3503
Benjamin A. Burton:
Searching a bitstream in linear time for the longest substring of any given density. CoRR abs/0910.3503 (2009)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.