scientific article; zbMATH DE number 1142304

MaRDI QIDQ4385520zbMATH OpenFDO

Authors Nicholas Pippenger

Publication date 4 May 1998

zbMATH Keywords

depth \(O(\log n)\)minimumdepthnumber of edgessorting network

Mathematics Subject Classification ID

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

Cited in

(12)

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

This page was built for publication:

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