A Linear-Time Algorithm to Decide Whether A Binary Word Contains An Overlap - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

A. J. Kfoury. A Linear-Time Algorithm to Decide Whether A Binary Word Contains An Overlap. ITA, 22(2):135-145, 1988.

@article{Kfoury88,
  title = {A Linear-Time Algorithm to Decide Whether A Binary Word Contains An Overlap},
  author = {A. J. Kfoury},
  year = {1988},
  researchr = {https://researchr.org/publication/Kfoury88},
  cites = {0},
  citedby = {0},
  journal = {ITA},
  volume = {22},
  number = {2},
  pages = {135-145},
}

runs on WebDSL