Design and implementation of an efficient priority queue
From MaRDI portal
(Redirected from Publication:4137890)
Cites work
- A fast algorithm for computing longest common subsequences
- An axiomatic definition of the programming language Pascal
- Efficiency of a Good But Not Linear Set Union Algorithm
- scientific article; zbMATH DE number 3478389 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- Set Merging Algorithms
Cited in
(only showing first 100 items - show all)- Orthogonal range searching in linear and almost-linear space
- An O(m log log D) algorithm for shortest paths
- Towards optimal parallel bucket sorting
- Fractional cascading. I: A data structuring technique
- Order preserving extendible hashing and bucket tries
- A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time
- Output-sensitive generation of the perspective view of isothetic parallelepipeds
- Fully dynamic Delaunay triangulation in logarithmic expected per operation
- An efficient one-side height minimization algorithm for routing around a rectangle
- Fast geometric approximation techniques and geometric embedding problems
- The complexity of coloring games on perfect graphs
- Sequential and parallel algorithms for the maximum-weight independent set problem on permutation graphs
- Preserving order in a forest in less than logarithmic time and linear space
- Surpassing the information theoretic bound with fusion trees
- Trans-dichotomous algorithms for minimum spanning trees and shortest paths
- Sorting helps for Voronoi diagrams
- The space-optimal version of a known rectangle enclosure reporting algorithm
- A new algorithm for rectangle enclosure reporting
- Searching of gapped repeats and subrepetitions in a word
- The nearest colored node in a tree
- Dynamic relative compression, dynamic partial sums, and substring concatenation
- Parallel processing can be harmful: The unusual behavior of interpolation search
- Log-logarithmic worst-case range queries are possible in space theta(N)
- Union and split operations on dynamic trapezoidal maps
- Improved fast integer sorting in linear space
- An efficient algorithm for enumeration of triangulations
- Optimal bounds for the predecessor problem and related problems
- A new approach to all-pairs shortest paths on real-weighted graphs
- Longest increasing subsequences in sliding windows
- Searching among intervals and compact routing tables
- Shortest paths algorithms: Theory and experimental evaluation
- Fast computation of a longest increasing subsequence and application
- Range minimum queries in minimal space
- An axiomatic approach to time-dependent shortest path oracles
- Computing the longest common almost-increasing subsequence
- Extensions of self-improving sorters
- Dynamic interpolation search revisited
- Finger search in grammar-compressed strings
- Computing maximum non-crossing matching in convex bipartite graphs
- Rotation and lighting invariant template matching
- Fast and compact regular expression matching
- Efficient testing and matching of deterministic regular expressions
- A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem
- Compressed data structures: Dictionaries and data-aware measures
- Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem
- Lower bounds for predecessor searching in the cell probe model
- Adaptive sampling for geometric problems over data streams
- Utilization-based admission control for aperiodic tasks under EDF scheduling
- A survey on priority queues
- Efficient algorithms for the temporal precedence problem
- Longest common extensions in trees
- Efficient range searching for categorical and plain data
- Longest common extensions in trees
- Worst case efficient single and multiple string matching in the RAM model
- Distance oracles for vertex-labeled graphs
- STRONGER QUICKHEAPS
- Hashed Patricia trie: efficient longest prefix matching in peer-to-peer systems
- Processing an offline insertion-query sequence with applications
- Connectivity oracles for graphs subject to vertex failures
- A LINEAR SPACE DATA STRUCTURE FOR ORTHOGONAL RANGE REPORTING AND EMPTINESS QUERIES
- A priority queue in which initialization and queue operations takeO(loglogD) time
- Algorithms for interval structures with applications
- Cross-document pattern matching
- On the time and space complexity of computation using write-once memory or is pen really much worse than pencil?
- scientific article; zbMATH DE number 60387 (Why is no real title available?)
- Using persistent data structures for adding range restrictions to searching problems
- Worst-case efficient single and multiple string matching on packed texts in the word-RAM model
- Searching among intervals and compact routing tables
- On the generalized constrained longest common subsequence problems
- Predecessor queries in dynamic integer sets
- Sorting and searching revisted
- Neighbours on a grid
- Output-sensitive generation of the perspective view of isothetic parallelepipeds
- Two- and three- dimensional point location in rectangular subdivisions
- Lower bounds for dynamic algorithms
- Sufficient conditions for efficient indexing under different matchings
- Extensions of self-improving sorters
- Four results on randomized incremental constructions
- LZ-End Parsing in Linear Time
- Dynamic planar orthogonal point location in sublogarithmic time
- Handling precedence constraints in scheduling problems by the sequence pair representation
- Locally maximal common factors as a tool for efficient dynamic string algorithms
- Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
- Substring range reporting
- Processing an Offline Insertion-Query Sequence with Applications
- Towards optimal range medians
- Cache-oblivious index for approximate string matching
- Integer priority queues with decrease key in constant time and the single source shortest paths problem
- Range LCP
- An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model
- Linear size binary space partitions for fat objects
- A general label search to investigate classical graph search algorithms
- Efficient time-interval augmented spatial keyword queries on road networks
- Dominance in the presence of obstacles
- Predecessor on the Ultra-Wide Word RAM
- Faster algorithms for computing longest common increasing subsequences
- The longest almost increasing subsequence problem with sliding windows
- How the character comparison order shapes the shift function of on-line pattern matching algorithms
- Finding maximum matchings in RDV graphs efficiently
- On the complexity of indeterminate strings matching
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)
