Fusion trees can be implemented with AC0 instructions only
- 28 February 1999
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 215 (1-2) , 337-344
- https://doi.org/10.1016/s0304-3975(98)00172-8
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Trans-dichotomous algorithms for minimum spanning trees and shortest pathsJournal of Computer and System Sciences, 1994
- Surpassing the information theoretic bound with fusion treesJournal of Computer and System Sciences, 1993
- Organization and maintenance of large ordered indexesActa Informatica, 1972