Limit laws for terminal nodes in random circuits with restricted fan-out: a family of graphs generalizing binary search trees

Author： Mahmoud Hosam Tsukiji Tatsuie

Publisher： Springer Publishing Company

ISSN： 0001-5903

Source： Acta Informatica, Vol.41, Iss.2-3, 2004-12, pp. : 99-110

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees

By Fuchs Michael Hwang Hsien-Kuei Neininger Ralph

Algorithmica, Vol. 46, Iss. 3-4, 2006-11 ,pp. : 367-407

Springer Publishing Company

Access to resources Recommend Favorite

Generalizing a Theorem of Wilber on Rotations in Binary Search Trees to Encompass Unordered Binary Trees

By Fredman Michael

Algorithmica, Vol. 62, Iss. 3-4, 2012-04 ,pp. : 863-878

Springer Publishing Company

Access to resources Recommend Favorite

Optimal binary search trees

By Nagaraj S.V.

Theoretical Computer Science, Vol. 188, Iss. 1, 1997-11 ,pp. : 1-44

Elsevier

Access to resources Recommend Favorite

The Variance of the height of binary search trees

By Drmota M.

Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. : 913-919

Elsevier

Access to resources Recommend Favorite

Distances in random digital search trees

By Aguech Rafik Lasmar Nabil Mahmoud Hosam

Acta Informatica, Vol. 43, Iss. 4, 2006-11 ,pp. : 243-264

Springer Publishing Company

Access to resources Recommend Favorite