The Number of 1’s in Binary Integers: Bounds and Extremal Properties

DOI10.1137/0203020zbMath0292.68021OpenAlexW2152813177MaRDI QIDQ4044133

M. Douglas McIlroy

Publication date: 1975

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0203020

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (12)

Binary trees and uniform distribution of traffic cutback ⋮ Exponential Sums Related to Binomial Coefficient Parity ⋮ A lower bound for a remainder term associated with the sum of digits function ⋮ On the number of hypercubic bipartitions of an integer ⋮ Asymptotic expansions for linear homogeneous divide-and-conquer recurrences: algebraic and analytic approaches collated ⋮ A subquadratic algorithm for minimum palindromic factorization ⋮ An asymptotic theory for recurrence relations based on minimization and maximization. ⋮ Distribution of the sum-of-digits function of random integers: a survey ⋮ Estimates for a remainder term associated with the sum of digits function ⋮ Statistical mechanics of cellular automata ⋮ On a function related of multinomial coefficients. I. ⋮ Power sums of digital sums

This page was built for publication: The Number of 1’s in Binary Integers: Bounds and Extremal Properties