On the public citation graph

A Novel In-Place Sorting Algorithm With O(N Log Z) Comparisons And O(N Log Z) Moves

0 signed · 15 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-3-540-31856-9_52openalex-extracted

Sorting Stably, In-Place, with O(n log n) Comparisons and O(n) Moves

inferredcites →https://doi.org/10.1109/glocom.2001.965853openalex-extracted

Searching very large routing tables in wide embedded memory

inferredcites →https://doi.org/10.1109/infcom.2001.916641openalex-extracted

Using multiple hash functions to improve IP lookups

inferredcites →https://doi.org/10.1109/sfcs.2003.1238198openalex-extracted

An in-place sorting with O(n log n) comparisons and O(n) moves

inferredcites →https://doi.org/10.1109/tkde.2003.1198391openalex-extracted

Efficient approximation of correlated sums on data streams

inferredcites →https://doi.org/10.1137/s0097539795288490openalex-extracted

Balanced Allocations

inferredcites →https://doi.org/10.1137/s0097539797329889openalex-extracted

Tight Bounds for Searching a Sorted Array of Strings

inferredcites →https://doi.org/10.1145/1055558.1055598openalex-extracted

Approximate counts and quantiles over sliding windows

inferredcites →https://doi.org/10.1145/233269.233336openalex-extracted

A super scalar sort algorithm for RISC processors

inferredcites →https://doi.org/10.1145/235141.235145openalex-extracted

The influence of caches on the performance of heaps

inferredcites →https://doi.org/10.1145/258533.258647openalex-extracted

On sorting strings in external memory (extended abstract)

inferredcites →https://doi.org/10.1145/872757.872765openalex-extracted

Approximate join processing over data streams

inferredcites →https://doi.org/10.5555/314161.314321openalex-extracted

Fast algorithms for sorting and searching strings

inferredcites →https://doi.org/10.5555/982792.982833openalex-extracted

Proximity Mergesort: optimal in-place sorting in the cache-oblivious model

inferredcites →https://doi.org/10.1006/jagm.1998.0985openalex-snapshot

The Influence of Caches on the Performance of Sorting

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.