Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
An Optimal Cache-Oblivious Priority Queue and its Application to Graph Algorithms
 

Summary: An Optimal Cache-Oblivious Priority Queue and
its Application to Graph Algorithms
Lars Arge
Michael A. Bender
Erik D. Demaine§
Dept. of Computer Science Dept. of Computer Science Lab. for Computer Science
Duke University SUNY Stony Brook MIT
large@cs.duke.edu bender@cs.sunysb.edu edemaine@mit.edu
Bryan Holland-Minkley ¶
J. Ian Munro
Dept. of Computer Science School of Computer Science
Duke University University of Waterloo
bhm@cs.duke.edu imunro@uwaterloo.ca
Accepted to SIAM Journal on Computing
February 9, 2006
Abstract
We develop an optimal cache-oblivious priority queue data structure, supporting insertion,
deletion, and delete-min operations in O( 1
B logM/B
N

  

Source: Arge, Lars - Department of Computer Science, Aarhus Universitet

 

Collections: Computer Technologies and Information Sciences