Sciweavers

ISAAC
2009
Springer
114views Algorithms» more  ISAAC 2009»
14 years 6 months ago
Good Programming in Transactional Memory
Abstract. In a multicore transactional memory (TM) system, concurrent execution threads interact and interfere with each other through shared memory. The less interference a progra...
Raphael Eidenbenz, Roger Wattenhofer
25
Voted
ISAAC
2009
Springer
103views Algorithms» more  ISAAC 2009»
14 years 6 months ago
An Improved Approximation Algorithm for the Traveling Tournament Problem
Daisuke Yamaguchi, Shinji Imahori, Ryuhei Miyashir...
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
14 years 6 months ago
Online Sorted Range Reporting
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...
Gerth Stølting Brodal, Rolf Fagerberg, Mark...
ISAAC
2009
Springer
98views Algorithms» more  ISAAC 2009»
14 years 6 months ago
Complexity of Approximating the Vertex Centroid of a Polyhedron
Khaled M. Elbassioni, Hans Raj Tiwary
ISAAC
2009
Springer
147views Algorithms» more  ISAAC 2009»
14 years 6 months ago
Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
Sylvain Guillemot, Jesper Jansson, Wing-Kin Sung
ISAAC
2009
Springer
93views Algorithms» more  ISAAC 2009»
14 years 6 months ago
Computing Multidimensional Persistence
Abstract. The theory of multidimensional persistence captures the topology of a multifiltration – a multiparameter family of increasing spaces. Multifiltrations arise naturally...
Gunnar Carlsson, Gurjeet Singh, Afra Zomorodian
ISAAC
2009
Springer
145views Algorithms» more  ISAAC 2009»
14 years 6 months ago
On the Advice Complexity of Online Problems
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...
ISAAC
2009
Springer
78views Algorithms» more  ISAAC 2009»
14 years 6 months ago
Reconstructing Polygons from Scanner Data
A range-finding scanner can collect information about the shape of an (unknown) polygonal room in which it is placed. Suppose that a set of scanners returns not only a set of poin...
Therese C. Biedl, Stephane Durocher, Jack Snoeyink
ISAAC
2009
Springer
82views Algorithms» more  ISAAC 2009»
14 years 6 months ago
Folding a Better Checkerboard
Abstract. Folding an n × n checkerboard pattern from a square of paper that is white on one side and black on the other has been thought for several years to require a paper squar...
Erik D. Demaine, Martin L. Demaine, Goran Konjevod...