Volker Heun - RankMe

29 papers A* 1A 2B 3C 1Journal 11Unranked 7

Year	Rank	Type	Title / Venue / Authors
2017	—	`ch.`	Bioinformatics Advances Biology and Medicine by Turning Big Data Troves into Knowledge. 50 Jahre Universitäts-Informatik in München Julien Gagneur, Caroline C. Friedel, Volker Heun, Ralf Zimmer, Burkhard Rost
2017	J	`jnl`	Bioinformatics advances biology and medicine by turning big data troves into knowledge. Inform. Spektrum Julien Gagneur, Caroline C. Friedel, Volker Heun, Ralf Zimmer, Burkhard Rost
2012	B	`conf`	Space Efficient Modifications to Structator - A Fast Index-Based Search Tool for RNA Sequence-Structure Patterns. SEA Benjamin Albrecht, Volker Heun
2011	J	`jnl`	Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays. SIAM J. Comput. Johannes Fischer, Volker Heun
2010	J	`jnl`	Finding Range Minima in the Middle: Approximations and Applications. Math. Comput. Sci. Johannes Fischer, Volker Heun
2008	J	`jnl`	Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees. Inf. Process. Lett. Volker Heun
2008	B	`conf`	Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries. DCC Johannes Fischer, Volker Heun, Horst Martin Stühler
2008	C	`conf`	Range Median of Minima Queries, Super-Cartesian Trees, and Text Indexing. IWOCA Johannes Fischer, Volker Heun
2008	—	`conf`	Veranstaltung zum Tagungsmotto: Bioinformatik und Biotechnologie. GI Jahrestagung (2) Volker Heun, Ralf Zimmer
2007	—	`conf`	A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array. ESCAPE Johannes Fischer, Volker Heun
2007	—	`conf`	SimShiftDB: Chemical-Shift-Based Homology Modeling. BIRD Simon W. Ginzinger, Thomas Gräupl, Volker Heun
2006	—	`conf`	Optimal String Mining Under Frequency Constraints. PKDD Johannes Fischer, Volker Heun, Stefan Kramer
2006	B	`conf`	Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE. CPM Johannes Fischer, Volker Heun
2005	A*	`conf`	Fast Frequent String Mining Using Suffix Arrays. ICDM Johannes Fischer, Volker Heun, Stefan Kramer
2003	J	`jnl`	Approximate protein folding in the HP side chain model on extended cubic lattices. Discret. Appl. Math. Volker Heun
2003	J	`jnl`	Efficient Embeddings into Hypercube-like Topologies. Comput. J. Volker Heun, Ernst W. Mayr
2002	J	`jnl`	Efficient Dynamic Embeddings of Binary Trees into Hypercubes. J. Algorithms Volker Heun, Ernst W. Mayr
2002	J	`jnl`	Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes. J. Algorithms Volker Heun, Ernst W. Mayr
2001	J	`jnl`	Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes. J. Parallel Distributed Comput. Volker Heun, Ernst W. Mayr
2000	—	`book`	Grundlegende Algorithmen - Einführung in den Entwurf und die Analyse effizienter Algorithmen. Volker Heun
1999	A	`conf`	Approximate Protein Folding in the HP Side Chain Model on Extended Cubic Lattices. ESA Volker Heun
1997	—	`conf`	Proving the PCP-Theorem. Lectures on Proof Verification and Approximation Algorithms Volker Heun, Wolfgang Merkle, Ulrich Weigand
1996	—	`conf`	A General Method for Efficient Embeddings of Graphs into Optimal Hypercubes. Euro-Par, Vol. I Volker Heun, Ernst W. Mayr
1996	J	`jnl`	A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube. J. Algorithms Volker Heun, Ernst W. Mayr
1996	—	`conf`	Efficient Dynamic Embedding of Arbitrary Binary Trees into Hypercubes. IRREGULAR Volker Heun, Ernst W. Mayr
1996	—	`book`	Efficient embeddings of treelike graphs into hypercubes. Volker Heun
1996	—	`ch.`	Effiziente Einbettungen baumartiger Graphen in den Hyperwürfel. Ausgezeichnete Informatikdissertationen Volker Heun
1996	A	`conf`	Embedding Graphs with Bounded Treewidth into Optimal Hypercubes. STACS Volker Heun, Ernst W. Mayr
1993	J	`jnl`	A new efficient algorithm for embedding an arbitrary binary tree into its optimal hypercube Forschungsberichte, TU Munich Volker Heun, Ernst W. Mayr