Summary: PREPRINT. Theoretical Computer Science, vol 215, pp 337­344, 1999.
Fusion trees can be implemented with AC 0 instructions
only
(note)
Arne Andersson
Lund University
arne@dna.lth.se
Peter Bro Miltersen \Lambda
BRICS y , University of Aarhus
bromille@daimi.aau.dk
Mikkel Thorup
University of Copenhagen
mthorup@diku.dk
Abstract
Addressing a problem of Fredman and Willard, we implement fusion trees in determin­
istic linear space using AC 0 instructions only. More precisely, we show that a subset of
f0; : : : ; 2 w \Gamma 1g of size n can be maintained using linear space under insertion, deletion,
predecessor, and successor queries, with O(log n= log log n) amortized time per opera­
tion on a RAM with word size w, where the only computational instructions allowed
on the RAM are functions in AC 0 . The AC 0 instructions used are not all available on

Source: Andersson, Arne - Department of Information Technology, Uppsala Universitet

Collections: Computer Technologies and Information Sciences