Pages that link to "Item:Q4101728"
From MaRDI portal
The following pages link to Bounds to Complexities of Networks for Sorting and for Switching (Q4101728):
Displaying 33 items.
- Some classes of languages in \(NC^ 1\) (Q756426) (← links)
- A new parallel sorting algorithm based upon min-mid-max operations (Q795507) (← links)
- An introduction to parallelism in combinatorial optimization (Q1076605) (← links)
- A VLSI algorithm for sorting variable-length character strings (Q1079374) (← links)
- Some parallel algorithms on interval graphs (Q1098312) (← links)
- Parallel circle-cover algorithms (Q1108792) (← links)
- Some subclasses of context-free languages in \(NC^ 1\) (Q1112610) (← links)
- Efficient monotone circuits for threshold functions (Q1122560) (← links)
- Integer summing algorithms on reconfigurable meshes (Q1128663) (← links)
- ERCW PRAMs and optical communication (Q1128717) (← links)
- Linear-size constant-depth polylog-threshold circuits (Q1182085) (← links)
- Parallel restructuring and evaluation of expressions (Q1185242) (← links)
- The complexity of computing symmetric functions using threshold circuits (Q1193637) (← links)
- Two-coloring linked lists is NC\(^ 1\)-complete for logarithmic space (Q1318772) (← links)
- A unified \(O(\log N)\) and optimal sorting vector algorithm (Q1907067) (← links)
- On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\). (Q1978699) (← links)
- Upper bounds on the multiplicative complexity of symmetric Boolean functions (Q2179499) (← links)
- Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case (Q2275907) (← links)
- Fast integer merging on the EREW PRAM (Q2365176) (← links)
- The complexity of contract negotiation (Q2457671) (← links)
- Fast Pseudorandom Functions Based on Expander Graphs (Q3179351) (← links)
- EFFICIENT HARDWARE ALGORITHMS FOR <font>N</font> CHOOSE <font>K</font> COUNTERS USING THE BITONIC MERGER (Q3444843) (← links)
- Parallel Generation of ℓ-Sequences (Q3600451) (← links)
- A NEW FM SCREENING METHOD TO GENERATE CLUSTER-DOT BINARY IMAGES USING THE LOCAL EXHAUSTIVE SEARCH WITH FPGA ACCELERATION (Q3606554) (← links)
- A parallel sorting scheme whose basic operation sortsN elements (Q3738572) (← links)
- On the depth complexity of formulas (Q3890111) (← links)
- New lower bound techniques for VLSI (Q3950484) (← links)
- A simple nc recognition algorithm for welsh-powell opposition graphs (Q3989765) (← links)
- On the combinational complexity of certain symmetric Boolean functions (Q4146674) (← links)
- FM SCREENING BY THE LOCAL EXHAUSTIVE SEARCH, WITH HARDWARE ACCELERATION (Q4675882) (← links)
- Two-way automata and length-preserving homomorphisms (Q4879206) (← links)
- Parallel algorithms on circular-arc graphs (Q5899761) (← links)
- Exact learning of DNF formulas using DNF hypotheses (Q5916223) (← links)
