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

Active Bibliography

6 Regular Trace Event Structures – P. S. Thiagarajan, P. S. Thiagarajan - 1996
Arne Andersson – Arne Andersson, Torben Hagerup, Stefan Nilsson
1 On superlinear lower bounds in complexity theory – Kenneth W. Regan - 1995
Randomized Signature Sort: Implementation & Performance Analysis – Tamana Pathak, Dr. Deepak Garg
4 Fast Algorithms for Shortest Paths and Sorting – Rajeev Raman - 1996
6 Lower Bounds for Dynamic Algebraic Problems – Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen - 1998
41 Improved Parallel Integer Sorting without Concurrent Writing – Susanne Albers, Torben Hagerup - 1992
85 Sorting in Linear Time? – Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman - 1995
190 Succinct indexable dictionaries with applications to encoding k-ary trees and multisets – Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
3 Improved Data Structures for Predecessor Queries in Integer Sets – Rajeev Raman - 1996
1 Lower Bound Techniques for Data Structures – Mihai Patrascu - 2008
1 Linear-Time Ranking of Permutations – Milan Straka
34 Logarithmic lower bounds in the cell-probe model – Erik, D. Demaine
7 Lower bounds for static dictionaries on RAMs with bit operations but no multiplication – Peter Bro Miltersen - 1996
Making Deterministic Signatures Quickly – Milan Ru ˇ Zi Ć
50 Marked Ancestor Problems – Stephen Alstrup, Thore Husfeldt, Theis Rauhe - 1998
28 Cell probe complexity - a survey – Peter Bro Miltersen
9 Counting Inversions, Offline Orthogonal Range Counting, and Related Problems – Timothy M. Chan, Mihai Patrascu
3 On sorting strings in external memory (extended abstract – Lars Arge, Paolo Ferragina, Roberto Grossi, Jeffrey Scott Vitter - 1997