scientific article; zbMATH DE number 1361468

zbMATH Open0941.68090MaRDI QIDQ4699286FDOQ4699286

Authors Juraj Hromkovič, Georg Schnitger

Publication date 10 November 1999

zbMATH Keywords

communication complexitytwo-party protocols

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 1011685
• scientific article; zbMATH DE number 4197419
• Communication Complexity

Cited in

(15)

• The communication complexity of interval orders
• Communication complexity
• scientific article; zbMATH DE number 1011685 (Why is no real title available?)
• On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's
• scientific article; zbMATH DE number 3872716 (Why is no real title available?)
• Communication complexity
• Lifting query complexity to time-space complexity for two-way finite automata
• Recognition problems and communication complexity.
• scientific article; zbMATH DE number 1795910 (Why is no real title available?)
• Communication complexity and intrinsic universality in cellular automata
• The advantages of a new approach to defining the communication complexity for VLSI
• Cold dynamics in cellular automata: a tutorial
• The advantages of a new approach to defining the communication complexity for VLSI
• scientific article; zbMATH DE number 4022600 (Why is no real title available?)
• On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes

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