Fusion trees can be implemented with \(AC^0\) instructions only
From MaRDI portal
Publication:1287094
DOI10.1016/S0304-3975(98)00172-8zbMath0915.68121WikidataQ56454625 ScholiaQ56454625MaRDI QIDQ1287094
Mikkel Thorup, Peter Bro Miltersen, Arne Andersson
Publication date: 29 April 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q45: Formal languages and automata
Related Items
Dynamic range majority data structures, A correction to Andersson's fusion tree construction, The saga of minimum spanning trees, Optimal bounds for the predecessor problem and related problems, Finding median in read-only memory on integer input, A fast algorithm for adaptive prefix coding, Approximate pattern matching with \(k\)-mismatches in packed text, Subquadratic algorithms for 3SUM, Minimal indices for predecessor search, Worst-Case Optimal Adaptive Prefix Coding
Cites Work