"Computing Smallest and Largest Repetition Factorizations in ..."

Hiroe Inoue et al. (2016)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2024-06-24

- view
  - electronic edition @ stringology.org (open access)
- export record
  dblp key:
  - conf/stringology/InoueMNIBT16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stringology/InoueMNIBT16
Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Smallest and Largest Repetition Factorizations in O(n log n) Time. Stringology 2016: 135-145

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.