Bounds to Complexities of Networks for Sorting and for Switching

Cited in

(41)

A NEW FM SCREENING METHOD TO GENERATE CLUSTER-DOT BINARY IMAGES USING THE LOCAL EXHAUSTIVE SEARCH WITH FPGA ACCELERATION
A parallel sorting scheme whose basic operation sortsN elements
ERCW PRAMs and optical communication
Exact learning of DNF formulas using DNF hypotheses
Upper bounds on the multiplicative complexity of symmetric Boolean functions
EFFICIENT HARDWARE ALGORITHMS FOR N CHOOSE K COUNTERS USING THE BITONIC MERGER
Parallel circle-cover algorithms
Fast integer merging on the EREW PRAM
Some subclasses of context-free languages in NC^ 1
On the depth complexity of formulas
On the combinational complexity of certain symmetric Boolean functions
New Bounds on Optimal Sorting Networks
Parallel algorithms on circular-arc graphs
scientific article; zbMATH DE number 125469 (Why is no real title available?)
Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case
Fast pseudorandom functions based on expander graphs
Integer summing algorithms on reconfigurable meshes
The Complexity of Sorting with Networks of Stacks and Queues
A unified \(O(\log N)\) and optimal sorting vector algorithm
A simple nc recognition algorithm for welsh-powell opposition graphs
Some parallel algorithms on interval graphs
FM SCREENING BY THE LOCAL EXHAUSTIVE SEARCH, WITH HARDWARE ACCELERATION
On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
Two-coloring linked lists is NC\(^ 1\)-complete for logarithmic space
scientific article; zbMATH DE number 4145830 (Why is no real title available?)
Some classes of languages in \(NC^ 1\)
On networks with order close to the Moore bound
An introduction to parallelism in combinatorial optimization
Parallel restructuring and evaluation of expressions
Optimal procedures and complexity analyses of nonserial converging branch networks
The complexity of computing symmetric functions using threshold circuits
Bounds on the size of test sets for sorting and related networks
Efficient monotone circuits for threshold functions
A super-logarithmic lower bound for hypercubic sorting networks
Linear-size constant-depth polylog-threshold circuits
Parallel Generation of ℓ-Sequences
A new parallel sorting algorithm based upon min-mid-max operations
New lower bound techniques for VLSI
The complexity of contract negotiation
A VLSI algorithm for sorting variable-length character strings
Two-way automata and length-preserving homomorphisms

This page was built for publication: Bounds to Complexities of Networks for Sorting and for Switching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4101728)