A correction to Andersson's fusion tree construction

DOI10.1016/J.TCS.2013.09.028zbMath1371.68058OpenAlexW2029712959MaRDI QIDQ391775

Carsten Griwodz, Željko Vrba, Pål Halvorsen

Publication date: 13 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.09.028

zbMATH Keywords

data structureinteger searchingsublogarithmic searchingtransdichotomous model

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05)

Cites Work

• Fusion trees can be implemented with \(AC^0\) instructions only
• Surpassing the information theoretic bound with fusion trees
• Unnamed Item

This page was built for publication: A correction to Andersson's fusion tree construction