Ternary tree

Known as: Ternary

In computer science, a ternary tree is a tree data structure in which each node has at most three child nodes, usually distinguished as "left", “mid…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

In this work, a scalable and modular architecture for massive MIMO base stations with distributed processing is proposed. New…

2016

Fast Fourier Transform (FFT) is widely used in signal processing applications. For a 2n-point FFT, split-radix FFT costs less…

2014

This paper presents an efficient contributory group key agreement protocol for secure communication between the lightweight small…

2011

This paper proposes a broadcast encryption scheme with traitor tracing based on the ternary tree structure. The subset difference…

2008

We inductively describe an embedding of a complete ternary tree T h of height h into a hypercube Q of dimension at most (1.6)h…

2008

Summary In this paper, the focus is on the use of Ternary Trees over Binary Tress. First of all, we give the memory…

2007

Many routing protocols for ad-hoc networks and sensor networks have been designed, but none of them are based on groups. We…

2007

The Ternary Tree Solver (tts) algorithm is a complete, deterministic solver for CNF satisfiability. This note describes the…

1992

Sorting is a significant activity for which better methods are always sought. In many computing scenarios, sorting must be done…

1989

In recent years, several authors have presented algorithms that locate instances of a given string, or set of strings, within a…