Results 1 
5 of
5
A Simpler Implementation and Analysis of Chazelle’s Soft Heaps
 In Proc. of the 19th ACMSIAM Symposium on Discrete Algorithms
, 2009
"... Chazelle (JACM 47(6), 2000) devised an approximate meldable priority queue data structure, called Soft Heaps, and used it to obtain the fastest known deterministic comparisonbased algorithm for computing minimum spanning trees, as well as some new algorithms for selection and approximate sorting pr ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
in O(log 1 ε) amortized time. Chazelle’s soft heaps are derived from the binomial heaps data structure in which each priority queue is composed of a collection of binomial trees. We describe a simpler and more direct implementation of soft heaps in which each priority queue is composed of a collection
Implementation of Hereditary Convex Structures
"... This article describes the implementation of a tool to animate algorithms operating in 3dimensional space. Good representatives for such algorithms are those introduced by B. Chazelle and W. Mulzer: Computing Hereditary Convex Structures. This tool may be used to animate any algorithm operating in ..."
Abstract
 Add to MetaCart
This article describes the implementation of a tool to animate algorithms operating in 3dimensional space. Good representatives for such algorithms are those introduced by B. Chazelle and W. Mulzer: Computing Hereditary Convex Structures. This tool may be used to animate any algorithm operating
Rank and select revisited and extended
 Workshop on SpaceConscious Algorithms, University of
, 2006
"... The deep connection between the BurrowsWheeler transform (BWT) and the socalled rank and select data structures for symbol sequences is the basis of most successful approaches to compressed text indexing. Rank of a symbol at a given position equals the number of times the symbol appears in the corr ..."
Abstract

Cited by 50 (24 self)
 Add to MetaCart
in the corresponding prefix of the sequence. Select is the inverse, retrieving the positions of the symbol occurrences. It has been shown that improvements to rank/select algorithms, in combination with the BWT, turn into improved compressed text indexes. This paper is devoted to alternative implementations
Linear Time Triangulation of Simple Polygons
, 2009
"... From the early days of computational geometry, practitioners have looked for faster ways to triangulate a simple polygon. Several nearlinear time algorithms have been devised and implemented. However, the true linear time algorithms of Chazelle and Amato et al. are considered impractical for actual ..."
Abstract
 Add to MetaCart
From the early days of computational geometry, practitioners have looked for faster ways to triangulate a simple polygon. Several nearlinear time algorithms have been devised and implemented. However, the true linear time algorithms of Chazelle and Amato et al. are considered impractical
Local Monotonicity Reconstruction
"... We investigate the problem of monotonicity reconstruction, as defined by Ailon, Chazelle, Comandur and Liu (2004) in a localized setting. We have oracle access to a nonnegative realvalued function f defined on the domain [n] d = {1,..., n} d (where d is viewed as a constant). We would like to closel ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
We investigate the problem of monotonicity reconstruction, as defined by Ailon, Chazelle, Comandur and Liu (2004) in a localized setting. We have oracle access to a nonnegative realvalued function f defined on the domain [n] d = {1,..., n} d (where d is viewed as a constant). We would like