On the public citation graph

Cache-Aware and Cache-Oblivious Adaptive Sorting

0 signed · 37 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/3-540-45465-9_37openalex-snapshot
Cache Oblivious Distribution Sweeping
inferredcites →https://doi.org/10.1007/3-540-54029-6openalex-snapshot
Advances in Computing and Information — ICCI '91
inferredcites →https://doi.org/10.1007/3-540-54029-6_153openalex-snapshot
Practical adaptive sorting
inferredcites →https://doi.org/10.1007/3-540-57155-8_238openalex-snapshot
A general lower bound on the I/O-complexity of comparison-based algorithms
inferredcites →https://doi.org/10.1007/978-1-4615-0005-6_9openalex-snapshot
External Memory Data Structures
inferredcites →https://doi.org/10.1007/978-3-540-27810-8_2openalex-snapshot
Cache-Oblivious Algorithms and Data Structures
inferredcites →https://doi.org/10.1007/978-3-540-30140-0_50openalex-snapshot
On Adaptive Integer Sorting
inferredcites →https://doi.org/10.1007/b100428openalex-snapshot
Algorithms – ESA 2004 : 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004. Proceedings
inferredcites →https://doi.org/10.1007/b98413openalex-snapshot
Algorithm Theory - SWAT 2004
inferredcites →https://doi.org/10.1016/0020-0190(91)90181-gopenalex-snapshot
Splitsort—an adaptive sorting algorithm
inferredcites →https://doi.org/10.1016/0890-5401(89)90050-3openalex-snapshot
A new measure of presortedness
inferredcites →https://doi.org/10.1016/s0022-0000(73)80033-9openalex-snapshot
Time bounds for selection
inferredcites →https://doi.org/10.1057/jors.1991.155openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1109/sffcs.1999.814600openalex-snapshot
Cache-oblivious algorithms
inferredcites →https://doi.org/10.1109/tc.1985.5009382openalex-snapshot
Measures of Presortedness and Optimal Sorting Algorithms
inferredcites →https://doi.org/10.1145/146370.146381openalex-snapshot
A survey of adaptive sorting algorithms
inferredcites →https://doi.org/10.1145/384192.384193openalex-snapshot
External memory algorithms and data structures
inferredcites →https://doi.org/10.1145/48529.48535openalex-snapshot
The input/output complexity of sorting and related problems
inferredcites →https://doi.org/10.1145/780542.780589openalex-snapshot
On the limits of cache-obliviousness
inferredcites →https://doi.org/10.1145/800105.803395openalex-snapshot
A new representation for linear lists
inferredcites →https://doi.org/10.1201/9781420035179openalex-snapshot
Handbook of Data Structures and Applications
inferredcites →https://doi.org/10.2307/2005383openalex-snapshot
The Art of Computer Programming, Vol. 3: Sorting and Searching

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11534273_34openalex-snapshot
Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_62openalex-snapshot
Cache-Oblivious Model
inferred← citeshttps://doi.org/10.1007/978-3-642-14553-7_30openalex-snapshot
Adaptive Algorithms for Planar Convex Hull Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-25011-8_16openalex-snapshot
Two Constant-Factor-Optimal Realizations of Adaptive Heapsort
inferred← citeshttps://doi.org/10.1007/s00224-010-9285-4openalex-snapshot
Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model
inferred← citeshttps://doi.org/10.1016/j.jda.2012.04.010openalex-snapshot
The weak-heap data structure: Variants and applications
inferred← citeshttps://doi.org/10.1137/1.9781611976465.135openalex-snapshot
Competitive Data-Structure Dynamization
inferred← citeshttps://doi.org/10.1145/1227161.1227164openalex-snapshot
Engineering a cache-oblivious sorting algorithm
inferred← citeshttps://doi.org/10.1145/1227161.1370600openalex-snapshot
Terracost
inferred← citeshttps://doi.org/10.1145/1227161.1402294openalex-snapshot
On the adaptiveness of Quicksort
inferred← citeshttps://doi.org/10.1145/1248377.1248391openalex-snapshot
Optimal sparse matrix dense vector multiplication in the I/O-model
inferred← citeshttps://doi.org/10.1145/1412228.1455267openalex-snapshot
Inversion-sensitive sorting algorithms in practice
inferred← citeshttps://doi.org/10.1145/1646461.1646466openalex-snapshot
Sorting on architecturally diverse computer systems
inferred← citeshttps://doi.org/10.1145/1810479.1810519openalex-snapshot
Low depth cache-oblivious algorithms
inferred← citeshttps://doi.org/10.1587/transinf.e94.d.182openalex-snapshot
Adaptive Algorithms for Planar Convex Hull Problems
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.