On the communication complexity of parallel computation

MaRDI QIDQ4260377zbMATH OpenFDO

Authors Oscar H. Ibarra, Nicholas Q. Tran

Publication date 19 September 1999

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Analysis of algorithms and problem complexity (68Q25) Algebraic theory of languages and automata (68Q70)

Recommendations

• On communication-bounded synchronized alternating finite automata
• On the power of synchronization in parallel computations
• scientific article; zbMATH DE number 4060723
• scientific article; zbMATH DE number 17800

Cited in

(14)

• Communication complexity of the Gaussian elimination algorithm on multiprocessors
• Communication-efficient parallel algorithms for distributed random-access machines
• A communication hierarchy of parallel computations
• On communication-bounded synchronized alternating finite automata
• Communication complexity in vertex partition whiteboard model
• On multi-partition communication complexity
• Impact of communications of the complexity of the parallel Gaussian elimination
• scientific article; zbMATH DE number 1696661 (Why is no real title available?)
• scientific article; zbMATH DE number 3936481 (Why is no real title available?)
• scientific article; zbMATH DE number 3938553 (Why is no real title available?)
• On the average communication complexity of asynchronous distributed algorithms
• scientific article; zbMATH DE number 3999131 (Why is no real title available?)
• scientific article; zbMATH DE number 2087779 (Why is no real title available?)
• COMMUNICATION BALANCING IN THE PARALLEL GÖTTFERT ALGORITHM

This page was built for publication: On the communication complexity of parallel computation

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