Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Fusion tree

In computer science, a fusion tree is a type of tree data structure that implements an associative array on w-bit integers. When operating on a… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Energy-efficient and reliable transmission of sensory information is a key problem in wireless sensor networks. To save more… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2010
2010
Data fusion is an attractive technology because it allows various trade-offs related to performance metrics, e.g., energy… Expand
Is this relevant?
2009
2009
In mobile agent based data fusion, the order of nodes visited along the route by mobile agent has a significant impact on the… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
Is this relevant?
2005
2005
This paper establishes a distributed data fusion method for ad hoc networks, enabling each device or agent to operate… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 6
  • figure 5
Is this relevant?
2003
2003
Addressing a question of Fredman and Willard from STOC'90, we show that fusion trees cannot be implemented using the AC<sup>0… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
This article illustrates several examples of computer science problems whose performance can be improved with the use of either… Expand
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Abstract This paper introduces a new sublogarithmic data structure for searching, the fusion tree. These trees lead to improved… Expand
Is this relevant?
1992
1992
a related loglogN improvement of Chazelle’s O(N logd-lN / log log N) space data structure [C86a], that performs the reporting… Expand
Is this relevant?
Highly Cited
1990
Highly Cited
1990
The fusion tree method is extended to develop a linear-time algorithm for the minimum spanning tree problem and an O(m+n log n… Expand
Is this relevant?
Highly Cited
1990
Highly Cited
1990
The fusion tree method is extended to develop a linear-time algorithm for the minimum spanning tree problem and an O(m+n log n… Expand
Is this relevant?