Volker Heun - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 28 from 28

2017

2012

Space Efficient Modifications to Structator - A Fast Index-Based Search Tool for RNA Sequence-Structure PatternsBenjamin Albrecht, Volker Heun. wea 2012: 27-38 [doi]

2011

Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static ArraysJohannes Fischer, Volker Heun. SICOMP, 40(2):465-492, 2011. [doi]

2010

Finding Range Minima in the Middle: Approximations and ApplicationsJohannes Fischer, Volker Heun. mics, 3(1):17-30, 2010. [doi]

2008

Range Median of Minima Queries, Super-Cartesian Trees, and Text IndexingJohannes Fischer, Volker Heun. iwoca 2008: 239-252

Practical Entropy-Bounded Schemes for O(1)-Range Minimum QueriesJohannes Fischer, Volker Heun, Horst Martin Stühler. dcc 2008: 272-281 [doi]

Veranstaltung zum Tagungsmotto: Bioinformatik und BiotechnologieVolker Heun, Ralf Zimmer. gi 2008: 988-991

Analysis of a modification of Gusfield s recursive algorithm for reconstructing ultrametric treesVolker Heun. ipl, 108(4):222-225, 2008. [doi]

2007

A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix ArrayJohannes Fischer, Volker Heun. escape 2007: 459-470 [doi]

SimShiftDB: Chemical-Shift-Based Homology ModelingSimon W. Ginzinger, Thomas Gräupl, Volker Heun. bird 2007: 357-370 [doi]

2006

Optimal String Mining Under Frequency ConstraintsJohannes Fischer, Volker Heun, Stefan Kramer. pkdd 2006: 139-150 [doi]

Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCEJohannes Fischer, Volker Heun. cpm 2006: 36-48 [doi]

2005

Fast Frequent String Mining Using Suffix ArraysJohannes Fischer, Volker Heun, Stefan Kramer. icdm 2005: 609-612 [doi]

2003

Efficient Embeddings into Hypercube-like TopologiesVolker Heun, Ernst W. Mayr. cj, 46(6):632-644, 2003. [doi]

Approximate protein folding in the HP side chain model on extended cubic latticesVolker Heun. DAM, 127(1):163-177, 2003.

2002

Embedding Graphs with Bounded Treewidth into Their Optimal HypercubesVolker Heun, Ernst W. Mayr. jal, 43(1):17-50, 2002. [doi]

Efficient Dynamic Embeddings of Binary Trees into HypercubesVolker Heun, Ernst W. Mayr. jal, 43(1):51-84, 2002. [doi]

2001

Optimal Dynamic Embeddings of Complete Binary Trees into HypercubesVolker Heun, Ernst W. Mayr. jpdc, 61(8):1110-1125, 2001. [doi]

2000

Grundlegende Algorithmen - Einführung in den Entwurf und die Analyse effizienter AlgorithmenVolker Heun. Vieweg Lehrbuch, Vieweg, 2000.

1999

Approximate Protein Folding in the HP Side Chain Model on Extended Cubic LatticesVolker Heun. esa 1999: 212-223 [doi]

1997

Proving the PCP-TheoremVolker Heun, Wolfgang Merkle, Ulrich Weigand. Dagstuhl 1998: 83-160 [doi]

1996

Sign in or sign up to see more results.

runs on WebDSL