Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Heun, Volker"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Space-efficient preprocessing schemes for range minimum queries on static arrays
Johannes Fischer
,
Volker Heun
SIAM Journal on Computing
40
(2), 2011, pp. 465-492
Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees
Volker Heun
Information Processing Letters
108
(4), 2008, pp. 222-225
Theoretical and practical improvements on the RMQ-problem, with applications to LCA and LCE
Johannes Fischer
,
Volker Heun
Lecture Notes in Computer Science
4009
, 2006, pp. 36-48
Efficient embeddings into hypercube-like topologies
Volker Heun
,
Ernst W. Mayr
The Computer Journal
46
(6), 2003, pp. 632-644
Grundlegende Algorithmen - Einführung in den Entwurf und die Analyse effizienter Algorithmen
Volker Heun
Buch, 2003, pp. xiv, 370
Approximate protein folding in the HP side chain model on extended cubic lattices
Volker Heun
Topics in Discrete Mathematics
12
, 2003, pp. 163-177
Generalized clustering of gene expression profiles - A spectral approach
Jens Ernst
,
Volker Heun
,
Ulrich Voll
Proceedings of the International Conference on Bioinformatics, InCoB 2002 (February 6-8 2002, Bangkok, Thailand)
, 2002
Embedding graphs with bounded treewidth into their optimal hypercubes
Volker Heun
,
Ernst W. Mayr
Journal of Algorithms
43
(1), 2002, pp. 17-50
Efficient dynamic embeddings of binary trees into hypercubes
Volker Heun
,
Ernst W. Mayr
Journal of Algorithms
43
(1), 2002, pp. 51-84
Optimal dynamic embeddings of complete binary trees into hypercubes
Volker Heun
,
Ernst W. Mayr
Journal Parallel Distributed Computing
61
(8), 2001, pp. 1110-1125
Grundlegende Algorithmen - Einführung in den Entwurf und die Analyse effizienter Algorithmen
Volker Heun
Buch, 2000, pp. xii, 346
Approximate protein folding in the HP side chain model on extended cubic lattices
Volker Heun
Lecture Notes in Computer Science
1643
, 1999, pp. 212-223
36. Workshop über Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen
Anna Bernasconi
,
Stefan Bischof
,
Thomas Erlebach
,
Tom Friedetzky
,
Volker Heun
,
Ernst W. Mayr
,
Michal Mnuk
,
Martin Raab
,
Angelika Steger
,
Ulrich Voll
Technical Report (TUM-I9826), 1998, October
Proving the PCP-Theorem
Volker Heun
,
Wolfgang Merkle
,
Ulrich Weigand
Lecture Notes in Computer Science
1367
, 1998, pp. 83-160
A new efficient algorithm for embedding an arbitrary binary tree into its optimal hypercube
Volker Heun
,
Ernst W. Mayr
Journal of Algorithms
20
(2), 1996, pp. 375-399
Embedding graphs with bounded treewidth into optimal hypercubes
Volker Heun
,
Ernst W. Mayr
Lecture Notes in Computer Science
1046
, 1996, pp. 157-168
Efficient dynamic embedding of arbitrary binary trees into hypercubes
Volker Heun
,
Ernst W. Mayr
Lecture Notes in Computer Science
1117
, 1996, pp. 287-298
A general method for efficient embeddings of graphs into optimal hypercubes
Volker Heun
,
Ernst W. Mayr
Lecture Notes in Computer Science
1123
, 1996, pp. 222-233
Optimal dynamic edge-disjoint embeddings of complete binary trees into hypercubes
Volker Heun
,
Ernst W. Mayr
Proceedings of the 4th Workshop on Parllel Systems and Algorithms, PASA'96 (Jülich, Germany, April 10-12, 1996)
, 1996, pp. 195-209
Efficient embeddings of treelike graphs into hypercubes
Volker Heun
dissertation, 1996, September
Embedding graphs with bounded treewidth into optimal hypercubes
Volker Heun
,
Ernst W. Mayr
Technical Report (342/22/95 A), 1995, December
A new efficient algorithm for embedding an arbitrary binary tree into its optimal hypercube
Volker Heun
,
Ernst W. Mayr
Technical Report (TUM-I9321), 1993, August
A new efficient algorithm for embedding arbitrary binary trees into their optimal hypercubes
Volker Heun
,
Ernst W. Mayr
Mitteilungen - Gesellschaft für Informatik e.V., Parallel-Algorithmen und Rechnerstrukturen
(11), 1993, pp. 7-11