Binary trees and uniform distribution of traffic cutback

DOI10.1016/0022-0000(86)90001-2zbMath0593.68051OpenAlexW2059539713MaRDI QIDQ1076523

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 path lengthexternal left 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)

Related Items (2)

An asymptotic theory for recurrence relations based on minimization and maximization. ⋮ Distribution of the sum-of-digits function of random integers: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• The Number of 1’s in Binary Integers: Bounds and Extremal Properties
• Power and Exponential Sums of Digital Sums Related to Binomial Coefficient Parity
• On a Combinatorial Problem in Number Theory
• ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS

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