"Position Heaps for Cartesian-Tree Matching on Strings and Tries."

Akio Nishimoto et al. (2021)

> Home

Details and statistics

DOI: 10.1007/978-3-030-86692-1_20

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/spire/NishimotoFNI21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/spire/NishimotoFNI21
Akio Nishimoto, Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga:
Position Heaps for Cartesian-Tree Matching on Strings and Tries. SPIRE 2021: 241-254

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.