Proceedings ArticleDOI
An 0(n log n) sorting network
Miklós Ajtai,János Komlós,Endre Szemerédi +2 more
- pp 1-9
Reads0
Chats0
TLDR
A sorting network of size 0(n log n) and depth 0(log n) is described, and a derived procedure (&egr;-nearsort) are described below, and the sorting network will be centered around these elementary steps.Abstract:
The purpose of this paper is to describe a sorting network of size 0(n log n) and depth 0(log n). A natural way of sorting is through consecutive halvings: determine the upper and lower halves of the set, proceed similarly within the halves, and so on. Unfortunately, while one can halve a set using only 0(n) comparisons, this cannot be done in less than log n (parallel) time, and it is known that a halving network needs (½)n log n comparisons. It is possible, however, to construct a network of 0(n) comparisons which halves in constant time with high accuracy. This procedure (e-halving) and a derived procedure (e-nearsort) are described below, and our sorting network will be centered around these elementary steps.read more
Citations
More filters
Proceedings ArticleDOI
Ultra-fast expected time parallel algorithms
TL;DR: An Arbitrary CRCW PRAM algorithm is presented to solve the Closest Pair problem in constant expected time with n processors regardless of the distribution of points, and similar techniques are used to solve some computational geometry problems with the same processor and time bounds.
Proceedings Article
Time-Space Optimal Parallel Merging and Sorting.
Xiaojun Guan,Michael A. Langston +1 more
TL;DR: The authors present a parallel merging algorithm that, on an exclusive-read exclusive-write (EREW) parallel random-access machine (PRAM) with k processors merges two sorted lists of total length n in O(n/k+log n) time and constant extra space per processor, and hence is time-space optimal for any value of k.
Journal ArticleDOI
Resource Oblivious Sorting on Multicores
Richard Cole,Vijaya Ramachandran +1 more
TL;DR: In this paper, the authors present a deterministic sorting algorithm, SPMS (Sample, Partition, and Merge Sort), that interleaves the partitioning of a sample sort with merging.
Posted Content
Efficient implementation of Quantum circuits with limited qubit interactions
TL;DR: This work provides an interaction graph together with an efficient method for compiling quantum circuits so that gates are applied only locally and enables the network to emulate a single monolithic device with minimal overhead.
Posted Content
Beyond the Birkhoff Polytope: Convex Relaxations for Vector Permutation Problems
Cong Han Lim,Stephen J. Wright +1 more
TL;DR: In this article, the authors use the Birkhoff-the-shelf permutahedron formulation of the 2-SUM problem to reduce the number of variables and constraints.
References
More filters
Proceedings ArticleDOI
Sorting networks and their applications
TL;DR: To achieve high throughput rates today's computers perform several operations simultaneously; not only are I/O operations performed concurrently with computing, but also, in multiprocessors, several computing operations are done concurrently.
Journal ArticleDOI
Space bounds for a game on graphs
TL;DR: It is shown that for each graph withn vertices and maximum in-degreed, there is a pebbling strategy which requires at mostc(d) n/logn pebbles, and this bound is tight to within a constant factor.
Proceedings ArticleDOI
Explicit constructions of linear size superconcentrators
Ofer Gabber,Zvi Galil +1 more
TL;DR: An explicit construction of an infinite family of N-superconcentrators of density 44 of the most economical previously known explicit graphs of this type is presented.
Proceedings ArticleDOI
On non-linear lower bounds in computational complexity
TL;DR: It is shown that the graph of any algorithm for any one of a number of arithmetic problems (e.g. polynomial multiplication, discrete Fourier transforms, matrix multiplication) must have properties closely related to concentration networks.