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

DOI10.1007/s00236-004-0152-0zbMath1101.68069OpenAlexW2055050606MaRDI QIDQ707496

Hosam M. Mahmoud, Tatsuie Tsukiji

Publication date: 9 February 2005

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-004-0152-0

Mathematics Subject Classification ID

Searching and sorting (68P10) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Combinatorial probability (60C05)

Related Items (3)

Longest Path Distance in Random Circuits ⋮ On nodes of small degrees and degree profile in preferential dynamic attachment circuits ⋮ A generalized Pólya urn and limit laws for the number of outputs in a family of random circuits

Cites Work

• Linear probing and graphs
• A limit law for outputs in random recursive circuits
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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