A correction to Andersson's fusion tree construction

Authors:
Eljko Vrba;Pål Halvorsen;Carsten Griwodz
Affiliations:
-;-;-
Venue:
Theoretical Computer Science
Year:
2014

Citing 3
Cited 0

Surpassing the information theoretic bound with fusion trees

Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Fusion trees can be implemented with AC0 instructions only

Theoretical Computer Science
On AC0 implementations of fusion trees and atomic heaps

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	5.23

Visualization

Abstract

We revisit the fusion tree [1] data structure as presented by Andersson et al. [2]. We show that Andersson@?s ranking algorithm has a subtle flaw and we present a revised algorithm.