Volker Heun

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Proving the PCP-Theorem Lectures on Proof Verification and Approximation Algorithms	2018-07-03	Paper
Embedding graphs with bounded treewidth into optimal hypercubes STACS 96	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 SIAM Journal on Computing	2011-07-29	Paper
Finding range minima in the middle: approximations and applications Mathematics in Computer Science	2011-02-19	Paper
Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees Information Processing Letters	2010-06-09	Paper
A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array Combinatorics, Algorithms, Probabilistic and Experimental Methodologies	2009-03-03	Paper
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE Combinatorial Pattern Matching	2007-09-14	Paper
scientific article; zbMATH DE number 2237397 (Why is no real title available?)	2005-12-09	Paper
Efficient Embeddings into Hypercube-like Topologies The Computer Journal	2004-09-06	Paper
Approximate protein folding in the HP side chain model on extended cubic lattices Discrete Applied Mathematics	2003-04-28	Paper
Efficient Dynamic Embeddings of Binary Trees into Hypercubes Journal of Algorithms	2002-09-30	Paper
Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes Journal of Algorithms	2002-09-30	Paper
Optimal dynamic embeddings of complete binary trees into hypercubes Journal of Parallel and Distributed Computing	2002-07-22	Paper
scientific article; zbMATH DE number 1552764 (Why is no real title available?)	2001-01-16	Paper
scientific article; zbMATH DE number 1405793 (Why is no real title available?)	2000-02-23	Paper
A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube Journal of Algorithms	1996-05-06	Paper

Research outcomes over time

This page was built for person: Volker Heun