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 |
BibTeX
@ARTICLE{Andersson99fusiontrees,
author = {Arne Andersson and Peter Bro Miltersen and Mikkel Thorup and Arne Andersson and Peter Bro Miltersen and Mikkel Thorup},
title = {Fusion trees can be implemented with AC0 instructions only. Theoret},
journal = {Comput. Sci},
year = {1999}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent publications in the BRICS Report Series. Copies may be obtained by contacting: BRICS
Citations
| 144 | The buffer tree: A new technique for optimal I/O algorithms - Arge - 1995 |
| 135 | Surpassing the information theoretic bound with fusion trees - Fredman, Willard - 1993 |
| 37 | Optimal algorithms for list indexing and subset rank - Dietz - 1989 |
| 31 | Decision trees and random access machines - Paul, Simon - 1980 |
| 9 | Organization and maintenance of large ordered indexes. Acta informatica - Bayer, McCreight - 1972 |
| 4 | Arge. The I/O-Complexity of Ordered BinaryDecision Diagram Manipulation - Lars - 1996 |
| 4 | RS-96-25 Devdatt Dubhashi and Desh Ranjan. Balls and Bins: A Study in Negative Dependence - Jensen, Skou - 1996 |
| 2 | Hash functions for priority queues, Information and Computation 63:217–225 - Ajtai, Fredman, et al. - 1984 |
| 2 | BDD Algortihms and Cache Misses - Klarlund, Rauhe - 1996 |
| 1 | The Buffer Tree: ANewTechnique for Optimal I/O Algorithms - Arge - 1996 |
