Pages that link to "Item:Q4696645"
From MaRDI portal
The following pages link to Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values (Q4696645):
Displaying 37 items.
- ANSV problem on BSRs (Q293212) (← links)
- A simple algorithm for replacement paths problem (Q327668) (← links)
- Simultaneous encodings for range and next/previous larger/smaller value queries (Q344773) (← links)
- Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs (Q396686) (← links)
- Combined data structure for previous- and next-smaller-values (Q533896) (← links)
- An efficient parallel algorithm for building the separating tree (Q666141) (← links)
- A work-time optimal algorithm for computing all string covers (Q671438) (← links)
- Fast parallel string prefix-matching (Q674342) (← links)
- Dominance made simple (Q987777) (← links)
- On finding fundamental cut sets (Q990139) (← links)
- Faster entropy-bounded compressed suffix trees (Q1038474) (← links)
- Optimal parallel algorithms for forest and term matching (Q1186605) (← links)
- Randomized range-maxima in nearly-constant parallel time (Q1210333) (← links)
- New algorithms for the LCA problem and the binary tree reconstruction problem (Q1328757) (← links)
- Almost fully-parallel parentheses matching (Q1345960) (← links)
- Parallel maximum independent set in convex bipartite graphs (Q1350905) (← links)
- Algorithms for testing occurrences of length 4 patterns in permutations (Q1698070) (← links)
- Encoding nearest larger values (Q1698712) (← links)
- Parallel algorithms for separable permutations (Q1763485) (← links)
- Optimal parallel algorithms for rectilinear link-distance problems (Q1897477) (← links)
- Finding patterns and periods in Cartesian tree matching (Q2207506) (← links)
- Fast algorithms for single and multiple pattern Cartesian tree matching (Q2215968) (← links)
- Space efficient data structures for nearest larger neighbor (Q2634717) (← links)
- Encoding Nearest Larger Values (Q2942276) (← links)
- Space Efficient Data Structures for Nearest Larger Neighbor (Q2946053) (← links)
- Parallel algorithms on interval graphs (Q4359285) (← links)
- An O(log log n) algorithm to compute the kernel of a polygon (Q5054771) (← links)
- An optimal parallel algorithm for computing a near-optimal order of matrix multiplications (Q5056129) (← links)
- Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs (Q5060111) (← links)
- All Nearest Smallers Made Simple (Q5087073) (← links)
- PARALLEL VERTEX COLOURING OF INTERVAL GRAPHS (Q5248988) (← links)
- PARALLEL RANGE MINIMA ON COARSE GRAINED MULTICOMPUTERS (Q5249012) (← links)
- Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies (Q5270943) (← links)
- An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane (Q5387800) (← links)
- (Q5874500) (← links)
- Fast parallel algorithms for the maximum empty rectangle problem. (Q5955753) (← links)
- Serial and parallel algorithms for order-preserving pattern matching based on the duel-and-sweep paradigm (Q6634510) (← links)
