Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,287,467 papers from all fields of science
Search
Sign In
Create Free Account
Top tree
Known as:
Top Trees
A top tree is a data structure based on a binary tree for unrooted dynamic trees that is used mainly for various path-related operations. It allows…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
Binary tree
Data structure
Directed acyclic graph
Introduction to Algorithms
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Storing Set Families More Compactly with Top ZDDs
Kotaro Matsuda
,
Shuhei Denzumi
,
K. Sadakane
The Sea
2020
Corpus ID: 215548818
Zero-suppressed Binary Decision Diagrams (ZDDs) are data structures for representing set families in a compressed form. With ZDDs…
Expand
2016
2016
Deep Partitioned Shadow Volumes Using Stackless and Hybrid Traversals
F. Mora
,
J. Gerhards
,
L. Aveneau
,
D. Ghazanfarpour
Eurographics Symposium on Rendering
2016
Corpus ID: 52232912
Computing accurate hard shadows is a difficult problem in interactive rendering. Previous methods rely either on Shadow Maps or…
Expand
2016
2016
Heap Construction - 50 Years Later
S. Edelkamp
,
Amr Elmasry
,
J. Katajainen
Computer/law journal
2016
Corpus ID: 29919317
We study the problem of constructing a binary heap in an array using only a small amount of additional space. Let N denote the…
Expand
2016
2016
A Method of Tree Compression with Top Trees and Direct Query Evaluation
Nishimura Suguru
,
Hashimoto Kenji
,
Seki Hiroyuki
2016
Corpus ID: 58568488
2014
2014
Low-overhead authentication method for reprogramming protocol based on rateless codes in wireless sensor networks
Lina Yang
,
Shining Li
,
Yu Zhang
,
Gang Liu
International Wireless Communications and Mobile…
2014
Corpus ID: 11772971
Over-the-air reprogramming is a key service in wireless sensor networks. The service can disseminate a new code image to every…
Expand
2009
2009
Using Top Trees For Easy Programming of Tree Algorithms
Michal Vajbar
Databases, Texts, Specifications, Objects
2009
Corpus ID: 15766182
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of…
Expand
2009
2009
An O(log(n)) Fully Dynamic Algorithm for Maximum matching in a tree
Manoj Gupta
,
Ankit Sharma
arXiv.org
2009
Corpus ID: 16819367
In this paper, we have developed a fully-dynamic algorithm for maintaining cardinality of maximum-matching in a tree using the…
Expand
2008
2008
Top trees volume determination of conical, pyramidal, oval and sphere shape at the parks of nature
S. Matic-Kekic
2008
Corpus ID: 123926353
There are procedures which do not disturb the environment and contain least number of measuring and standard operations, as…
Expand
2008
2008
Forest Stand Volume of Sitka Spruce Plantations in Britain: Can Existing Laser Scanning Methods Based on the Conventional One Provide Better Results, a Comparison of Two Approaches
M. Petr
,
G. Patenaude
,
J. Suárez
AGILE Conf.
2008
Corpus ID: 38099891
This paper looks at different datasets obtained from an airborne Light Detection And Ranging (LiDAR) system and compares the…
Expand
2003
2003
D S ] 3 1 O ct 2 00 3 Maintaining Information in Fully-Dynamic Trees with Top Trees ∗
Stephen Alstrup
,
Jacob Holm
,
Kristian de Lichtenberg
,
Mikkel Thorup
2003
Corpus ID: 265099078
We introduce top trees as a new data structure that makes it simpler to maintain many kinds of information in a fully-dynamic…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE