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 Article
Oblivious multi-party machine learning on trusted processors
Olga Ohrimenko,Felix Schuster,Cédric Fournet,Aastha Mehta,Sebastian Nowozin,Kapil Vaswani,Manuel Costa +6 more
TL;DR: This work proposes data-oblivious machine learning algorithms for support vector machines, matrix factorization, neural networks, decision trees, and k-means clustering and shows that their efficient implementation based on Intel Skylake processors scales up to large, realistic datasets, with overheads several orders of magnitude lower than with previous approaches.
Proceedings Article
Succinct non-interactive zero knowledge for a von Neumann architecture
TL;DR: A system that provides succinct noninteractive zero-knowledge proofs (zk-SNARKs) for program executions on a von Neumann RISC architecture and is the first to be universal: it does not need to know the program, but only a bound on its running time.
Proceedings ArticleDOI
Parallel tree contraction and its application
Gary L. Miller,John H. Reif +1 more
TL;DR: A bottom-up algorithm to handle trees which has two major advantages over the top-down approach: the control structure is straight forward and easier to implement facilitating new algorithms using fewer processors and less time; and problems for which it was too difficult or too complicated to find polylog parallel algorithms are now easy.
Journal ArticleDOI
Information theory and communication networks: an unconsummated union
Anthony Ephremides,Bruce Hajek +1 more
TL;DR: Several topics that are related to communication networks and that have an information-theoretic flavor are reviewed, including multiaccess protocols, timing channels, effective bandwidth of bursty data sources, deterministic constraints on datastreams, queuing theory, and switching networks.
Proceedings Article
Private Set Intersection: Are Garbled Circuits Better than Custom Protocols?
TL;DR: This paper develops three classes of protocols targeted to different set sizes and domains, all based on Yao's generic garbled-circuit method, and compares the performance of these protocols to the fastest custom PSI protocols in the literature.
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.