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
Boolean circuit programming: A new paradigm to design parallel algorithms
TL;DR: Through example codes, it is shown that the description language is a convenient tool to design parallel algorithms due to its general iterative and recursive structures and the ease of modular design.
Proceedings ArticleDOI
Data Oblivious Algorithms for Multicores
Vijaya Ramachandran,Elaine Shi +1 more
TL;DR: A data-oblivious algorithm is an algorithm whose memory access pattern is independent of the input values as discussed by the authors, which is a generalization of the data oblivious algorithm for the binary fork-join model of computation.
Journal Article
Probabilistically checkable proofs with low amortized query complexity
Madhu Sudan,Luca Trevisan +1 more
TL;DR: In this article, the error probability of Probabilistically checkable proof (PCP) systems can be made exponentially small in the number of queries by using sequential repetition, and it is shown that unless P=NP, no such characterization is possible using 1 amortized query bits.
Rethinking Lipschitz Neural Networks for Certified L-infinity Robustness
TL;DR: The results identify that networks built upon norm-bounded affine layers and Lipschitz activations intrinsically lose expressive power even in the two-dimensional case, and shed light on how recently proposed LPschitz networks bypass these impossibilities by leveraging order statistic functions.
Book ChapterDOI
On the Power of Nonconservative PRAM
Anders Dessmark,Andrzej Lingas +1 more
TL;DR: An alternative simple method of exploiting word parallelism in a nonconservative RAM and PRAM model is considered and improved bounds for parallel integer sorting are obtained.
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.