Skip to search formSkip to main contentSemantic Scholar

You are currently offline. Some features of the site may not work correctly.

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

2014

2014

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

Is this relevant?

2014

2014

group communication is an active area of research and its popularity is fuelled by the growing importance of group oriented… Expand

Is this relevant?

2009

2009

Several groupware applications such as distributed databases, video conferences, distributed computation etc require secure… Expand

Is this relevant?

2009

2009

According to the Fibonacci number which is studied by Prodinger et al., we introduce the 2-plane tree which is a planted plane… Expand

Is this relevant?

2008

2008

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

Is this relevant?

2007

2007

In this paper we provide upper and lower bounds on the area requirement of straight-line orthogonal drawings of n-node binary and… Expand

Is this relevant?

2006

2006

Michael Somos conjectured a relation between Hankel determinants whose entries ${1\over 2n+1}{3n\choose n}$ count ternary trees… Expand

Is this relevant?

2003

2003

In this paper we present efficient graph embeddings for complete k-ary trees into boolean hypercubes. In particular, we describe… Expand

Is this relevant?

2002

2002

The number Nn of non-crossing trees of size n satisfies Nn+1 = Tn, where Tn enumerates ternary trees of size n. We constuct a new… Expand

Is this relevant?

1992

1992

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

Is this relevant?