A Note on Gray Code and Odd-Even Merge
From MaRDI portal
Cited in
(24)- Brownian motion and algorithm complexity
- A note on Gray code and odd-even merge
- On a recursion connected with tree balancing algorithms
- Non-repetitive sequences and Gray code
- The ring of k-regular sequences
- The number of registers required for evaluating arithmetic expressions
- Mellin transforms and asymptotics: Digital sums
- Fractal digital sums and codes
- Coquet-type formulas for the rarefied weighted Thue-Morse sequence
- Stern polynomials
- Algebraic independence results related to \(\langle q,r\rangle\)-number systems
- Minimal expansions in redundant number systems: Fibonacci bases and greedy algorithms
- Batcher's odd-even exchange revisited: a generating functions approach
- Subblock Occurrences in Positional Number Systems and Gray code Representation
- Subblock Occurrences in the q-Ary Representation of n
- Generalizing the Sum of Digits Function
- 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
- Distribution of the sum-of-digits function of random integers: a survey
- Power and exponential sums for generalized coding systems by a measure theoretic approach
- On q-quasiadditive and q-quasimultiplicative functions
- Philippe Flajolet's early work in combinatorics
- Relations among arithmetical functions, automatic sequences, and sum of digits functions induced by certain Gray codes
- Average growth-behavior and distribution properties of generalized weighted digit-block-\-counting functions
This page was built for publication: A Note on Gray Code and Odd-Even Merge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3893337)
