John Iacono, Stefan Langerman  Home/Search
Context
Related
| cgm.cs.mcgill.ca/~sl/pap...queaps.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cgm.cs.mcgill.ca/~...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a new priority queue data structure, the queap, that executes insertion in O(1) amortized time and extract-min in O(log(k + 2)) amortized time if there are k items that have been in the heap longer than the item to be extracted. Thus if the operations on the queap are rst-in rst-out, as on a queue, each operation will execute in constant time. This idea of trying to make operations on the least recently accessed items fast, which we call the queueish property, is a natural... (Update)
Active bibliography (related documents): More All
1.5: Proximate Point Searching - Erik Demaine John (2002) (Correct)
0.5: Optimal Planar Point Location - John Iaco No (Correct)
0.4: A Heap-Based Optimal Inversions-Sensitive Sorting Algorithm - Sridhar (2003) (Correct)
Similar documents based on text: More All
0.3: Output-Sensitive Algorithms for Computing.. - Bremner, Demaine, .. (Correct)
0.3: Volume Queries in Polyhedra - John Iacono And (Correct)
0.3: Open Problems from CCCG 2001 - Demaine, O'Rourke (2000) (Correct)
BibTeX entry: (Update)
@misc{ iacono-queaps,
author = "John Iacono and Stefan Langerman",
title = "Queaps",
url = "citeseer.ist.psu.edu/iacono02queaps.html" }
Citations (may not include all citations):213 Nonuniform random variate generation (context) - Devroye - 1986
67 A new data structure for representing sorted lists (context) - Huddleston, Mehlhorn - 1982
49 The pairing heap: A new form of self-adjusting heap (context) - Fredman, Sedgewick et al. - 1986
30 Self-adjusting heaps (context) - Sleator, Tarjan - 1986
20 An algorithm for the organization of information (context) - Adel'son-Vel'skii, Landis - 1962
15 Methods for achieving fast query times in point location dat.. - Goodrich, Orletsky et al. - 1997
14 Self-adjusting binary trees (context) - Sleator, Tarjan - 1985
10 Lower bounds for accessing binary search trees with rotation.. (context) - Wilber - 1989
9 Alternatives to splay trees with O (context) - Iacono - 2001
9 Sequential access in splay trees takes linear time (context) - Tarjan - 1985
5 the dynamic nger conjecture for splay trees (context) - Cole - 2000
5 the dynamic nger conjecture for splay trees (context) - Cole, Mishra et al. - 2000
2 Optimum search in planar subdivisions (context) - Kirkpatrick - 1983
2 New upper bounds for pairing heaps (context) - Iacono - 2000
1 Amoritzed Complexity of Data Structures (context) - Sundar - 1991
1 Key independent optimality (context) - Iacono - 2002
1 Proximate point searching - Demaine, Iacono et al. - 2002
Documents on the same site (http://cgm.cs.mcgill.ca/~sl/publications.html): More
Interlocked Open Linkages with Few Joints - Demaine, Langerman, O'Rourke.. (2002) (Correct)
Computing Signed Permutations of Polygons - Greg Aloupis Prosenjit (2002) (Correct)
On the Complexity of Halfspace Area Queries - Langerman (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC