On the public citation graph

Data Movement in Odd-Even Merging

0 signed · 35 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4757-5579-4openalex-snapshot
Introduction to Analytic Number Theory
inferredcites →https://doi.org/10.1007/bf02415499openalex-snapshot
Sur une identité d'Abel et sur d'autres formules analogues
inferredcites →https://doi.org/10.1016/b978-1-4832-3187-7.50007-6openalex-snapshot
THE AVERAGE HEIGHT OF PLANTED PLANE TREES
inferredcites →https://doi.org/10.1016/s0021-9800(66)80030-3openalex-snapshot
Evaluation of a class of binomial coefficient summations
inferredcites →https://doi.org/10.1119/1.1972842openalex-snapshot
Handbook of Mathematical Functions

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781118032770.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/9781118032886.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1006/jagm.1996.0812openalex-snapshot
On the Average Running Time of Odd–Even Merge Sort
inferred← citeshttps://doi.org/10.1007/3-540-59042-0_99openalex-snapshot
On the average running time of odd-even merge sort
inferred← citeshttps://doi.org/10.1007/978-3-0348-8211-8_22openalex-snapshot
Digits and Beyond
inferred← citeshttps://doi.org/10.1007/bf01939359openalex-snapshot
Brownian motion and algorithm complexity
inferred← citeshttps://doi.org/10.1007/bfb0009510openalex-snapshot
Periodic merging networks
inferred← citeshttps://doi.org/10.1007/pl00009238openalex-snapshot
Asymptotics of Divide-and-Conquer Recurrences: Batcher's Sorting Algorithm and a Minimum Euclidean Matching Heuristic
inferred← citeshttps://doi.org/10.1007/s002240000068openalex-snapshot
On Probabilistic Networks for Selection, Merging, and Sorting
inferred← citeshttps://doi.org/10.1016/0196-6774(80)90003-6openalex-snapshot
An analysis of (h, k, 1)-Shellsort
inferred← citeshttps://doi.org/10.1016/0304-3975(79)90009-4openalex-snapshot
The number of registers required for evaluating arithmetic expressions
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00002-eopenalex-snapshot
Mellin transforms and asymptotics: Harmonic sums
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50014-xopenalex-snapshot
Average-Case Analysis of Algorithms and Data Structures
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50024-5openalex-snapshot
10.1016/b978-044488002-4/50024-5
inferred← citeshttps://doi.org/10.1016/j.jpdc.2005.05.019openalex-snapshot
Networks for sorting multitonic sequences
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.01.024openalex-snapshot
An analytic approach to the asymptotic variance of trie statistics and related structures
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.05.014openalex-snapshot
Batcher's odd–even exchange revisited: A generating functions approach
inferred← citeshttps://doi.org/10.1016/s0166-218x(87)80006-9openalex-snapshot
A note on gray code and odd-even merge
inferred← citeshttps://doi.org/10.1080/03081089108818055openalex-snapshot
A sequential sorting network analogous to the batcher merge
inferred← citeshttps://doi.org/10.1109/parbse.1990.77140openalex-snapshot
Space efficient list merging on a multiprocessor ring
inferred← citeshttps://doi.org/10.1137/0209014openalex-snapshot
A Note on Gray Code and Odd-Even Merge
inferred← citeshttps://doi.org/10.1137/0215046openalex-snapshot
Register Allocation for Unary–Binary Trees
inferred← citeshttps://doi.org/10.1137/0215054openalex-snapshot
Digital Search Trees Revisited
inferred← citeshttps://doi.org/10.1137/0403019openalex-snapshot
Singularity Analysis of Generating Functions
inferred← citeshttps://doi.org/10.1145/1500412.1500433openalex-snapshot
The architecture of MANIP
inferred← citeshttps://doi.org/10.1145/215399.215429openalex-snapshot
On probabilistic networks for selection, merging, and sorting
inferred← citeshttps://doi.org/10.1145/324634.325428openalex-snapshot
Parallel merge-sort algorithms on the HEP
inferred← citeshttps://doi.org/10.4036/iis.2002.167openalex-snapshot
Digital Sum Problems for the Gray Code Representation of Natural Numbers
inferred← citeshttps://doi.org/10.48550/arxiv.2103.15791openalex-snapshot
Philippe Flajolet's early work in combinatorics
inferred← citeshttps://doi.org/10.54550/eca2022v2s1h1openalex-snapshot
Philippe Flajolet's early work in combinatorics
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.