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
Sorting roughly sorted sequences in parallel
Tom Altman,B. S. Chelbus +1 more
TL;DR: An algorithm using n processors to sort n keys in time O(log k), where k≤n is the radius of the input sequence.
Journal Article
Fast Pseudorandom Functions Based on Expander Graphs.
Benny Applebaum,Pavel Raykov +1 more
TL;DR: A new family of highly efficient hash functions whose output on exponentially many inputs jointly forms with high probability a good expander graph is presented, based on the techniques of Miles and Viola Crypto 2012.
Journal ArticleDOI
An efficient multiway merging algorithm
TL;DR: The aim of this algorithm is to mergek sorted lists, withm keys of each, into one, wherek can be any integer, and the merging process uses onlyk sorters instead of 2 sorters.
Posted Content
Publicly Auditable Secure Multi-Party Computation.
TL;DR: In this article, the concept of publicly auditable secure computation was formalized and an enhanced version of the SPDZ protocol where, even if all the servers are corrupted, anyone with access to the transcript of the protocol can check that the output is indeed correct.
Journal ArticleDOI
Load Sharing with Parallel Priority Queues
TL;DR: A simple parallel priority queue architecture for load sharing in a p-processor multiprocessor system is proposed, which achieves delay O(log p), which is optimal for any bounded degree system.
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.