"Space-Time Trade-Offs for the Shortest Unique Substring Problem."

Arnab Ganguly et al. (2016)

> Home

Details and statistics

DOI: 10.4230/LIPICS.ISAAC.2016.34

access: open

type: Conference or Workshop Paper

metadata version: 2024-02-28

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/isaac/0002HST16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/0002HST16
Arnab Ganguly, Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan:
Space-Time Trade-Offs for the Shortest Unique Substring Problem. ISAAC 2016: 34:1-34:13

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.