A note on gray code and odd-even merge
β Scribed by Gerhard Larcher; Robert F. Tichy
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 216 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
β¦ Synopsis
Communicated by R.E. Burkard Asymptotic results for the sum-of-digits function with respect to Standard-Gray-code representation of positive integers are established. These estimates yield two bounds for the average case complexity of Batcher's odd-even -merge.
π SIMILAR VOLUMES
We present an efficient \(\theta(\log N)\) implementation of Batcher's odd-even merge on a SIMD hypercube. (The hypercube model assumes that all communications are restricted to one fixed dimension at a time.) The best previously known implementation of odd-even merge on a SIMD hypercube requires \(
It is shown that given an odd prime p, the number of even latin squares of order p+1 is not equal to the number of odd latin squares of order p+1. This result is a special case of a conjecture of Alon and Tarsi and has implications for various other combinatorial problems, including conjectures of R
The structure of nylon 5,10 has been investigated using electron microscopy and X-ray diffraction. Nylon 5,10 shows polymorphism with two different structures related to the β₯ form obtained by either solution or melt crystallization. Packing differences may be attributed to a change in the hydrogen