About the Book

The Stony Brook Algorithm Repository

Steven Skiena
Stony Brook University
Dept. of Computer Science

Fast Priority Queues for Cached Memory

Sanders did extensive experiments demonstrating his sequence heap, based on K-way merging, was roughly twice as fast as a well-implemented binary heap.

Download Files (local site)

Offical Site

Problem Links

Priority Queues (8)

This page last modified on 2008-07-10 .

www.algorist.com