Volker Heun

Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

2011

Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays.

[BibT_eX]

[DOI]

SIAM J. Comput., 2011

2010

Finding Range Minima in the Middle: Approximations and Applications.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2010

2008

Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Range Median of Minima Queries, Super-Cartesian Trees, and Text Indexing.

[BibT_eX]

Proceedings of the 19th International Workshop on Combinatorial Algorithms, 2008

Veranstaltung zum Tagungsmotto: Bioinformatik und Biotechnologie.

[BibT_eX]

[DOI]

Ralf Zimmer

Proceedings of the 38. Jahrestagung der Gesellschaft für Informatik, Beherrschbare Systeme, 2008

Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries.

[BibT_eX]

[DOI]

Horst Martin Stühler

Proceedings of the 2008 Data Compression Conference (DCC 2008), 2008

2007

A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics, 2007

SimShiftDB: Chemical-Shift-Based Homology Modeling.

[BibT_eX]

[DOI]

Simon W. Ginzinger

Thomas Gräupl

Proceedings of the Bioinformatics Research and Development, First International Conference, 2007

2006

Optimal String Mining Under Frequency Constraints.

[BibT_eX]

[DOI]

Stefan Kramer

Proceedings of the Knowledge Discovery in Databases: PKDD 2006, 2006

Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

2005

Fast Frequent String Mining Using Suffix Arrays.

[BibT_eX]

[DOI]

Stefan Kramer

Proceedings of the 5th IEEE International Conference on Data Mining (ICDM 2005), 2005

2003

Approximate protein folding in the HP side chain model on extended cubic lattices.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Efficient Embeddings into Hypercube-like Topologies.

[BibT_eX]

[DOI]

Comput. J., 2003

2002

Efficient Dynamic Embeddings of Binary Trees into Hypercubes.

[BibT_eX]

[DOI]

J. Algorithms, 2002

Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes.

[BibT_eX]

[DOI]

J. Algorithms, 2002

2001

Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2001

2000

Grundlegende Algorithmen - Einführung in den Entwurf und die Analyse effizienter Algorithmen.

[BibT_eX]

Vieweg Lehrbuch, Vieweg, ISBN: 978-3-528-03140-4, 2000

1997

Proving the PCP-Theorem.

[BibT_eX]

[DOI]

Wolfgang Merkle

Ulrich Weigand

Proceedings of the Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, 1997

1996

A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube.

[BibT_eX]

[DOI]

J. Algorithms, 1996

Embedding Graphs with Bounded Treewidth into Optimal Hypercubes.

[BibT_eX]

[DOI]

Proceedings of the STACS 96, 1996

Efficient Dynamic Embedding of Arbitrary Binary Trees into Hypercubes.

[BibT_eX]

[DOI]

Proceedings of the Parallel Algorithms for Irregularly Structured Problems, 1996

Effiziente Einbettungen baumartiger Graphen in den Hyperwürfel.

[BibT_eX]

[DOI]

Proceedings of the Ausgezeichnete Informatikdissertationen 1996, 1996

A General Method for Efficient Embeddings of Graphs into Optimal Hypercubes.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par '96 Parallel Processing, 1996

Efficient embeddings of treelike graphs into hypercubes.

[BibT_eX]