Parallel Merge Sort
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Serial and parallel algorithms for order-preserving pattern matching based on the duel-and-sweep paradigm
- Exploiting few inversions when sorting: Sequential and parallel algorithms
- Parallel construction of quadtrees and quality triangulations
- Communication complexity of PRAMs
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree
- Parallel algorithms for separable permutations
- Parallel search algorithms for graphs and trees
- Minimizing Distance-to-Sight in Polygonal Domains
- SCHEDULING INTERVAL ORDERS IN PARALLEL
- A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms
- An efficient parallel algorithm for the single function coarsest partition problem
- Parallel and serial heuristics for the minimum set cover problem
- Sorting roughly sorted sequences in parallel
- Efficient parallel k selection algorithm
- Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph
- Parallel rectilinear shortest paths with rectangular obstacles
- On parallel complexity of maximum \(f\)-matching and the degree sequence problem
- A new graph triconnectivity algorithm and its parallelization
- Optimal edge ranking of trees in polynomial time
- scientific article; zbMATH DE number 1760030 (Why is no real title available?)
- Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
- Optimal parallel algorithms for point-set and polygon problems
- Parallel algorithms for the segment dragging problem
- Efficient parallel algorithms for doubly convex-bipartite graphs
- Line-segment intersection reporting in parallel
- Parallel integer sorting using small operations
- A parallel circle-cover minimization algorithm
- Efficient parallel graph algorithms for coarse grained multicomputers and BSP
- The autonomous data language -- concepts, design and formal verification
- Approximate algorithms for the Knapsack problem on parallel computers
- o(log4 n) time parallel maximal matching algorithm using linear number of processors
- The \((1 | 1)\)-centroid problem in the plane with distance constraints
- An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model
- A simple parallel algorithm for computing the diameters of all vertices in a tree and its application
- Retrieval of scattered information by EREW, CREW and CRCW PRAMs
- Two-variable linear programming in parallel
- Parallel merge sort using comparison matrices. II
- An efficient parallel algorithm for scheduling interval ordered tasks
- Probabilistic integer sorting
- On the planar piecewise quadratic 1-center problem
- On the Average Running Time of Odd–Even Merge Sort
- PRAM's towards realistic parallelism: BRAM's
- Parametric search made practical
- The onion diagram: a Voronoi-like tessellation of a planar line space and its applications
- Fast sequential and parallel algorithms for finding extremal sets
- Constructing the Voronoi diagram of a set of line segments in parallel
- The parallel neighbour sort and 2-way merge algorithm
- Matching parentheses in parallel
- Engineering parallel string sorting
- Efficient parallel recognition of some circular arc graphs. I
- Parallel comparison merging of many-ordered lists
- An optimal parallel algorithm for merging using multiselection
- Simple randomized mergesort on parallel disks
- Efficient piecewise-linear function approximation using the uniform metric
- Parallel Weighted Random Sampling
- Fast parallel algorithms for the maximum empty rectangle problem.
- Parallel algorithms for red--black trees
- Computing with spikes: the advantage of fine-grained timing
- scientific article; zbMATH DE number 2087747 (Why is no real title available?)
- A compact data structure and parallel algorithms for permutation graphs
- A simple randomized parallel algorithm for maximal f-matchings
- Parallel interval order recognition and construction of interval representations
- More general parallel tree contraction: register allocation and broadcasting in a tree
- Parallel time and space upper-bounds for the subset-sum problem
- Parallel preprocessing for path queries without concurrent reading.
- Improved deterministic parallel integer sorting
- An adaptive algorithm for maximization of non-submodular function with a matroid constraint
- On similarity of polynomial configurations
- Efficient parallel term matching and anti-unification
- A parallel algorithm to construct a dominance graph on nonoverlapping rectangles
- Testing a simple polygon for monotonicity optimally in parallel
- Cost-sensitive active learning with a label uniform distribution model
- Parallel heap: an optimal parallel priority queue
- On the average running time of odd-even merge sort
- Removing randomness in parallel computation without a processor penalty
- Parallel multiple search
- Parallel algorithms for merging and sorting
- Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems
- Parallel \(N\)-free order recognition
- Planar stage graphs: Characterizations and applications
- Two-variable linear programming in parallel
- Fragile complexity of comparison-based algorithms
- On parallel integer sorting
- Computing Prüfer codes efficiently in parallel
- Efficient parallel algorithm to compute a doubly perfect elimination ordering of a doubly chordal graph
- Parallel priority queues
- A centroid labelling technique and its application to path selection in trees
- A parallel algorithm for approximate regularity.
- Selecting small ranks in EREW PRAM
- Optimal parallel time bounds for the maximum clique problem on intervals
- An optimal parallel algorithm for the minimum circle-cover problem
- Assigning weights to minimize the covering radius in the plane
- Controlling the spread of infectious diseases by using random walk method to remove many important links
- Constructing arrangements optimally in parallel
- A Pictorial Description of Cole’s Parallel Merge Sort
- Fast integer merging on the EREW PRAM
- On parallel rectilinear obstacle-avoiding paths
- An improved reliability bound of a probabilistic parallel integer sorting algorithm
- Dominance made simple
- Fast sequential and parallel algorithms for finding the largest rectangle separating two sets
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)
