# K-ary tree

## Papers overview

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

2011

2011

- Appl. Math. Lett.
- 2011

Following [1], in this note we compute the average number of protected points in all k-ary trees with n internal points.Â

Is this relevant?

Highly Cited

2007

Highly Cited

2007

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

- ACM Trans. Algorithms
- 2007

We consider the <i>indexable dictionary</i> problem, which consists of storing a set <i>S</i> âŠ† {0,â€¦,<i>m</i> âˆ’ 1} for someâ€¦Â (More)

Is this relevant?

2006

2006

- GTIT-C
- 2006

Starting from the root, extend k branches and append k children with probability p, or terminate with probability q = 1âˆ’ p. Thenâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- SODA
- 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â€¦Â (More)

Is this relevant?

2001

2001

- Inf. Process. Lett.
- 2001

Many algorithms have been developed to generate sequences for trees, and a few are to generate trees themselves, i.e., inâ€¦Â (More)

Is this relevant?

2000

2000

- Comput. J.
- 2000

A recursive algorithm GenWordsRand a non-recursive algorithmGenWordsNRare presented in this paper to generate sequences forâ€¦Â (More)

Is this relevant?

2000

2000

- PDPTA
- 2000

In this paper, we present a real-time faulttolerant design for an l-level k-ary tree multiprocessor with two modes of operationsâ€¦Â (More)

Is this relevant?

2000

2000

- Inf. Process. Lett.
- 2000

Vajnovszki recently developed a loopless algorithm [Inform. Process. Lett. 68 (1998) 113] to enumerate Gray codes for binaryâ€¦Â (More)

Is this relevant?

1997

1997

- PDPTA
- 1997

In this paper, we present a strongly faulttolerant design for the l-level k-ary tree multiprocessor and examine itsâ€¦Â (More)

Is this relevant?

1994

1994

- Inf. Process. Lett.
- 1994

Roelants van Baronaigien (1991) gave an algorithm to generate all n-node binary tree representations with constant time betweenâ€¦Â (More)

Is this relevant?