AI Chat AI Image Generator AI Video Text to Speech

Recursive PGFs for BSTs and DSTs

02/07/2020

∙

by Steven Finch, et al.

∙

∙

We review fundamentals underlying binary search trees and digital search trees, with (atypical) emphasis on recursive formulas for associated probability generating functions. Other topics include higher moments of BST search costs and combinatorics for a certain finite-key analog of DSTs.

page 1

page 2

page 3

page 4

research

∙ 12/09/2019

Resolving Conflicts and Electing Leaders

We review distributed algorithms for transmitting data (n real numbers) ...

0 Steven Finch, et al. ∙

research

∙ 05/26/2020

Compaction for two models of logarithmic-depth trees: Analysis and Experiments

In this paper we are interested in the quantitative analysis of the comp...

0 Olivier Bodini, et al. ∙

research

∙ 05/10/2021

Distinct Fringe Subtrees in Random Trees

A fringe subtree of a rooted tree is a subtree induced by one of the ver...

0 Louisa Seelbach Benkner, et al. ∙

research

∙ 06/07/2021

Deterministic Iteratively Built KD-Tree with KNN Search for Exact Applications

K-Nearest Neighbors (KNN) search is a fundamental algorithm in artificia...

0 Aryan Naim, et al. ∙

research

∙ 02/07/2019

A fast algorithm for constructing balanced binary search trees

We suggest a new non-recursive algorithm for constructing a binary searc...

0 Pavel S. Ruzankin, et al. ∙

research

∙ 01/20/2022

Scalable k-d trees for distributed data

Data structures known as k-d trees have numerous applications in scienti...

0 Aritra Chakravorty, et al. ∙

research

∙ 08/30/2021

Learning Highly Recursive Input Grammars

This paper presents Arvada, an algorithm for learning context-free gramm...

0 Neil Kulkarni, et al. ∙