Binary trees and uniform distribution of traffic cutback

DOI10.1016/0022-0000(86)90001-2MaRDI QIDQ1076523zbMATH OpenOpenAlexFDO

Authors Shuo-Yen Robert Li

Publication date 1986

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-0000(86)90001-2

zbMATH Keywords

data communicationexternal left lengthexternal path lengthsmooth traffic cutback

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Applications of graph theory to circuits and networks (94C15)

Recommendations

• On the path length of binary trees
• Left and right length of paths in binary trees
• Left and right length of paths in binary trees or on a question of Knuth
• Extremal properties of ?-weighted binary trees
• Left and right pathlengths in random binary trees

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3052437 (Why is no real title available?)
• On a Combinatorial Problem in Number Theory
• ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS
• Power and Exponential Sums of Digital Sums Related to Binomial Coefficient Parity
• The Number of 1’s in Binary Integers: Bounds and Extremal Properties

Cited in

(3)

• An asymptotic theory for recurrence relations based on minimization and maximization.
• Optimal load balancing in tree networks with two-way traffic
• Distribution of the sum-of-digits function of random integers: a survey

This page was built for publication: Binary trees and uniform distribution of traffic cutback

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1076523)