scientific article; zbMATH DE number 1559553

zbMATH Open0974.68011MaRDI QIDQ4527005FDOQ4527005

Martin Dietzfelbinger

Publication date: 28 February 2001

Title of this publication is not available (Why is that?)

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

Mathematics Subject Classification ID

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

Cited In (7)

• Two absolute bounds for distributed bit complexity
• Title not available (Why is that?)
• Fault-tolerant embedding of paths in crossed cubes
• Mathematical Foundations of Computer Science 2005
• Edge-pancyclicity and path-embeddability of bijective connection graphs
• Communication vs. computation
• Exact communication costs for consensus and leader in a tree

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)