Parallel Merge Sort
From MaRDI portal
Publication:3796769
DOI10.1137/0217049zbMath0651.68077WikidataQ56057496 ScholiaQ56057496MaRDI QIDQ3796769
Publication date: 1988
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0217049
DB lookup for MSC labels failed
Related Items
A note on the 1-maximal elements problem, Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph, Learning nested concept classes with limited storage, Optimal parallel suffix tree construction, Efficient parallel algorithms for doubly convex-bipartite graphs, A simple randomized parallel algorithm for maximal f-matchings, Parallel interval order recognition and construction of interval representations, Geometric pattern matching under Euclidean motion, On similarity of polynomial configurations, Testing a simple polygon for monotonicity optimally in parallel, Efficient parallel term matching and anti-unification, A parallel algorithm to construct a dominance graph on nonoverlapping rectangles, 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, 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, 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, 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, Planar stage graphs: Characterizations and applications, Parallel \(N\)-free order recognition, Computing Prüfer codes efficiently in parallel, Constructing arrangements optimally in parallel, 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 algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs, Space-efficient parallel merging, ON THE POWER OF SOME PRAM MODELS
