scientific article; zbMATH DE number 1559553

MaRDI QIDQ4527005zbMATH OpenFDO

Authors Martin Dietzfelbinger

Publication date 28 February 2001

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The linear-array conjecture in communication complexity is false
• scientific article; zbMATH DE number 1011685
• scientific article; zbMATH DE number 1256713
• Fractional Covers and Communication Complexity
• Lower bounds on communication complexity

Cited in

(12)

• The linear-array conjecture in communication complexity is false
• Exact communication costs for consensus and leader in a tree
• Two absolute bounds for distributed bit complexity
• Edge-pancyclicity and path-embeddability of bijective connection graphs
• Communication vs. computation
• Tribes is hard in the message passing model
• The hardness of median in the synchronized bit communication model
• scientific article; zbMATH DE number 176553 (Why is no real title available?)
• scientific article; zbMATH DE number 1256713 (Why is no real title available?)
• Fractional Covers and Communication Complexity
• Mathematical Foundations of Computer Science 2005
• Fault-tolerant embedding of paths in crossed cubes

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 Q4527005)