Pages that link to "Item:Q1825647"

The following pages link to Faster optimal parallel prefix sums and list ranking (Q1825647):

Displaying 36 items.

• An optimal parallel algorithm for sorting multisets (Q293338) (← links)
• Fast prefix adders for non-uniform input arrival times (Q513308) (← links)
• Optimal parallel algorithms on planar graphs (Q582094) (← links)
• An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images (Q673013) (← links)
• Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms (Q758188) (← links)
• On parallel integer sorting (Q805234) (← links)
• Deterministic parallel list ranking (Q808699) (← links)
• A sublogarithmic convex hull algorithm (Q911280) (← links)
• Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees (Q1098631) (← links)
• The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time (Q1104105) (← links)
• An optimally efficient selection algorithm (Q1108805) (← links)
• Finding a minimal cover for binary images: An optimal parallel algorithm (Q1175643) (← links)
• Improved deterministic parallel integer sorting (Q1175944) (← links)
• Optimal parallel 3-coloring algorithm for rooted trees and its applications (Q1186596) (← links)
• On a compaction theorem of Ragde (Q1195502) (← links)
• Optimal parallel time bounds for the maximum clique problem on intervals (Q1198058) (← links)
• Parallel search algorithms for graphs and trees (Q1204800) (← links)
• Efficient parallel recognition of some circular arc graphs. I (Q1209733) (← links)
• Optimal circular arc representations: Properties, recognition, and construction (Q1271617) (← links)
• Parallel construction and query of index data structures for pattern matching on square matrices (Q1288531) (← links)
• Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs (Q1317488) (← links)
• Two-coloring linked lists is NC\(^ 1\)-complete for logarithmic space (Q1318772) (← links)
• Finding level-ancestors in trees (Q1329158) (← links)
• The parallel complexity of integer prefix summation (Q1350241) (← links)
• Parallel maximum independent set in convex bipartite graphs (Q1350905) (← links)
• Sorting strings and constructing digital search trees in parallel (Q1365679) (← links)
• Efficient computation of implicit representations of sparse graphs (Q1377648) (← links)
• Parallel prefix computation on extended multi-mesh network. (Q1853159) (← links)
• An optimal parallel algorithm for planar cycle separators (Q1900892) (← links)
• On the parallel computation of the biconnected and strongly connected co-components of graphs (Q2383544) (← links)
• Parallel algorithms for Burrows-Wheeler compression and decompression (Q2437742) (← links)
• A class of almost-optimal size-independent parallel prefix circuits (Q2443006) (← links)
• An efficient PRAM algorithm for maximum-weight independent set on permutation graphs (Q2574326) (← links)
• OPTIMAL BUCKET SORTING AND OVERLAP REPRESENTATIONS (Q3130162) (← links)
• Modular exponentiation via the explicit Chinese remainder theorem (Q3420440) (← links)
• An Improved Parallel Prefix Sums Algorithm (Q6135727) (← links)