Design and implementation of an efficient priority queue

Cites Work

Title not available (Why is that?)
Efficiency of a Good But Not Linear Set Union Algorithm
A fast algorithm for computing longest common subsequences
Title not available (Why is that?)
An axiomatic definition of the programming language Pascal
Set Merging Algorithms

Cited In (only showing first 100 items - show all)

Bounded ordered dictionaries in O(log log N) time and O(n) space
Hidden surface removal for rectangles
Four results on randomized incremental constructions
Range-restricted mergeable priority queues
Towards optimal parallel bucket sorting
Fast geometric approximation techniques and geometric embedding problems
On sorting, heaps, and minimum spanning trees
Using persistent data structures for adding range restrictions to searching problems
Towards optimal range medians
Orthogonal range searching in linear and almost-linear space
An efficient algorithm for enumeration of triangulations
A general label search to investigate classical graph search algorithms
Fully dynamic Delaunay triangulation in logarithmic expected per operation
Fractional cascading. I: A data structuring technique
Integer priority queues with decrease key in constant time and the single source shortest paths problem
Cache-oblivious index for approximate string matching
An algorithm for solving the longest increasing circular subsequence problem
Preserving order in a forest in less than logarithmic time and linear space
A note on predecessor searching in the pointer machine model
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
Four results on randomized incremental constructions
Sorting helps for Voronoi diagrams
Efficient algorithms for the temporal precedence problem
Longest common extensions in trees
Longest common extensions in trees
Cross-document pattern matching
An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model
On the generalized constrained longest common subsequence problems
Finding shortest path in the presence of barriers: an alternate approach
Substring range reporting
New trie data structures which support very fast search operations
Worst case efficient single and multiple string matching in the RAM model
A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle
Worst-case efficient single and multiple string matching on packed texts in the word-RAM model
The space-optimal version of a known rectangle enclosure reporting algorithm
Range minimum queries in minimal space
Range LCP
Dynamic fractional cascading
Visibility and intersection problems in plane geometry
Compressed data structures: Dictionaries and data-aware measures
A new approach to all-pairs shortest paths on real-weighted graphs
Title not available (Why is that?)
Linear size binary space partitions for fat objects
Surpassing the information theoretic bound with fusion trees
Speeding up transposition-invariant string matching
A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time
Log-logarithmic worst-case range queries are possible in space theta(N)
Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
Utilization-based admission control for aperiodic tasks under EDF scheduling
Lower bounds for predecessor searching in the cell probe model
Longest increasing subsequences in sliding windows
Fast computation of a longest increasing subsequence and application
Searching among intervals and compact routing tables
Optimal bounds for the predecessor problem and related problems
On the time and space complexity of computation using write-once memory or is pen really much worse than pencil?
An O(m log log D) algorithm for shortest paths
Faster algorithms for computing longest common increasing subsequences
Upper bounds for sorting integers on random access machines
Handling precedence constraints in scheduling problems by the sequence pair representation
Dynamic relative compression, dynamic partial sums, and substring concatenation
Dynamic planar orthogonal point location in sublogarithmic time
Fast and compact regular expression matching
Shortest paths algorithms: Theory and experimental evaluation
How the character comparison order shapes the shift function of on-line pattern matching algorithms
Rotation and lighting invariant template matching
A survey on priority queues
Algorithms for interval structures with applications
Order preserving extendible hashing and bucket tries
Sorting and searching revisted
A priority queue in which initialization and queue operations takeO(loglogD) time
Adaptive sampling for geometric problems over data streams
Finger search in grammar-compressed strings
The longest almost increasing subsequence problem with sliding windows
A new algorithm for rectangle enclosure reporting
Efficient range searching for categorical and plain data
Fingerprints in compressed strings
An axiomatic approach to time-dependent shortest path oracles
Full-fledged real-time indexing for constant size alphabets
Two- and three- dimensional point location in rectangular subdivisions
Title not available (Why is that?)
Title not available (Why is that?)
Improved fast integer sorting in linear space
Efficient testing and matching of deterministic regular expressions
Searching of gapped repeats and subrepetitions in a word
Hashed Patricia trie: efficient longest prefix matching in peer-to-peer systems
Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem
Processing an offline insertion-query sequence with applications
Locally maximal common factors as a tool for efficient dynamic string algorithms
Searching among intervals and compact routing tables
A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem
STRONGER QUICKHEAPS
Computing maximum non-crossing matching in convex bipartite graphs
Computing the longest common almost-increasing subsequence
Efficient time-interval augmented spatial keyword queries on road networks
Longest increasing subsequence under persistent comparison errors
Dominance in the presence of obstacles
Processing an Offline Insertion-Query Sequence with Applications
A LINEAR SPACE DATA STRUCTURE FOR ORTHOGONAL RANGE REPORTING AND EMPTINESS QUERIES
Extensions of self-improving sorters
Dynamic interpolation search revisited

This page was built for publication: Design and implementation of an efficient priority queue

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4137890)