Communication complexity and sequential computation

DOI10.1007/BFB0029950MaRDI QIDQ4699286zbMATH OpenFDO

Authors Juraj Hromkovič, Georg Schnitger

Publication date 10 November 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0029950

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

• Communication complexity and parallel computing
• scientific article; zbMATH DE number 4197419
• Communication Complexity

Cited in

(15)

• Communication complexity
• The advantages of a new approach to defining the communication complexity for VLSI
• The communication complexity of interval orders
• Recognition problems and communication complexity.
• 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?)
• On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes
• scientific article; zbMATH DE number 4022600 (Why is no real title available?)
• Communication complexity and parallel computing
• scientific article; zbMATH DE number 1795910 (Why is no real title available?)
• Communication complexity
• The advantages of a new approach to defining the communication complexity for VLSI
• Cold dynamics in cellular automata: a tutorial
• Lifting query complexity to time-space complexity for two-way finite automata
• Communication complexity and intrinsic universality in cellular automata

This page was built for publication: Communication complexity and sequential computation

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