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.
- Efficient algorithms for the temporal precedence problem (Q293412) (← links)
- Longest common extensions in trees (Q294947) (← links)
- Algorithms for interval structures with applications (Q388095) (← links)
- Cross-document pattern matching (Q396714) (← links)
- Worst-case efficient single and multiple string matching on packed texts in the word-RAM model (Q450552) (← links)
- On the generalized constrained longest common subsequence problems (Q491203) (← links)
- Handling precedence constraints in scheduling problems by the sequence pair representation (Q511691) (← links)
- Substring range reporting (Q517792) (← links)
- Towards optimal range medians (Q541663) (← links)
- Cache-oblivious index for approximate string matching (Q551183) (← links)
- A general label search to investigate classical graph search algorithms (Q617648) (← links)
- Faster algorithms for computing longest common increasing subsequences (Q655431) (← links)
- How the character comparison order shapes the shift function of on-line pattern matching algorithms (Q671355) (← links)
- Four results on randomized incremental constructions (Q686138) (← links)
- Range-restricted mergeable priority queues (Q689640) (← links)
- Upper bounds for sorting integers on random access machines (Q789897) (← links)
- New trie data structures which support very fast search operations (Q794438) (← links)
- Speeding up transposition-invariant string matching (Q845816) (← links)
- Finding shortest path in the presence of barriers: an alternate approach (Q870173) (← links)
- Dynamic fractional cascading (Q908708) (← links)
- Visibility and intersection problems in plane geometry (Q910213) (← links)
- A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle (Q911283) (← links)
- Bounded ordered dictionaries in O(log log N) time and O(n) space (Q915434) (← links)
- Hidden surface removal for rectangles (Q918209) (← links)
- On sorting, heaps, and minimum spanning trees (Q973020) (← links)
- An algorithm for solving the longest increasing circular subsequence problem (Q987842) (← links)
- A note on predecessor searching in the pointer machine model (Q989469) (← links)
- Orthogonal range searching in linear and almost-linear space (Q1005331) (← links)
- An O(m log log D) algorithm for shortest paths (Q1053460) (← links)
- Towards optimal parallel bucket sorting (Q1098305) (← links)
- Fractional cascading. I: A data structuring technique (Q1099957) (← links)
- Order preserving extendible hashing and bucket tries (Q1157906) (← links)
- A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time (Q1187029) (← links)
- Output-sensitive generation of the perspective view of isothetic parallelepipeds (Q1194332) (← links)
- Fully dynamic Delaunay triangulation in logarithmic expected per operation (Q1199828) (← links)
- An efficient one-side height minimization algorithm for routing around a rectangle (Q1201874) (← links)
- Fast geometric approximation techniques and geometric embedding problems (Q1202926) (← links)
- The complexity of coloring games on perfect graphs (Q1202928) (← links)
- Sequential and parallel algorithms for the maximum-weight independent set problem on permutation graphs (Q1210310) (← links)
- Preserving order in a forest in less than logarithmic time and linear space (Q1241058) (← links)
- Surpassing the information theoretic bound with fusion trees (Q1317486) (← links)
- Trans-dichotomous algorithms for minimum spanning trees and shortest paths (Q1329156) (← links)
- Sorting helps for Voronoi diagrams (Q1355725) (← links)
- The space-optimal version of a known rectangle enclosure reporting algorithm (Q1391959) (← links)
- A new algorithm for rectangle enclosure reporting (Q1607019) (← links)
- Searching of gapped repeats and subrepetitions in a word (Q1679608) (← links)
- The nearest colored node in a tree (Q1698706) (← links)
- Dynamic relative compression, dynamic partial sums, and substring concatenation (Q1755738) (← links)
- Parallel processing can be harmful: The unusual behavior of interpolation search (Q1825662) (← links)
- Log-logarithmic worst-case range queries are possible in space theta(N) (Q1838333) (← links)
