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