Volker Heun

	2012
24		Benjamin Albrecht, Volker Heun: Space Efficient Modifications to Structator - A Fast Index-Based Search Tool for RNA Sequence-Structure Patterns. SEA 2012: 27-38
	2011
23		Johannes Fischer, Volker Heun: Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays. SIAM J. Comput. 40(2): 465-492 (2011)
	2010
22		Johannes Fischer, Volker Heun: Finding Range Minima in the Middle: Approximations and Applications. Mathematics in Computer Science 3(1): 17-30 (2010)
	2008
21		Johannes Fischer, Volker Heun, Horst Martin Stühler: Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries. DCC 2008: 272-281
20		Volker Heun, Ralf Zimmer: Veranstaltung zum Tagungsmotto: Bioinformatik und Biotechnologie. GI Jahrestagung (2) 2008: 988-991
19		Johannes Fischer, Volker Heun: Range Median of Minima Queries, Super-Cartesian Trees, and Text Indexing. IWOCA 2008: 239-252
18		Volker Heun: Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees. Inf. Process. Lett. 108(4): 222-225 (2008)
	2007
17		Simon W. Ginzinger, Thomas Gräupl, Volker Heun: SimShiftDB: Chemical-Shift-Based Homology Modeling. BIRD 2007: 357-370
16		Johannes Fischer, Volker Heun: A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array. ESCAPE 2007: 459-470
	2006
15		Johannes Fischer, Volker Heun: Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE. CPM 2006: 36-48
14		Johannes Fischer, Volker Heun, Stefan Kramer: Optimal String Mining Under Frequency Constraints. PKDD 2006: 139-150
	2005
13		Johannes Fischer, Volker Heun, Stefan Kramer: Fast Frequent String Mining Using Suffix Arrays. ICDM 2005: 609-612
	2003
12		Volker Heun, Ernst W. Mayr: Efficient Embeddings into Hypercube-like Topologies. Comput. J. 46(6): 632-644 (2003)
11		Volker Heun: Approximate protein folding in the HP side chain model on extended cubic lattices. Discrete Applied Mathematics 127(1): 163-177 (2003)
	2002
10		Volker Heun, Ernst W. Mayr: Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes. J. Algorithms 43(1): 17-50 (2002)
9		Volker Heun, Ernst W. Mayr: Efficient Dynamic Embeddings of Binary Trees into Hypercubes. J. Algorithms 43(1): 51-84 (2002)
	2001
8		Volker Heun, Ernst W. Mayr: Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes. J. Parallel Distrib. Comput. 61(8): 1110-1125 (2001)
	2000
7		Volker Heun: Grundlegende Algorithmen - Einführung in den Entwurf und die Analyse effizienter Algorithmen. Vieweg 2000: I-XII, 1-346
	1999
6		Volker Heun: Approximate Protein Folding in the HP Side Chain Model on Extended Cubic Lattices. ESA 1999: 212-223
	1997
5		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)

Coauthor Index

1	Benjamin Albrecht	[24]
2	Johannes Fischer	[13] [14] [15] [16] [19] [21] [22] [23]
3	Simon W. Ginzinger	[17]
4	Thomas Gräupl	[17]
5	Stefan Kramer	[13] [14]
6	Ernst W. Mayr	[1] [2] [3] [4] [8] [9] [10] [12]
7	Wolfgang Merkle	[5]
8	Horst Martin Stühler	[21]
9	Ulrich Weigand	[5]
10	Ralf Zimmer	[20]

Colors in the list of coauthors

Last update Thu May 31 18:55:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page