Pages that link to "Item:Q3906428"

The following pages link to Finding the maximum, merging, and sorting in a parallel computation model (Q3906428):

Displaying 50 items.

• A faster parallel algorithm for \(k\)-connectivity (Q287014) (← links)
• Transforming comparison model lower bounds to the parallel-random-access-machine (Q287050) (← links)
• Efficient dynamic range minimum query (Q507385) (← links)
• Algorithms for some graph problems on a distributed computational model (Q580985) (← links)
• Finding the upper envelope of n line segments in O(n log n) time (Q582095) (← links)
• Optimal merging and sorting on the EREW PRAM (Q582111) (← links)
• Optimal parallel algorithms for computing convex hulls and for sorting (Q594601) (← links)
• Integer merging on EREW PRAM (Q644851) (← links)
• Relating the power of the multiple associative computing (MASC) model to that of reconfigurable bus-based models (Q666096) (← links)
• Fast parallel string prefix-matching (Q674342) (← links)
• Parallel algorithms for merging and sorting (Q751797) (← links)
• Resource bounds for parallel computation of threshold and symmetric functions (Q751804) (← links)
• A new parallel sorting algorithm based upon min-mid-max operations (Q795507) (← links)
• A parallel-design distributed-implementation (PDDI) general-purpose computer (Q797283) (← links)
• An optimal parallel connectivity algorithm (Q797997) (← links)
• Parallel algorithms for matrix polynomial division (Q805151) (← links)
• On parallel integer sorting (Q805234) (← links)
• Parallel comparison merging of many-ordered lists (Q807015) (← links)
• Parallel comparison algorithms for approximation problems (Q808727) (← links)
• A sublogarithmic convex hull algorithm (Q911280) (← links)
• An optimal parallel algorithm for linear programming in the plane (Q915450) (← links)
• Incomparability in parallel computation (Q919822) (← links)
• Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm (Q919827) (← links)
• Parallel merging with restriction (Q1009355) (← links)
• A note on the ''parallel computation thesis'' (Q1056537) (← links)
• Routing, merging, and sorting on parallel models of computation (Q1082818) (← links)
• Unbounded fan-in circuits and associative functions (Q1083202) (← links)
• Prallel algorithms for analyzing activity networks (Q1090459) (← links)
• Separation and lower bounds for ROM and nondeterministic models of parallel computation (Q1098633) (← links)
• An optimal speed-up parallel algorithm for triangulating simplicial point sets in space (Q1100900) (← links)
• On the time required to sum n semigroup elements on a parallel machine with simultaneous writes (Q1101213) (← links)
• Fast parallel graph searching with applications (Q1103409) (← links)
• A parallel algorithm for bisection width in trees (Q1103410) (← links)
• Simulations among concurrent-write PRAMs (Q1104097) (← links)
• Parallel construction of a suffix tree with applications (Q1104104) (← links)
• Parallel computation with threshold functions (Q1107324) (← links)
• An improved simulation of space and reversal bounded deterministic Turing machines by width and depth bounded uniform circuits (Q1108006) (← links)
• A parallel bucket sort (Q1108803) (← links)
• A linear-processor algorithm for depth-first search in planar graphs (Q1110342) (← links)
• A parallel algorithm for recognizing unordered depth-first search (Q1111396) (← links)
• The average performance of a parallel stable mariage algorithm (Q1123623) (← links)
• Hybridsort revisited and parallelized (Q1123628) (← links)
• Parallel computation and conflicts in memory access (Q1171382) (← links)
• Processor-time tradeoffs in PRAM simulations (Q1185246) (← links)
• Expected parallel time and sequential space complexity of graph and digraph problems (Q1186789) (← links)
• Optimal parallel algorithms for point-set and polygon problems (Q1187196) (← links)
• Parallel rectilinear shortest paths with rectangular obstacles (Q1190293) (← links)
• Optimal parallel time bounds for the maximum clique problem on intervals (Q1198058) (← links)
• Tight complexity bounds for term matching problems (Q1201724) (← links)
• Parallel methods for visibility and shortest-path problems in simple polygons (Q1201749) (← links)