"A linear-time algorithm to decide whether a binary word contains an overlap."

A. J. Kfoury (1986)

> Home

Details and statistics

DOI: —

access: unavailable

type: Journal Article

metadata version: 2020-06-18

- no documents available
- export record
  dblp key:
  - journals/eatcs/Kfoury86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eatcs/Kfoury86
A. J. Kfoury:
A linear-time algorithm to decide whether a binary word contains an overlap. Bull. EATCS 30: 74-79 (1986)

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.