Pages that link to "Item:Q1104105"

The following pages link to The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time (Q1104105):

Displaying 20 items.

• Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms (Q758188) (← links)
• Deterministic parallel list ranking (Q808699) (← links)
• On optimal parallel computations for sequences of brackets (Q808700) (← links)
• A simple randomized parallel algorithm for list-ranking (Q911268) (← links)
• Parallel recognition of complement reducible graphs and cotree construction (Q919826) (← links)
• Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees (Q975474) (← links)
• An optimal algorithm for the maximum-density path in a tree (Q989545) (← links)
• A unified approach to parallel depth-first traversals of general trees (Q1178197) (← links)
• Efficient parallel algorithms for r-dominating set and p-center problems on trees (Q1262780) (← links)
• Efficient parallel algorithms for graph problems (Q1262781) (← links)
• Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs (Q1317488) (← links)
• Computing Prüfer codes efficiently in parallel (Q1566573) (← links)
• Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree (Q1816995) (← links)
• Faster optimal parallel prefix sums and list ranking (Q1825647) (← links)
• An optimal parallel algorithm for planar cycle separators (Q1900892) (← links)
• Balancing straight-line programs for strings and trees (Q2106614) (← links)
• Fast algorithms for approximate Fréchet matching queries in geometric trees (Q2349741) (← links)
• Optimal parallel algorithms for multiple updates of minimum spanning trees (Q2366226) (← links)
• Parallel computation on interval graphs: algorithms and experiments (Q4790934) (← links)
• Collection depots facility location problems in trees (Q5191128) (← links)