Fusion trees can be implemented with AC0 instructions only. Theoret (1999)

by Arne Andersson , Peter Bro Miltersen , Mikkel Thorup , Arne Andersson , Peter Bro Miltersen , Mikkel Thorup
Venue:Comput. Sci
Citations:15 - 1 self

Documents Related by Co-Citation

145 Surpassing the information theoretic bound with fusion trees – M L Fredman, D E Willard - 1993
55 Optimal Bounds for the Predecessor Problem and Related Problems – Paul Beame, Faith E. Fich - 2001
988 Computational geometry : algorithms and applications – M de Berg, O Cheong, M van Kreveld, M Overmars - 2008
542 The input/output complexity of sorting and related problems – Alok Aggarwal, S Vitter, Jeffrey - 1988
8668 Introduction to Algorithms – T H Cormen, C E Leiserson, R L Rivest, C Stein - 2001
8734 Elements of Information Theory – T M Cover, J A Thomas - 1991
201 Design and implementation of an efficient priority queue, Math. Systems Theory 10 – P Van Emde Boas, R Kaas, E Zijlstra - 1977
6294 A mathematical theory of communication – C E Shannon - 1948
969 A Method for the Construction of Minimum Redundancy Codes – D Huffman - 1952