"Time-Space Trade-Offs for the Longest Common Substring Problem."

Tatiana Starikovskaya, Hjalte Wedel Vildhøj (2013)

> Home

Details and statistics

DOI: 10.1007/978-3-642-38905-4_22

access: closed

type: Conference or Workshop Paper

metadata version: 2019-10-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cpm/StarikovskayaV13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cpm/StarikovskayaV13
Tatiana Starikovskaya, Hjalte Wedel Vildhøj:
Time-Space Trade-Offs for the Longest Common Substring Problem. CPM 2013: 223-234

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.