Pages that link to "Item:Q4137890"
From MaRDI portal
The following pages link to Design and implementation of an efficient priority queue (Q4137890):
Displaying 50 items.
- Union and split operations on dynamic trapezoidal maps (Q1841116) (← links)
- Improved fast integer sorting in linear space (Q1854461) (← links)
- An efficient algorithm for enumeration of triangulations (Q1862130) (← links)
- Optimal bounds for the predecessor problem and related problems (Q1869935) (← links)
- A new approach to all-pairs shortest paths on real-weighted graphs (Q1884872) (← links)
- Longest increasing subsequences in sliding windows (Q1885912) (← links)
- Searching among intervals and compact routing tables (Q1913700) (← links)
- Shortest paths algorithms: Theory and experimental evaluation (Q1919099) (← links)
- Fast computation of a longest increasing subsequence and application (Q1959440) (← links)
- Range minimum queries in minimal space (Q2078612) (← links)
- An axiomatic approach to time-dependent shortest path oracles (Q2118212) (← links)
- Computing the longest common almost-increasing subsequence (Q2166775) (← links)
- Extensions of self-improving sorters (Q2285051) (← links)
- Dynamic interpolation search revisited (Q2288214) (← links)
- Finger search in grammar-compressed strings (Q2322694) (← links)
- Computing maximum non-crossing matching in convex bipartite graphs (Q2348053) (← links)
- Data structures on event graphs (Q2350906) (← links)
- Rotation and lighting invariant template matching (Q2373879) (← links)
- Fast and compact regular expression matching (Q2378530) (← links)
- Fingerprints in compressed strings (Q2396828) (← links)
- Efficient testing and matching of deterministic regular expressions (Q2402370) (← links)
- Full-fledged real-time indexing for constant size alphabets (Q2408918) (← links)
- A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem (Q2444738) (← links)
- Compressed data structures: Dictionaries and data-aware measures (Q2465063) (← links)
- Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem (Q2466000) (← links)
- Lower bounds for predecessor searching in the cell probe model (Q2475409) (← links)
- Adaptive sampling for geometric problems over data streams (Q2477195) (← links)
- Utilization-based admission control for aperiodic tasks under EDF scheduling (Q2516961) (← links)
- A Survey on Priority Queues (Q2848973) (← links)
- Longest Common Extensions in Trees (Q2942245) (← links)
- Efficient range searching for categorical and plain data (Q2943571) (← links)
- Worst Case Efficient Single and Multiple String Matching in the RAM Model (Q3000497) (← links)
- Distance Oracles for Vertex-Labeled Graphs (Q3012943) (← links)
- STRONGER QUICKHEAPS (Q3016226) (← links)
- Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems (Q3078395) (← links)
- PROCESSING AN OFFLINE INSERTION-QUERY SEQUENCE WITH APPLICATIONS (Q3173480) (← links)
- Connectivity Oracles for Graphs Subject to Vertex Failures (Q3387763) (← links)
- A LINEAR SPACE DATA STRUCTURE FOR ORTHOGONAL RANGE REPORTING AND EMPTINESS QUERIES (Q3628098) (← links)
- A priority queue in which initialization and queue operations takeO(loglogD) time (Q3673101) (← links)
- On the time and space complexity of computation using write-once memory or is pen really much worse than pencil? (Q4000866) (← links)
- (Q4008192) (← links)
- Using persistent data structures for adding range restrictions to searching problems (Q4362274) (← links)
- Searching among intervals and compact routing tables (Q4630246) (← links)
- Predecessor queries in dynamic integer sets (Q5047156) (← links)
- Sorting and searching revisted (Q5054812) (← links)
- Neighbours on a grid (Q5054822) (← links)
- Output-sensitive generation of the perspective view of isothetic parallelepipeds (Q5056093) (← links)
- Two- and three- dimensional point location in rectangular subdivisions (Q5056154) (← links)
- Lower bounds for dynamic algorithms (Q5056175) (← links)
- (Q5088893) (← links)