#### Filter Results:

- Full text PDF available (10)

#### Publication Year

2013

2018

- This year (6)
- Last 5 years (17)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Don S. Batory, Peter Höfner, Dominik Köppl, Bernhard Möller, Andreas Zelend
- Software, Services, and Systems
- 2015

A Structured Document Algebra (SDA) defines modules with variation points and how such modules compose. The basic operations are module addition and replacement. Repeated addition can create nested… (More)

- Dominik Köppl, Kunihiko Sadakane
- 2016 Data Compression Conference (DCC)
- 2016

We show that both the Lempel-Ziv-77 and the Lempel-Ziv-78 factorization of a text of length n on an integer alphabet of size σ can be computed in O(n lg lg σ) time (linear time if we allow… (More)

We present a framework facilitating the implementation and comparison of text compression algorithms. We evaluate its features by a case study on two novel compression algorithms based on the… (More)

- Johannes Fischer, I Tomohiro, Dominik Köppl
- LATIN
- 2016

Given a rewriteable text T of length n on an alphabet of size σ, we propose an online algorithm that computes the sparse suffix array and the sparse longest common prefix array of T in O ( |C| √… (More)

- Johannes Fischer, Dominik Köppl, Florian Kurpicz
- CPM
- 2016

We present parallel algorithms for exact and approximate pattern matching with suffix arrays, using a CREW-PRAM with p processors. Given a static text of length n, we first show how to compute the… (More)

- Hideo Bannai, Shunsuke Inenaga, Dominik Köppl
- CPM
- 2017

Given a string on an integer alphabet, we present an algorithm that computes the set of all distinct squares belonging to this string in time linear to the string length. As an application, we show… (More)

- Pawel Gawrychowski, I Tomohiro, Shunsuke Inenaga, Dominik Köppl, Florin Manea
- Theory of Computing Systems
- 2017

An α-gapped repeat (α ≥ 1) in a word w is a factor uvu of w such that |u v| ≤ α|u|; the two occurrences of u are called arms of this α-gapped repeat. An α-gapped repeat is called maximal if its arms… (More)

- Florian Wenzel, Dominik Köppl, Werner Kießling
- SSTD
- 2013

- Roland Glück, Dominik Köppl, Günther Wirsching
- SEA
- 2013

We propose an algorithm for computing the number of ordered integer partitions with upper bounds. This problem’s task is to compute the number of distributions of z balls into n urns with constrained… (More)

For α ≥ 1, an α-gapped repeat in a word w is a factor uvu of w such that |uv| ≤ α|u|; the two factors u in such a repeat are called arms, while the factor v is called gap. Such a repeat is called… (More)