default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVolker Heun
Refine list
refinements active!
zoomed in on 29 of 29 records
view refined list in
export refined list as
refine by search term
refine by type
- |
- no options
- temporarily not available
refine by coauthor
- no options
- temporarily not available
refine by orcid
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by access 
- no options
- temporarily not available
2010 – 2019
- 2017
[j10]Julien Gagneur
, Caroline C. Friedel, Volker Heun, Ralf Zimmer, Burkhard Rost:
Bioinformatics advances biology and medicine by turning big data troves into knowledge. Inform. Spektrum 40(2): 153-160 (2017)- [p2]Julien Gagneur, Caroline C. Friedel, Volker Heun, Ralf Zimmer, Burkhard Rost:
Bioinformatics Advances Biology and Medicine by Turning Big Data Troves into Knowledge. 50 Jahre Universitäts-Informatik in München 2017: 33-45 - 2012
- [c14]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
- [j9]Johannes Fischer, Volker Heun:
Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays. SIAM J. Comput. 40(2): 465-492 (2011) - 2010
- [j8]Johannes Fischer, Volker Heun:
Finding Range Minima in the Middle: Approximations and Applications. Math. Comput. Sci. 3(1): 17-30 (2010) - no results
2000 – 2009
- 2008
- [j7]Volker Heun:
Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees. Inf. Process. Lett. 108(4): 222-225 (2008) - [c13]Johannes Fischer, Volker Heun, Horst Martin Stühler:
Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries. DCC 2008: 272-281 - [c12]Volker Heun, Ralf Zimmer:
Veranstaltung zum Tagungsmotto: Bioinformatik und Biotechnologie. GI Jahrestagung (2) 2008: 988-991 - [c11]Johannes Fischer, Volker Heun:
Range Median of Minima Queries, Super-Cartesian Trees, and Text Indexing. IWOCA 2008: 239-252 - 2007
- [c10]Simon W. Ginzinger, Thomas Gräupl, Volker Heun:
SimShiftDB: Chemical-Shift-Based Homology Modeling. BIRD 2007: 357-370 - [c9]Johannes Fischer, Volker Heun:
A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array. ESCAPE 2007: 459-470 - 2006
- [c8]Johannes Fischer, Volker Heun:
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE. CPM 2006: 36-48 - [c7]Johannes Fischer, Volker Heun, Stefan Kramer:
Optimal String Mining Under Frequency Constraints. PKDD 2006: 139-150 - 2005
- [c6]Johannes Fischer, Volker Heun, Stefan Kramer:
Fast Frequent String Mining Using Suffix Arrays. ICDM 2005: 609-612 - 2003
- [j6]Volker Heun, Ernst W. Mayr:
Efficient Embeddings into Hypercube-like Topologies. Comput. J. 46(6): 632-644 (2003) - [j5]Volker Heun:
Approximate protein folding in the HP side chain model on extended cubic lattices. Discret. Appl. Math. 127(1): 163-177 (2003) - 2002
- [j4]Volker Heun, Ernst W. Mayr:
Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes. J. Algorithms 43(1): 17-50 (2002) - [j3]Volker Heun, Ernst W. Mayr:
Efficient Dynamic Embeddings of Binary Trees into Hypercubes. J. Algorithms 43(1): 51-84 (2002) - 2001
- [j2]Volker Heun, Ernst W. Mayr:
Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes. J. Parallel Distributed Comput. 61(8): 1110-1125 (2001) - 2000
- [b2]Volker Heun:
Grundlegende Algorithmen - Einführung in den Entwurf und die Analyse effizienter Algorithmen. Vieweg Lehrbuch, Vieweg 2000, ISBN 978-3-528-03140-4, pp. I-XII, 1-346 - no results
1990 – 1999
- 1999
- [c5]Volker Heun:
Approximate Protein Folding in the HP Side Chain Model on Extended Cubic Lattices. ESA 1999: 212-223 - 1997
- [c4]Volker Heun, Wolfgang Merkle, Ulrich Weigand:
Proving the PCP-Theorem. Lectures on Proof Verification and Approximation Algorithms 1997: 83-160 - 1996
- [b1]Volker Heun:
Efficient embeddings of treelike graphs into hypercubes. Berichte aus der Informatik, Shaker 1996, ISBN 978-3-8265-1901-7, pp. I-VIII, 1-202 - [j1]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) - [c3]Volker Heun, Ernst W. Mayr:
A General Method for Efficient Embeddings of Graphs into Optimal Hypercubes. Euro-Par, Vol. I 1996: 222-233 - [c2]Volker Heun, Ernst W. Mayr:
Efficient Dynamic Embedding of Arbitrary Binary Trees into Hypercubes. IRREGULAR 1996: 287-298 - [c1]Volker Heun, Ernst W. Mayr:
Embedding Graphs with Bounded Treewidth into Optimal Hypercubes. STACS 1996: 157-168 - [p1]Volker Heun:
Effiziente Einbettungen baumartiger Graphen in den Hyperwürfel. Ausgezeichnete Informatikdissertationen 1996: 29-45 - 1993
- [i1]Volker Heun, Ernst W. Mayr:
A new efficient algorithm for embedding an arbitrary binary tree into its optimal hypercube. Forschungsberichte, TU Munich TUM I 9321: 1-20 (1993) - no results
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-07-02 19:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
