pith. sign in

Title resolution pending

IEEE Computer Society · 2005 · DOI 10.1109/sfcs.2005.75

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
open at publisher browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.DS 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Near-Optimal Heaps and Dijkstra on Pointer Machines

cs.DS · 2026-04-27 · unverdicted · novelty 8.0

Pointer machines support working-set heaps with O(1) amortized Push and inverse-Ackermann DecreaseKey, making Dijkstra near-universally optimal with only O(m α(m)) additive overhead.

citing papers explorer

Showing 1 of 1 citing paper.

  • Near-Optimal Heaps and Dijkstra on Pointer Machines cs.DS · 2026-04-27 · unverdicted · none · ref 14

    Pointer machines support working-set heaps with O(1) amortized Push and inverse-Ackermann DecreaseKey, making Dijkstra near-universally optimal with only O(m α(m)) additive overhead.