Volker Heun

Available identifiers

Publication	Date of Publication	Type
Proving the PCP-Theorem	2018-07-03	Paper
Embedding graphs with bounded treewidth into optimal hypercubes	2017-11-16	Paper
Range median of minima queries, super-Cartesian trees, and text indexing	2011-12-19	Paper
Space-efficient preprocessing schemes for range minimum queries on static arrays	2011-07-29	Paper
Finding range minima in the middle: approximations and applications	2011-02-19	Paper
Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees	2010-06-09	Paper
A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array	2009-03-03	Paper
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE	2007-09-14	Paper
https://portal.mardi4nfdi.de/entity/Q5711208	2005-12-09	Paper
Efficient Embeddings into Hypercube-like Topologies	2004-09-06	Paper
Approximate protein folding in the HP side chain model on extended cubic lattices	2003-04-28	Paper
Efficient Dynamic Embeddings of Binary Trees into Hypercubes	2002-09-30	Paper
Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes	2002-09-30	Paper
Optimal dynamic embeddings of complete binary trees into hypercubes	2002-07-22	Paper
https://portal.mardi4nfdi.de/entity/Q4524979	2001-01-16	Paper
https://portal.mardi4nfdi.de/entity/Q4938778	2000-02-23	Paper
A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube	1996-05-06	Paper

This page was built for person: Volker Heun