Abstract
Addressing a problem of Fredman and Willard, we implement fusion trees in deterministic linear space using AC 0 instructions only. More precisely, we show that a subset of {0,…,2 w - 1} 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 operation 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 today's computers.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
