Parallel Merge Sort
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- VPSPACE and a transfer theorem over the complex field
- Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
- The parallel neighbour sort and 2-way merge algorithm
- An optimal parallel algorithm for the minimum circle-cover problem
- The queue-read queue-write asynchronous PRAM model
- Improved deterministic parallel integer sorting
- An optimal parallel adaptive sorting algorithm
- Parallel priority queues
- Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs
- Parallel and serial heuristics for the minimum set cover problem
- Optimal parallel algorithms for point-set and polygon problems
- Parallel rectilinear shortest paths with rectangular obstacles
- Line-segment intersection reporting in parallel
- A new graph triconnectivity algorithm and its parallelization
- An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model
- Optimal parallel time bounds for the maximum clique problem on intervals
- Optimal parallel algorithms for finding cut vertices and bridges of interval graphs
- A simple parallel algorithm for computing the diameters of all vertices in a tree and its application
- An efficient parallel sorting algorithm
- Parallel search algorithms for graphs and trees
- Constructing the Voronoi diagram of a set of line segments in parallel
- Matching parentheses in parallel
- Efficient parallel recognition of some circular arc graphs. I
- Optimal parallel algorithms on circular-arc graphs
- Sorting in linear time?
- More general parallel tree contraction: Register allocation and broadcasting in a tree
- Modifying edges of a network to obtain short subgraphs
- On the complexity of the k-chain subgraph cover problem
- Parallel construction and query of index data structures for pattern matching on square matrices
- Removing randomness in parallel computation without a processor penalty
- A simple optimal parallel algorithm for the minimum coloring problem on interval graphs
- Queue-mergesort
- On parallel rectilinear obstacle-avoiding paths
- Parallel solutions to geometric problems in the scan model of computation
- Recognition algorithm for intersection graphs of edge disjoint paths in a tree
- Two-coloring linked lists is NC\(^ 1\)-complete for logarithmic space
- An optimal parallel algorithm for merging using multiselection
- A theorem on permutation graphs with applications
- An efficient parallel algorithm for the single function coarsest partition problem
- Parallel integer sorting using small operations
- Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM
- Improved parallel integer sorting without concurrent writing
- Sorting strings and constructing digital search trees in parallel
- Exploiting few inversions when sorting: Sequential and parallel algorithms
- Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems
- Simple randomized mergesort on parallel disks
- Planar stage graphs: Characterizations and applications
- Parallel \(N\)-free order recognition
- Computing Prüfer codes efficiently in parallel
- Selecting small ranks in EREW PRAM
- A parallel algorithm for approximate regularity.
- The geodesic 2-center problem in a simple polygon
- Cost-sensitive active learning with a label uniform distribution model
- On single-walk parallelization of the job shop problem solving algorithms
- Parallel algorithms for separable permutations
- Constructing arrangements optimally in parallel
- A parallel circle-cover minimization algorithm
- Parallel preprocessing for path queries without concurrent reading.
- Improving the efficiency of parallel minimum spanning tree algorithms
- Optimal edge ranking of trees in polynomial time
- A time-optimal parallel algorithm for three-dimensional convex hulls
- Retrieval of scattered information by EREW, CREW, and CRCW PRAMs
- Efficient piecewise-linear function approximation using the uniform metric
- Sweep methods for parallel computational geometry
- Parallel construction of binary trees with near optimal weighted path length
- A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms
- Parallel merge sort using comparison matrices. II
- An improved reliability bound of a probabilistic parallel integer sorting algorithm
- An adaptive algorithm for maximization of non-submodular function with a matroid constraint
- An elegant algorithm for the construction of suffix arrays
- Assigning weights to minimize the covering radius in the plane
- Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree
- On the planar piecewise quadratic 1-center problem
- Probabilistic integer sorting
- Efficient parallel algorithm to compute a doubly perfect elimination ordering of a doubly chordal graph
- Fast sequential and parallel algorithms for finding extremal sets
- EFFICIENT PARALLEL RANGE SEARCHING AND PARTITIONING ALGORITHMS*
- A randomized sorting algorithm on the BSP model
- A note on parallel complexity of maximum f-matching
- An optimal parallel algorithm for sorting multisets
- On the Average Running Time of Odd–Even Merge Sort
- Space-efficient parallel merging
- The \((1 | 1)\)-centroid problem in the plane with distance constraints
- Fast sequential and parallel algorithms for finding the largest rectangle separating two sets
- A Pictorial Description of Cole’s Parallel Merge Sort
- ON THE POWER OF SOME PRAM MODELS
- A note on the 1-maximal elements problem
- scientific article; zbMATH DE number 1760030 (Why is no real title available?)
- Efficient parallel graph algorithms for coarse grained multicomputers and BSP
- On the average running time of odd-even merge sort
- Optimal shooting: Characterizations and applications
- The onion diagram: a Voronoi-like tessellation of a planar line space and its applications
- PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS
- scientific article; zbMATH DE number 2087747 (Why is no real title available?)
- OPTIMAL PARALLEL PREPROCESSING ALGORITHMS FOR TESTING WEAK VISIBILITY OF POLYGONS FROM SEGMENTS
- AN EFFICIENT ALGORITHM FOR MANAGING A PARALLEL HEAP∗
- SCHEDULING INTERVAL ORDERS IN PARALLEL
- SORTING AND SELECTION ON DISTRIBUTED MEMORY BUS COMPUTERS
- o(log4 n) time parallel maximal matching algorithm using linear number of processors
This page was built for publication: Parallel Merge Sort
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3796769)
