The Art of Computer Programming Volumes 1-3 Boxed Set
The Art of Computer Programming Volumes 1-3 Boxed Set
On non-linear lower bounds in computational complexity
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
A taxonomy of parallel sorting
ACM Computing Surveys (CSUR)
Optimal parallel generation of a computation tree form
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
A logarithmic time sort for linear size networks
Journal of the ACM (JACM)
How to share memory in a distributed system
Journal of the ACM (JACM)
Continuous routing and batch routing on the hypercube
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Deterministic selection in O(loglog N) parallel time
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
An optimal sorting algorithm for mesh connected computers
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
On the expected behavior of disjoint set union algorithms
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Towards a theory of software protection and simulation by oblivious RAMs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Constructing disjoint paths on expander graphs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Towards a theory of software protection
Proceedings on Advances in cryptology---CRYPTO '86
Monotone circuits for connectivity require super-logarithmic depth
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Parallel Sorting in Two-Dimensional VLSI Models of Computation
IEEE Transactions on Computers
The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI
IEEE Transactions on Computers
On communication latency in PRAM computations
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
A lower bound on the size of shellsort networks
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
On the method of approximations
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
An O(logN) deterministic packet routing scheme
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Quasi-Valid range querying and its implications for nearest neighbor problems
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Scans as Primitive Parallel Operations
IEEE Transactions on Computers
A computer assisted optimal depth lower bound for sorting networks with nine inputs
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
The periodic balanced sorting network
Journal of the ACM (JACM)
Fast, Deterministic Routing, on Hypercubes, Using Small Buffers
IEEE Transactions on Computers
Asynchronous shared memory parallel computation
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Every robust CRCW PRAM can efficiently simulate a PRIORITY PRAM
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Space-efficient representations of shared data for parallel computers
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
On-line algorithms for path selection in a nonblocking network
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Efficient computation on oblivious RAMs
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Counting networks and multi-processor coordination
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Time-Space Optimal Parallel Merging and Sorting
IEEE Transactions on Computers
Optimal VLSI Sorting with Reduced Number of Processors
IEEE Transactions on Computers
Asynchronous shared memory parallel computation (preliminary version)
ACM SIGARCH Computer Architecture News - Symposium on parallel algorithms and architectures
Optimal bounded-degree VLSI networks for sorting in a constant number of rounds
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Efficient sequential and parallel algorithms for computing recovery points in trees and paths
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
On parallel complexity of integer linear programming, GCD and the iterated mod function
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Improved parallel integer sorting without concurrent writing
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Optimal routing of parentheses on the hypercube
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Supporting the hypercube programming model on mesh architectures: (a fast sorter for iWarp tori)
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
A survey of adaptive sorting algorithms
ACM Computing Surveys (CSUR)
An O(log N) deterministic packet-routing scheme
Journal of the ACM (JACM)
Self-routing superconcentrators
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Fast Self-Routing Permutation Switching on an Asymptotically Minimum Cost Network
IEEE Transactions on Computers
Journal of the ACM (JACM)
On the complexity of negation-limited Boolean networks
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Optimal parallel string algorithms: sorting, merging and computing the minimum
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Greed sort: optimal deterministic sorting on parallel disks
Journal of the ACM (JACM)
An efficient and fast parallel-connected component algorithm
Journal of the ACM (JACM)
On probabilistic networks for selection, merging, and sorting
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Incremental cryptography and application to virus protection
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Symmetric logspace is closed under complement
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
More on the complexity of negation-limited circuits
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
IEEE Transactions on Parallel and Distributed Systems
Software protection and simulation on oblivious RAMs
Journal of the ACM (JACM)
Bounds on the separation of two parallel disk models
Proceedings of the fourth workshop on I/O in parallel and distributed systems: part of the federated computing research conference
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
IEEE Transactions on Computers
An Efficient Sorting Algorithm on the Multi-Mesh Network
IEEE Transactions on Computers
Further algorithmic aspects of the local lemma
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A framework for simple sorting algorithms on parallel disk systems (extended abstract)
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Compact grid layouts of multi-level networks
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Communication-processor tradeoffs in limited resources PRAM
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Depth optimal sorting networks resistant to k passive faults
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Existence of multiplicative secret sharing schemes with polynomial share expansion
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
The de Bruijn multiprocessor network: a versatile sorting network
ISCA '85 Proceedings of the 12th annual international symposium on Computer architecture
Minimizing Communication in the Bitonic Sort
IEEE Transactions on Parallel and Distributed Systems
Periodic, random-fault-tolerant correction networks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems
IEEE Transactions on Parallel and Distributed Systems
A note on constructing binary heaps with periodic networks
Information Processing Letters
Rearrangeable Three-Stage Interconnection Networks and Their Routing Properties
IEEE Transactions on Computers
An Optimal Implementation of Broadcasting with Selective Reduction
IEEE Transactions on Parallel and Distributed Systems
Algorithms and Average Time Bounds of Sorting on a Mesh-Connected Computer
IEEE Transactions on Parallel and Distributed Systems
Partitioning Message Patterns for Bundled Omega Networks
IEEE Transactions on Parallel and Distributed Systems
A Randomized Sorting Algorithm on the BSP model
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Efficient Computation of Recurrence Diameters
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Noncryptographic Selection Protocols
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
A minimum area VLSI network for O(logn) time sorting
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Tight bounds on the complexity of parallel sorting
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
On k-hulls and related problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Emulations between QSM, BSP and LogP: a framework for general-purpose parallel algorithm design
Journal of Parallel and Distributed Computing
Partially effective randomization in simulations between arbitrary and common PRAMs
Journal of Parallel and Distributed Computing
The zero-one principle for switching networks
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Counting networks with arbitrary fan-out
Distributed Computing
Atomic snapshots using lattice agreement
Distributed Computing
Monotone circuits for monotone weighted threshold functions
Information Processing Letters
Inferring a level-1 phylogenetic network from a dense set of rooted triplets
Theoretical Computer Science - Computing and combinatorics
The VLSI Complexity of Sorting
IEEE Transactions on Computers
The average complexity of deterministic and randomized parallel comparison sorting algorithms
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
The complexity of parallel comparison merging
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Deterministic Graphical Games Revisited
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
PBS: Private Bartering Systems
Financial Cryptography and Data Security
The unpredictable deviousness of models
Theoretical Computer Science
Reductions for monotone Boolean circuits
Theoretical Computer Science
Implementing Sorting Networks with Spiking Neural P Systems
Fundamenta Informaticae
Linear-size log-depth negation-limited inverter for k-tonic binary sequences
Theoretical Computer Science
Boolean circuit programming: A new paradigm to design parallel algorithms
Journal of Discrete Algorithms
A hardware architecture for real-time video segmentation utilizing memory reduction techniques
IEEE Transactions on Circuits and Systems for Video Technology
Computers and Electrical Engineering
Evolving compare-exchange networks using grammars
Artificial Life
Storage coding for wear leveling in flash memories
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Monotone circuits for monotone weighted threshold functions
Information Processing Letters
Linear-size log-depth negation-limited inverter for k-tonic binary sequences
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Data transmission and base-station placement for optimizing network lifetime
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Storage coding for wear leveling in flash memories
IEEE Transactions on Information Theory
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
GPU-ABiSort: optimal parallel sorting on stream architectures
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Bitonic sort in shared SIMD array processor
Proceedings of the 2011 International Conference on Communication, Computing & Security
Perfectly secure oblivious RAM without random oracles
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Optimal-time adaptive strong renaming, with applications to counting
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The round complexity of distributed sorting: extended abstract
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Practical Oblivious Outsourced Storage
ACM Transactions on Information and System Security (TISSEC)
Generic fully simulatable adaptive oblivious transfer
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Basic facts about expander graphs
Studies in complexity and cryptography
Privacy-preserving group data access via stateless oblivious RAM simulation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The VLDB Journal — The International Journal on Very Large Data Bases
On the negation-limited circuit complexity of sorting and inverting k-tonic sequences
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Reductions for monotone boolean circuits
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Hiding circuit topology from unbounded reverse engineers
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
On derandomization and average-case complexity of monotone functions
Theoretical Computer Science
Computer generation of streaming sorting networks
Proceedings of the 49th Annual Design Automation Conference
Computing a proper equilibrium of a bimatrix game
Proceedings of the 13th ACM Conference on Electronic Commerce
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Implementing Sorting Networks with Spiking Neural P Systems
Fundamenta Informaticae
Reliable Minimum Finding Comparator Networks
Fundamenta Informaticae
Single round access privacy on outsourced storage
Proceedings of the 2012 ACM conference on Computer and communications security
An O(log N) parallel time exact hidden-line algorithm
EGGH'87 Proceedings of the Second Eurographics conference on Advances in Computer Graphics Hardware
Distributed oblivious RAM for secure two-party computation
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Practically efficient multi-party sorting protocols from comparison sort algorithms
ICISC'12 Proceedings of the 15th international conference on Information Security and Cryptology
Privacy-preserving matrix factorization
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Sparse suffix tree construction in small space
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
McBits: fast constant-time code-based cryptography
CHES'13 Proceedings of the 15th international conference on Cryptographic Hardware and Embedded Systems
Register level sort algorithm on multi-core SIMD processors
IA^3 '13 Proceedings of the 3rd Workshop on Irregular Applications: Architectures and Algorithms
Journal of Computer and System Sciences
On Probabilistic Networks for Selection, Merging, and Sorting
Theory of Computing Systems
| Hi-index | 0.10 |
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 (&egr;-halving) and a derived procedure (&egr;-nearsort) are described below, and our sorting network will be centered around these elementary steps.