a priority queue with the time-finger property：具有时间指属性的优先级队列.pdfVIP

Journal of Discrete Algorithms 16 (2012) 206–212 Contents lists available at SciVerse ScienceDirect Journal of Discrete Algorithms /locate/jda A priority queue with the time-finger property ✩ Amr Elmasry a,∗,1, Arash Farzan b , John Iacono c,2 a Computer Science Department, University of Copenhagen, Denmark b Max-Planck-Institut für Informatik, Saarbrücken, Germany c Polytechnic Institute of New York University, Brooklyn, New York, USA a r t i c l e i n f o a b s t r a c t Article history: We present a priority queue that supports insert in worst-case constant time, and delete- Available online 8 May 2012 min, access-min, delete, and decrease of an element x in worst-case O (log(min{wx ,qx })) time, where wx (respectively, qx ) is the number of elements that were accessed after Keywords: (respectively, before) the last access to x and are still in the priority queue at the time Data structures when the corresponding operation is performed. (An access to an element is accounted for Priority queues Distribution-sensitive structures by any priority-queue operation that involves this element.) Our priority queue then has Working-set bound both the working-set and the queueish properties; and, more strongly, it satisfies these Splay trees