scientific article; zbMATH DE number 1142304

zbMath0900.68252MaRDI QIDQ4385520

Nicholas J. Pippenger

Publication date: 4 May 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

number of edgessorting networkdepth \(O(\log n)\)minimumdepth

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (12)

Methods for message routing in parallel machines ⋮ Towards a better understanding of pure packet routing ⋮ Communication Lower Bounds via Critical Block Sensitivity ⋮ Construction of asymmetric connectors of depth two ⋮ Parallel selection ⋮ On the theory of interconnection networks for parallel computers ⋮ On shifting networks ⋮ Reductions for monotone Boolean circuits ⋮ Sorting networks of logarithmic depth, further simplified ⋮ Sorting in linear time? ⋮ Shallow grates ⋮ Solution of variable circuits by matrices.

This page was built for publication: