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:12 - 1 self

Documents Related by Co-Citation

135 Surpassing the information theoretic bound with fusion trees – M L Fredman, D E Willard - 1993
44 Optimal Bounds for the Predecessor Problem and Related Problems – Paul Beame, Faith E. Fich - 2001
45 Marked Ancestor Problems – Stephen Alstrup, Thore Husfeldt, Theis Rauhe - 1998
797 Computational Geometry: Algorithms and Applications – M de Berg, M van Kreveld, M Overmars, O Schwarzkopf - 2000
119 The cell probe complexity of dynamic data structures – Michael L Fredman, Michael E Saks - 1989
141 Trans-dichotomous algorithms for minimum spanning trees and shortest paths – M L Fredman, D E Willard - 1990
181 Design and implementation of an efficient priority queue – P van Emde Boas, R Kaas, E Zijlstra - 1977
20 Two- and Three-Dimensional Point Location in Rectangular Subdivisions – Mark De Berg, Marc Van Kreveld, Jack Snoeyink - 1995
46 A lower bound for finding predecessors in Yao’s cell probe model – Miklós Ajtai - 1988
21 Shmuel Safra, and Avi Wigderson. On Data Structures and Asymmetric Communication Complexity – RS-94-41 Peter Bro Miltersen, Noam Nisan - 1994
19 Lower bounds for predecessor searching in the cell probe model – Pranab Sen, et al. - 2008
268 Triangulating a simple polygon in linear time – B Chazelle - 1991
9 New Lower Bound Techniques For Dynamic Partial Sums and Related Problems – Thore Husfeldt, Theis Rauhe - 2003
12 Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching – Thore Husfeldt, Theis Rauhe, Søren Skyum - 1996
37 Optimal algorithms for list indexing and subset rank – Paul F Dietz - 1989
17 Optimal Biweighted Binary Trees And The Complexity Of Maintaining Partial Sums – Haripriyan Hampapuram, Michael, Michael L. Fredman, Siam J. Comput C - 1998
42 On the complexity of maintaining partial sums – A C Yao - 1985
27 Cell Probe Complexity - a Survey – Peter Bro Miltersen - 1999
37 The complexity of maintaining an array and computing its partial sums – M L Fredman - 1979