The following pages link to Rainer Kemp (Q1108028):
Displaying 34 items.
- (Q913808) (redirect page) (← links)
- On the number of deepest nodes in ordered trees (Q913809) (← links)
- A note on the number of leftist trees (Q1108029) (← links)
- A one-to-one correspondence between two classes of ordered trees (Q1123634) (← links)
- A note on the density of inherently ambiguous context-free languages (Q1143178) (← links)
- On the number of words in the language \(\{w \epsilon \Sigma^* | w=w^ r\}^ 2\) (Q1164437) (← links)
- Binary search trees constructed from nondistinct keys with/without specified probabilities (Q1351780) (← links)
- Exact satisfiability, a natural extension of set partition, and its average case behavior (Q1353993) (← links)
- Generating words lexicographically: An average-case analysis (Q1386447) (← links)
- On the representation of simply generated trees by leftist trees (Q1399695) (← links)
- A one-to-one correspondence between a class of leftist trees and binary trees (Q1606975) (← links)
- (Q2834334) (← links)
- (Q3125172) (← links)
- (Q3468604) (← links)
- (Q3691084) (← links)
- (Q3768921) (← links)
- (Q3779735) (← links)
- (Q3782803) (← links)
- (Q3814831) (← links)
- A note on the stack size of regularly distributed binary trees (Q3865504) (← links)
- (Q3959442) (← links)
- (Q3975006) (← links)
- (Q4036166) (← links)
- (Q4268473) (← links)
- (Q4284254) (← links)
- Balanced ordered trees (Q4288882) (← links)
- (Q4306941) (← links)
- (Q4330726) (← links)
- On the average minimal prefix-length of the generalized semi-Dycklanguage (Q4341038) (← links)
- Uniformly growing backtrack trees (Q4362277) (← links)
- On the inner structure of multidimensional simply generated trees (Q4697805) (← links)
- On the joint distribution of the nodes in uniform multidimensional binary trees (Q4705345) (← links)
- (Q4934756) (← links)
- (Q5681008) (← links)