| 2008 |
|---|
| 19 | EE | Johannes Fischer,
Volker Heun,
Horst Martin Stühler:
Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries.
DCC 2008: 272-281 |
| 18 | | Volker Heun,
Ralf Zimmer:
Veranstaltung zum Tagungsmotto: Bioinformatik und Biotechnologie.
GI Jahrestagung (2) 2008: 988-991 |
| 17 | EE | Volker Heun:
Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees.
Inf. Process. Lett. 108(4): 222-225 (2008) |
| 2007 |
|---|
| 16 | EE | Simon W. Ginzinger,
Thomas Gräupl,
Volker Heun:
SimShiftDB: Chemical-Shift-Based Homology Modeling.
BIRD 2007: 357-370 |
| 15 | EE | Johannes Fischer,
Volker Heun:
A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array.
ESCAPE 2007: 459-470 |
| 2006 |
|---|
| 14 | EE | Johannes Fischer,
Volker Heun:
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE.
CPM 2006: 36-48 |
| 13 | EE | Johannes Fischer,
Volker Heun,
Stefan Kramer:
Optimal String Mining Under Frequency Constraints.
PKDD 2006: 139-150 |
| 2005 |
|---|
| 12 | EE | Johannes Fischer,
Volker Heun,
Stefan Kramer:
Fast Frequent String Mining Using Suffix Arrays.
ICDM 2005: 609-612 |
| 2003 |
|---|
| 11 | EE | Volker Heun,
Ernst W. Mayr:
Efficient Embeddings into Hypercube-like Topologies.
Comput. J. 46(6): 632-644 (2003) |
| 10 | | Volker Heun:
Approximate protein folding in the HP side chain model on extended cubic lattices.
Discrete Applied Mathematics 127(1): 163-177 (2003) |
| 2002 |
|---|
| 9 | EE | Volker Heun,
Ernst W. Mayr:
Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes.
J. Algorithms 43(1): 17-50 (2002) |
| 8 | EE | Volker Heun,
Ernst W. Mayr:
Efficient Dynamic Embeddings of Binary Trees into Hypercubes.
J. Algorithms 43(1): 51-84 (2002) |
| 2001 |
|---|
| 7 | EE | Volker Heun,
Ernst W. Mayr:
Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes.
J. Parallel Distrib. Comput. 61(8): 1110-1125 (2001) |
| 1999 |
|---|
| 6 | EE | Volker Heun:
Approximate Protein Folding in the HP Side Chain Model on Extended Cubic Lattices.
ESA 1999: 212-223 |
| 1997 |
|---|
| 5 | EE | Volker Heun,
Wolfgang Merkle,
Ulrich Weigand:
Proving the PCP-Theorem.
Lectures on Proof Verification and Approximation Algorithms 1997: 83-160 |
| 1996 |
|---|
| 4 | | Volker Heun,
Ernst W. Mayr:
A General Method for Efficient Embeddings of Graphs into Optimal Hypercubes.
Euro-Par, Vol. I 1996: 222-233 |
| 3 | | Volker Heun,
Ernst W. Mayr:
Efficient Dynamic Embedding of Arbitrary Binary Trees into Hypercubes.
IRREGULAR 1996: 287-298 |
| 2 | | Volker Heun,
Ernst W. Mayr:
Embedding Graphs with Bounded Treewidth into Optimal Hypercubes.
STACS 1996: 157-168 |
| 1 | | Volker Heun,
Ernst W. Mayr:
A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube.
J. Algorithms 20(2): 375-399 (1996) |
