"Shortest Unique Palindromic Substring Queries in Optimal Time."

Yuto Nakashima et al. (2017)

> Home

Details and statistics

DOI: 10.1007/978-3-319-78825-8_32

access: closed

type: Conference or Workshop Paper

metadata version: 2024-06-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/iwoca/NakashimaIMIBT17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iwoca/NakashimaIMIBT17
Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Shortest Unique Palindromic Substring Queries in Optimal Time. IWOCA 2017: 397-408

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.