A note on gray code and odd-even merge

Gerhard Larcher; Robert F. Tichy

doi:10.1016/S0166-218X(87)80006-9

A note on gray code and odd-even merge

Gerhard Larcher^*, Robert F. Tichy

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English
Pages (from-to)	309-313
Number of pages	5
Journal	Discrete Applied Mathematics
Volume	18
Issue number	3
DOIs	https://doi.org/10.1016/S0166-218X(87)80006-9
Publication status	Published - Dec 1987
Externally published	Yes

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/S0166-218X(87)80006-9

Cite this

@article{d2b71964c0b44af6b55721803f765576,

title = "A note on gray code and odd-even merge",

abstract = "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.",

author = "Gerhard Larcher and Tichy, {Robert F.}",

year = "1987",

month = dec,

doi = "10.1016/S0166-218X(87)80006-9",

language = "English",

volume = "18",

pages = "309--313",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

number = "3",

}

TY - JOUR

T1 - A note on gray code and odd-even merge

AU - Larcher, Gerhard

AU - Tichy, Robert F.

PY - 1987/12

Y1 - 1987/12

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0023586264&partnerID=8YFLogxK

U2 - 10.1016/S0166-218X(87)80006-9

DO - 10.1016/S0166-218X(87)80006-9

M3 - Article

AN - SCOPUS:0023586264

VL - 18

SP - 309

EP - 313

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - 3

ER -

A note on gray code and odd-even merge

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this