The following pages link to Volker Heun (Q216141):
Displayed 17 items.
- Finding range minima in the middle: approximations and applications (Q626956) (← links)
- Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees (Q975453) (← links)
- Approximate protein folding in the HP side chain model on extended cubic lattices (Q1868719) (← links)
- Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays (Q3020013) (← links)
- (Q3104275) (← links)
- Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes (Q3150270) (← links)
- Efficient Dynamic Embeddings of Binary Trees into Hypercubes (Q3150271) (← links)
- A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array (Q3611932) (← links)
- (Q4524979) (← links)
- Proving the PCP-Theorem (Q4571890) (← links)
- Embedding graphs with bounded treewidth into optimal hypercubes (Q4593926) (← links)
- Efficient Embeddings into Hypercube-like Topologies (Q4811512) (← links)
- A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube (Q4876698) (← links)
- (Q4938778) (← links)
- Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE (Q5307491) (← links)
- (Q5711208) (← links)
- Optimal dynamic embeddings of complete binary trees into hypercubes (Q5949497) (← links)