An introductory course on communication complexity

MaRDI QIDQ3527016zbMATH OpenFDO

Authors Carsten Damm

Publication date 25 September 2008

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14)

Recommendations

• Communication complexity
• Communication Complexity
• Information complexity and applications.
• Communication complexity (for algorithm designers)
• scientific article; zbMATH DE number 3881884

Cited in

(4)

• The advantages of a new approach to defining the communication complexity for VLSI
• Communication complexity (for algorithm designers)
• Co-compact Gabor systems on locally compact abelian groups
• The advantages of a new approach to defining the communication complexity for VLSI

This page was built for publication: An introductory course on communication complexity

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