Simon Gog

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Timo Beller

> Home > Persons > Simon Gog

Publications

2014
[c16]
- view
  authority control:
- export record
  dblp key:
  - conf/wea/GogBMP14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wea/GogBMP14
Simon Gog, Timo Beller, Alistair Moffat, Matthias Petri:
From Theory to Practice: Plug and Play with Succinct Data Structures. SEA 2014: 326-337
2013
[j6]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jda/BellerGOS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jda/BellerGOS13
Timo Beller, Simon Gog, Enno Ohlebusch, Thomas Schnattinger:
Computing the longest common prefix array based on the Burrows-Wheeler transform. J. Discrete Algorithms 18: 22-31 (2013)
[c14]
- view
  authority control:
- export record
  dblp key:
  - conf/spire/BellerZGO13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/spire/BellerZGO13
Timo Beller, Maike Zwerger, Simon Gog, Enno Ohlebusch:
Space-Efficient Construction of the Burrows-Wheeler Transform. SPIRE 2013: 5-16
[i2]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/GogBMP13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/GogBMP13
Simon Gog, Timo Beller, Alistair Moffat, Matthias Petri:
From Theory to Practice: Plug and Play with Succinct Data Structures. CoRR abs/1311.1249 (2013)
2011
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/spire/BellerGOS11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/spire/BellerGOS11
Timo Beller, Simon Gog, Enno Ohlebusch, Thomas Schnattinger:
Computing the Longest Common Prefix Array Based on the Burrows-Wheeler Transform. SPIRE 2011: 197-208

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.