Volker Heun

Affiliations:
  • Ludwig Maximilian University of Munich, Germany


According to our database1, Volker Heun authored at least 27 papers between 1993 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2017
Bioinformatics advances biology and medicine by turning big data troves into knowledge.
Inform. Spektrum, 2017

Bioinformatics Advances Biology and Medicine by Turning Big Data Troves into Knowledge.
Proceedings of the 50 Jahre Universitäts-Informatik in München, 2017

2012
Space Efficient Modifications to Structator - A Fast Index-Based Search Tool for RNA Sequence-Structure Patterns.
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

2011
Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays.
SIAM J. Comput., 2011

2010
Finding Range Minima in the Middle: Approximations and Applications.
Math. Comput. Sci., 2010

2008
Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees.
Inf. Process. Lett., 2008

Range Median of Minima Queries, Super-Cartesian Trees, and Text Indexing.
Proceedings of the 19th International Workshop on Combinatorial Algorithms, 2008

Veranstaltung zum Tagungsmotto: Bioinformatik und Biotechnologie.
Proceedings of the 38. Jahrestagung der Gesellschaft für Informatik, Beherrschbare Systeme, 2008

Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries.
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.
Proceedings of the Combinatorics, 2007

SimShiftDB: Chemical-Shift-Based Homology Modeling.
Proceedings of the Bioinformatics Research and Development, First International Conference, 2007

2006
Optimal String Mining Under Frequency Constraints.
Proceedings of the Knowledge Discovery in Databases: PKDD 2006, 2006

Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE.
Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

2005
Fast Frequent String Mining Using Suffix Arrays.
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.
Discret. Appl. Math., 2003

Efficient Embeddings into Hypercube-like Topologies.
Comput. J., 2003

2002
Efficient Dynamic Embeddings of Binary Trees into Hypercubes.
J. Algorithms, 2002

Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes.
J. Algorithms, 2002

2001
Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes.
J. Parallel Distributed Comput., 2001

2000
Grundlegende Algorithmen - Einführung in den Entwurf und die Analyse effizienter Algorithmen.
Vieweg Lehrbuch, Vieweg, ISBN: 978-3-528-03140-4, 2000

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

1996
Embedding Graphs with Bounded Treewidth into Optimal Hypercubes.
Proceedings of the STACS 96, 1996

Efficient Dynamic Embedding of Arbitrary Binary Trees into Hypercubes.
Proceedings of the Parallel Algorithms for Irregularly Structured Problems, 1996

Effiziente Einbettungen baumartiger Graphen in den Hyperwürfel.
Proceedings of the Ausgezeichnete Informatikdissertationen 1996, 1996

A General Method for Efficient Embeddings of Graphs into Optimal Hypercubes.
Proceedings of the Euro-Par '96 Parallel Processing, 1996

Efficient embeddings of treelike graphs into hypercubes.
Berichte aus der Informatik, Shaker, ISBN: 978-3-8265-1901-7, 1996

1993
A new efficient algorithm for embedding an arbitrary binary tree into its optimal hypercube
Forschungsberichte, TU Munich, 1993


  Loading...