scientific article; zbMATH DE number 176775

MaRDI QIDQ4036605zbMATH OpenFDO

Authors Pavol Ďuriš, Zvi Galil

Publication date 18 May 1993

zbMATH Keywords

\(r\)-round communication complexity of a languagearea requirementchip algorithm

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• On the power of multiple reads in a chip
• How Fast Reads Affect Multi-Valued Register Simulations
• On the power of reading the whole infinite input tape
• On multiuser write-efficient memories
• The value of multiple read/write streams for approximating frequency moments
• On the power of concurrent-write PRAMs with read-only memory

Cited in

(3)

• On the power of multiple reads in a chip
• How Fast Reads Affect Multi-Valued Register Simulations
• How fast can a very robust read be?

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