"Efficient Counting of Square Substrings in a Tree."

Tomasz Kociumaka et al. (2012)

> Home

Details and statistics

DOI: 10.1007/978-3-642-35261-4_24

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/isaac/KociumakaPRRW12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/KociumakaPRRW12
Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient Counting of Square Substrings in a Tree. ISAAC 2012: 207-216

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.