Irredundant intervals

DOI10.1145/235141.235146zbMath1073.68892OpenAlexW2295384077MaRDI QIDQ5463368

Anthony LaMarca, Richard E. Ladner

Publication date: 4 August 2005

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: http://www.jea.acm.org/1996/LaMarcaInfluence/

zbMATH Keywords

priority queuesheapscache performancecollective analysis

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Related Items (8)

The d-deap\(^*\): a fast and simple cache-aligned d-ary deap ⋮ Worst-case efficient external-memory priority queues ⋮ Best practices for comparing optimization algorithms ⋮ Array Layouts for Comparison-Based Searching ⋮ Two-level heaps: a new priority queue structure with applications to the single source shortest path problem ⋮ Revisiting priority queues for image analysis ⋮ A blocked all-pairs shortest-paths algorithm ⋮ A Survey on Priority Queues

This page was built for publication: Irredundant intervals