The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Volker Heun: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Johannes Fischer, Volker Heun
    Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE. [Citation Graph (0, 0)][DBLP]
    CPM, 2006, pp:36-48 [Conf]
  2. Volker Heun, Wolfgang Merkle, Ulrich Weigand
    Proving the PCP-Theorem. [Citation Graph (0, 0)][DBLP]
    Lectures on Proof Verification and Approximation Algorithms, 1997, pp:83-160 [Conf]
  3. Volker Heun
    Approximate Protein Folding in the HP Side Chain Model on Extended Cubic Lattices. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:212-223 [Conf]
  4. Volker Heun, Ernst W. Mayr
    A General Method for Efficient Embeddings of Graphs into Optimal Hypercubes. [Citation Graph (0, 0)][DBLP]
    Euro-Par, Vol. I, 1996, pp:222-233 [Conf]
  5. Johannes Fischer, Volker Heun, Stefan Kramer
    Fast Frequent String Mining Using Suffix Arrays. [Citation Graph (0, 0)][DBLP]
    ICDM, 2005, pp:609-612 [Conf]
  6. Volker Heun, Ernst W. Mayr
    Efficient Dynamic Embedding of Arbitrary Binary Trees into Hypercubes. [Citation Graph (0, 0)][DBLP]
    IRREGULAR, 1996, pp:287-298 [Conf]
  7. Johannes Fischer, Volker Heun, Stefan Kramer
    Optimal String Mining Under Frequency Constraints. [Citation Graph (0, 0)][DBLP]
    PKDD, 2006, pp:139-150 [Conf]
  8. Volker Heun, Ernst W. Mayr
    Embedding Graphs with Bounded Treewidth into Optimal Hypercubes. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:157-168 [Conf]
  9. Simon W. Ginzinger, Thomas Gräupl, Volker Heun
    SimShiftDB: Chemical-Shift-Based Homology Modeling. [Citation Graph (0, 0)][DBLP]
    BIRD, 2007, pp:357-370 [Conf]
  10. Volker Heun, Ernst W. Mayr
    Efficient Embeddings into Hypercube-like Topologies. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2003, v:46, n:6, pp:632-644 [Journal]
  11. Volker Heun
    Approximate protein folding in the HP side chain model on extended cubic lattices. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:127, n:1, pp:163-177 [Journal]
  12. Volker Heun, Ernst W. Mayr
    Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:43, n:1, pp:17-50 [Journal]
  13. Volker Heun, Ernst W. Mayr
    Efficient Dynamic Embeddings of Binary Trees into Hypercubes. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:43, n:1, pp:51-84 [Journal]
  14. Volker Heun, Ernst W. Mayr
    A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:20, n:2, pp:375-399 [Journal]
  15. Volker Heun, Ernst W. Mayr
    Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2001, v:61, n:8, pp:1110-1125 [Journal]
  16. Johannes Fischer, Volker Heun
    A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array. [Citation Graph (0, 0)][DBLP]
    ESCAPE, 2007, pp:459-470 [Conf]

  17. Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries. [Citation Graph (, )][DBLP]


  18. Veranstaltung zum Tagungsmotto: Bioinformatik und Biotechnologie. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002