A Note on Gray Code and Odd-Even Merge

From MaRDI portal
Publication:3893337

DOI10.1137/0209014zbMath0447.68083OpenAlexW2081515148MaRDI QIDQ3893337

Lyle Ramshaw, Philippe Flajolet

Publication date: 1980

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

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



Related Items

Generalizing the Sum of Digits Function, Brownian motion and algorithm complexity, Batcher's odd-even exchange revisited: a generating functions approach, Fractal digital sums and codes, Stern polynomials, A note on Gray code and odd-even merge, On a recursion connected with tree balancing algorithms, On some applications of formulae of Ramanujan in the analysis of algorithms, Asymptotic expansions for linear homogeneous divide-and-conquer recurrences: algebraic and analytic approaches collated, Philippe Flajolet's early work in combinatorics, Prefix partitioned Gray codes for particular cross-bifix-free sets, Non-repetitive sequences and Gray code, Distribution of the sum-of-digits function of random integers: a survey, Average growth-behavior and distribution properties of generalized weighted digit-block-\-counting functions, Power and exponential sums for generalized coding systems by a measure theoretic approach, The ring of \(k\)-regular sequences, On \(q\)-quasiadditive and \(q\)-quasimultiplicative functions, Subblock Occurrences in Positional Number Systems and Gray code Representation, Algebraic independence results related to \(\langle q,r\rangle\)-number systems, Relations among arithmetical functions, automatic sequences, and sum of digits functions induced by certain Gray codes, Coquet-type formulas for the rarefied weighted Thue-Morse sequence, The number of registers required for evaluating arithmetic expressions, Minimal expansions in redundant number systems: Fibonacci bases and greedy algorithms, Subblock Occurrences in the q-Ary Representation of n, Mellin transforms and asymptotics: Digital sums