Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

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

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

2011

2011

Following Cheon and Shapiro (2008) [3], in this note we compute the average number of protected points in all k-ary trees with n… Expand

2009

2009

The antibandwidth problem is to label vertices of a n-vertex graph injectively by 1,2,3,...n, so that the minimum difference… Expand

2009

2009

In this paper we present a construction of every k-ary tree using a forest of (k − 1)ary trees satisfying a particular condition… Expand

Highly Cited

2007

Highly Cited

2007

Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets

We consider the indexable dictionary problem, which consists of storing a set S ⊆ {0,…,m − 1} for some integer m while supporting… Expand

Highly Cited

2002

Highly Cited

2002

We consider the <i>indexable dictionary</i> problem which consists in storing a set <i>S</i> ⊆ {0,…, <i>m</i> - 1} for some… Expand

2000

2000

A recursive algorithm GenWordsRand a non-recursive algorithmGenWordsNRare presented in this paper to generate sequences for… Expand

2000

2000

The bit sequence representation for k-ary trees is a sequence b1,b2,?,bnk+1 of bits that is formed by doing a preorder traversal… Expand

1999

1999

The only parallel generating algorithms for k-ary trees are those of Akl and Stojmenovic in 1996 and of Vajnovszki and Phillips… Expand

Highly Cited

1992

Highly Cited

1992

The contact process on an infinite homogeneous tree is shown to exhibit at least two phase transitions as the infection parameter… Expand

Highly Cited

1978

Highly Cited

1978

The problem of ranking a finite set X may be defined as follows: if $|X| = N$, define a linear order on X and find the order… Expand