Pages that link to "Item:Q1329156"
From MaRDI portal
The following pages link to Trans-dichotomous algorithms for minimum spanning trees and shortest paths (Q1329156):
Displayed 50 items.
- Linear-space data structures for range frequency queries on arrays and trees (Q261369) (← links)
- On compressing permutations and adaptive sorting (Q391981) (← links)
- Cross-document pattern matching (Q396714) (← links)
- The saga of minimum spanning trees (Q458468) (← links)
- Augmenting graphs to minimize the diameter (Q494792) (← links)
- A fast algorithm for data collection along a fixed track (Q744105) (← links)
- Well-separated pair decomposition in linear time? (Q963421) (← links)
- A faster algorithm for the single source shortest path problem with few distinct positive lengths (Q972360) (← links)
- Fusion trees can be implemented with \(AC^0\) instructions only (Q1287094) (← links)
- On constructing the elimination tree (Q1314332) (← links)
- Iterated nearest neighbors and finding minimal polytopes (Q1327455) (← links)
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs (Q1391297) (← links)
- Space-efficient indexes for forbidden extension queries (Q1632508) (← links)
- Validating the Knuth-Morris-Pratt failure function, fast and online (Q1678758) (← links)
- Lower bounds for dynamic algebraic problems (Q1854488) (← links)
- All-pairs shortest paths and the essential subgraph (Q1894298) (← links)
- Shortest paths algorithms: Theory and experimental evaluation (Q1919099) (← links)
- Distributed verification of minimum spanning trees (Q1954247) (← links)
- Color-spanning localized query (Q1998849) (← links)
- Faster compressed quadtrees (Q2084740) (← links)
- Data structures for categorical path counting queries (Q2089697) (← links)
- From regular expression matching to parsing (Q2089747) (← links)
- Input-output networks offer new insights of economic structure (Q2161726) (← links)
- Universal reconstruction of a string (Q2297860) (← links)
- \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm (Q2344206) (← links)
- Proof labeling schemes (Q2377139) (← links)
- Full-fledged real-time indexing for constant size alphabets (Q2408918) (← links)
- Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem (Q2466000) (← links)
- Improved algorithms for replacement paths problems in restricted graphs (Q2488196) (← links)
- Rectilinear paths among rectilinear obstacles (Q2563920) (← links)
- Efficient range searching for categorical and plain data (Q2943571) (← links)
- Dynamic Planar Range Maxima Queries (Q3012811) (← links)
- FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING (Q3022028) (← links)
- Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search (Q3448817) (← links)
- Universal Reconstruction of a String (Q3449836) (← links)
- An Optimal Parallel Algorithm for Minimum Spanning Trees in Planar Graphs (Q3464472) (← links)
- Path Minima in Incremental Unrooted Trees (Q3541117) (← links)
- (Q4008192) (← links)
- Finding the k Shortest Paths (Q4210169) (← links)
- Using sparsification for parametric minimum spanning tree problems (Q5054811) (← links)
- Smoothing the Gap Between NP and ER (Q5071086) (← links)
- From Regular Expression Matching to Parsing (Q5092434) (← links)
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs (Q5096337) (← links)
- Trans-dichotomous algorithms without multiplication — some upper and lower bounds (Q5096958) (← links)
- Partitioned event graph: formalizing LP-based modelling of parallel discrete-event simulation (Q5248063) (← links)
- Random Access to Grammar-Compressed Strings and Trees (Q5255003) (← links)
- A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges (Q5886043) (← links)
- Faster shortest-path algorithms for planar graphs (Q5906822) (← links)
- Integer priority queues with decrease key in constant time and the single source shortest paths problem (Q5917573) (← links)
- (Q6065455) (← links)