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
Journal ArticleDOI
On Probabilistic Networks for Selection, Merging, and Sorting
TL;DR: The study of comparator networks for selection, merging, and sorting that output the correct result with high probability, given a random input permutation proves tight bounds, up to constant factors, on the size and depth of probabilistic (n,k)-selection networks.
Book ChapterDOI
Locality-preserving oblivious RAM
TL;DR: Oblivious RAMs, introduced by Goldreich and Ostrovsky [JACM’96], compile any RAM program into one that is “memory oblivious”, i.e., the access pattern to the memory is independent of the input.
Proceedings ArticleDOI
An efficient counting network
Costas Busch,Marios Mavronicolas +1 more
TL;DR: This work presents an explicit, deterministic construction of a counting network with t input width and w output width, where t/spl les/w, t=2/sup k/ and w=p2/Sup l/ is practical and achieves depth O(lg/sup 2/ t) which is independent from the output width w.
Proceedings ArticleDOI
Efficient simulations of small shared memories on bounded degree networks
TL;DR: The problem of simulating a parallel random-access machine (PRAM) with n processors and memory size m>or=n on an n-node bounded degree network (BDN) is considered, and a deterministic solution to the simulation problem is presented.
Journal ArticleDOI
Secure multi-party computation in large networks
TL;DR: In this article, scalable protocols for solving the secure multi-party computation (MPC) problem among a significant number of parties are presented. But the authors do not consider the security of MPC in the synchronous setting.
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.