Found 19 Documents (Results 1–19)
Data structures for computing unique palindromes in static and non-static strings. (English) Zbl 07823161
Internal longest palindrome queries in optimal time. (English) Zbl 07770287
Lin, Chun-Cheng (ed.) et al., WALCOM: algorithms and computation. 17th international conference and workshops, WALCOM 2023, Hsinchu, Taiwan, March 22–24, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13973, 127-138 (2023).
MSC:
68Wxx
Shortest unique palindromic substring queries in semi-dynamic settings. (English) Zbl 07577716
Bazgan, Cristina (ed.) et al., Combinatorial algorithms. 33rd international workshop, IWOCA 2022, Trier, Germany, June 7–9, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13270, 425-438 (2022).
The heaviest induced ancestors problem: better data structures and applications. (English) Zbl 1522.68166
Minimal unique palindromic substrings after single-character substitution. (English) Zbl 07542410
Lecroq, Thierry (ed.) et al., String processing and information retrieval. 28th international symposium, SPIRE 2021, Lille, France, October 4–6, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12944, 33-46 (2021).
MSC:
68W32
Computing longest palindromic substring after single-character or block-wise edits. (English) Zbl 1502.68378
MSC:
68W32
Dynamic and internal longest common substring. (English) Zbl 1494.68314
MSC:
68W32
A linear-space data structure for range-LCP queries in poly-logarithmic time. (English) Zbl 1455.68045
Reviewer: Guillaume Fertin (Nantes)
Range shortest unique substring queries. (English) Zbl 1539.68078
Brisaboa, Nieves R. (ed.) et al., String processing and information retrieval. 26th international symposium, SPIRE 2019, Segovia, Spain, October 7–9, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11811, 258-266 (2019).
Longest common substring made fully dynamic. (English) Zbl 07525443
Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 6, 17 p. (2019).
MSC:
68Wxx
Repetition detection in a dynamic string. (English) Zbl 07525442
Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 5, 18 p. (2019).
MSC:
68Wxx
Filter Results by …
Document Type
- Journal Articles (13)
- Collection Articles (6)
all
top 5
Author
- Mieno, Takuya (6)
- Thankachan, Sharma V. (5)
- Abedin, Paniz (4)
- Charalampopoulos, Panagiotis (4)
- Funakoshi, Mitsuru (4)
- Ganguly, Arnab (4)
- Pissis, Solon P. (4)
- Amir, Amihood (3)
- Radoszewski, Jakub (3)
- Bannai, Hideo (2)
- Hooshmand, Sahar (2)
- Horiyama, Takashi (2)
- Inenaga, Shunsuke (2)
- Mitani, Kazuki (2)
- Nakashima, Yuto (2)
- Seto, Kazuhisa (2)
- Shah, Rahul (2)
- Takeda, Masayuki (2)
- Badkobeh, Golnaz (1)
- Bille, Philip (1)
- Boneh, Itai (1)
- Fujishige, Yuta (1)
- Gørtz, Inge Li (1)
- Hon, Wing-Kai (1)
- Kociumaka, Tomasz (1)
- Kondratovsky, Eitan (1)
- Kosolobov, Dmitry (1)
- Külekci, Muhammed Oğuzhan (1)
- Matsuda, Kotaro (1)
- Nekrich, Yakov (1)
- Pedersen, Max Rishøj (1)
- Rotenberg, Eva (1)
- Rytter, Wojciech (1)
- Sadakane, Kunihiko (1)
- Steiner, Teresa Anna (1)
- Waleń, Tomasz (1)
Serial
Software
- EERTREE (4)
