Pages that link to "Item:Q3777447"

The following pages link to Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time (Q3777447):

Displaying 50 items.

• Optimal parallel algorithms on planar graphs (Q582094) (← links)
• Scalability and communication in parallel low-complexity lossless compression (Q626896) (← links)
• Solving the shortest-paths problem on bipartite permutation graphs efficiently (Q672656) (← links)
• Randomized parallel list ranking for distributed memory multiprocessors. (Q676261) (← links)
• Efficient parallel term matching and anti-unification (Q688582) (← links)
• Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms (Q758188) (← links)
• Deterministic parallel list ranking (Q808699) (← links)
• The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time (Q1104105) (← links)
• An optimal parallel algorithm for the minimum circle-cover problem (Q1123605) (← links)
• Finding a minimal cover for binary images: An optimal parallel algorithm (Q1175643) (← links)
• A unified approach to parallel depth-first traversals of general trees (Q1178197) (← links)
• Fast algorithms for lowest common ancestors on a processor array with reconfigurable buses (Q1183475) (← links)
• Breadth-first traversal of trees and integer sorting in parallel (Q1186572) (← links)
• An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model (Q1195857) (← links)
• Efficient parallel algorithms for shortest paths in planar digraphs (Q1196454) (← links)
• An optimal parallel algorithm for computing furthest neighbors in a tree (Q1205722) (← links)
• Optimal parallel algorithms on circular-arc graphs (Q1263980) (← links)
• A nearly parallel algorithm for the Voronoi diagram of a convex polygon (Q1269914) (← links)
• An optimal parallel algorithm for node ranking of cographs (Q1270781) (← links)
• Sorting in linear time? (Q1273863) (← links)
• More general parallel tree contraction: Register allocation and broadcasting in a tree (Q1274316) (← links)
• Parallel construction and query of index data structures for pattern matching on square matrices (Q1288531) (← links)
• A simple optimal parallel algorithm for the minimum coloring problem on interval graphs (Q1313723) (← links)
• Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems (Q1351004) (← links)
• Parallel evaluation of arithmetic circuits (Q1365929) (← links)
• Efficient massively parallel implementation of some combinatorial algorithms (Q1365935) (← links)
• Exploiting few inversions when sorting: Sequential and parallel algorithms (Q1365941) (← links)
• A time-optimal solution for the path cover problem on cographs. (Q1401176) (← links)
• Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree (Q1816995) (← links)
• Parallel algorithms for arrangements (Q1907232) (← links)
• Optimal computation of shortest paths on doubly convex bipartite graphs (Q1963107) (← links)
• Data independence of read, write, and control structures in PRAM computations (Q1975968) (← links)
• Optimal parallel algorithms for multiple updates of minimum spanning trees (Q2366226) (← links)
• Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models (Q2375302) (← links)
• A note on the 1-maximal elements problem (Q4297203) (← links)
• Optimal parallel colouring algorithms for totally decomposable graphs (Q4323714) (← links)
• Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases (Q4508634) (← links)
• Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree^∗ (Q4511611) (← links)
• Efficient parallel graph algorithms for coarse grained multicomputers and BSP (Q4571970) (← links)
• THE OPTIMAL LOCATION OF A STRUCTURED FACILITY IN A TREE NETWORK (Q4819980) (← links)
• AN EFFICIENT EREW ALGORITHM FOR MINIMUM PATH COVER AND HAMILTONICITY ON COGRAPHS (Q4819984) (← links)
• AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗ (Q4820048) (← links)
• A COST-OPTIMAL EREW BREADTH-FIRST ALGORITHM FOR ORDERED TREES, WITH APPLICATIONS∗ (Q4820078) (← links)
• THE MAXIMUM WEIGHT PERFECT MATCHING PROBLEM FOR COMPLETE WEIGHTED GRAPHS IS IN PC∗† (Q4820105) (← links)
• <i>o</i>(log⁴ <i>n</i>) time parallel maximal matching algorithm using linear number of processors (Q4826117) (← links)
• (Q4953331) (← links)
• A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon (Q5056167) (← links)
• TIME AND ENERGY OPTIMAL LIST RANKING ALGORITHMS ON THE k-CHANNEL BROADCAST COMMUNICATION MODEL WITH NO COLLISION DETECTION (Q5696966) (← links)
• Deterministic parallel backtrack search (Q5958310) (← links)
• StUSPACE(log n) ⊂-DSPACE(log2 n/log log n) (Q6487439) (← links)