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

DOI10.1137/0203020MaRDI QIDQ4044133zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1185289
• Solution of a Divide-and-Conquer Maximin Recurrence
• On the binary digits of a power
• On Coefficients of Binary Expression of Integer Sums
• Integer complexity: experimental and analytical results. II

Cited in

(14)

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

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

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