Searching for authors named "Volker Heun" – sorted by Relevance.
11 documents found, showing 1 through 10.
Next 10 →
-
Approximate Protein Folding in the HP Side Chain Model on Extended Cubic Lattices
- … Model on Extended Cubic Lattices Volker Heun TR-98-029 December 1998 Abstract One of the most…
- Cited by 10 (0 self) – Add To MetaCart
-
V.: Range median of minima queries, super cartesian trees, and text indexing (2007) (manuscript), www.bio.ifi.lmu.de/$\sim$fischer/fischer10range.pdf
- …,⋆ and Volker Heun 2 1 Center for Bioinformatics (ZBIT), University of Tübingen, Sand 14, 72076 Tübingen…
- Cited by 1 (1 self) – Add To MetaCart
-
A new succinct representation of RMQ-information and improvements in the enhanced suffix array
- … ⋆ Johannes Fischer and Volker Heun Inst. für Informatik, Ludwig-Maximilians-Universität München Amalienstr…
- Cited by 13 (9 self) – Add To MetaCart
-
Theoretical and practical improvements on the RMQ-problem, with applications to LCA and LCE
- …○ Springer-Verlag Johannes Fischer and Volker Heun Institut für Informatik der Ludwig…
- Cited by 7 (5 self) – Add To MetaCart
-
Efficient Dynamic Embeddings of Binary Trees into Hypercubes
- … into Hypercubes Volker Heun Ernst W. Mayr TR-98-023 August 1998 Abstract In this paper, a deterministic…
- Cited by 2 (0 self) – Add To MetaCart
-
A General Method for Efficient Embeddings of Graphs into Optimal Hypercubes
- …A General Method for Efficient Embeddings of Graphs into Optimal Hypercubes Volker Heun Ernst W…
- Cited by 2 (1 self) – Add To MetaCart
-
Optimal string mining under frequency constraints
- …Optimal String Mining under Frequency Constraints Johannes Fischer 1 , Volker Heun 1 , and Stefan…
- Cited by 5 (2 self) – Add To MetaCart
-
Fast frequent string mining using suffix arrays
- … Johannes Fischer, Volker Heun and Stefan Kramer TUM-I0512 November 05 T E C H N I S C H E U N I V E R S I…
- Cited by 2 (1 self) – Add To MetaCart
-
Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes
- … into Hypercubes Volker Heun Ernst W. Mayr TR-98-022 August 1998 Abstract The double-rooted complete binary…
- Add To MetaCart
-
Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries
- …Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries Johannes Fischer, Volker Heun…
- Add To MetaCart
Showing 1 through 10.
Next 10 →
