scientific article; zbMATH DE number 4055049

zbMATH Open0646.68063MaRDI QIDQ3790653FDOQ3790653

Authors:

Publication date: 1988

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

Recommendations

• Randomized function evaluation on a ring
• Better computing on the anonymous ring
• A communication-randomness tradeoff for two-processor systems
• Average and randomized communication complexity
• Nondeterministic communication complexity of random Boolean functions (extended abstract)

zbMATH Keywords

randomized algorithmBoolean functioncommunication complexityfunction evaluatingunidirectional asynchronous ring of processors

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (3)

• Message terminating algorithms for anonymous rings of unknown size
• Randomized function evaluation on a ring
• SPRING: Fast Pseudorandom Functions from Rounded Ring Products

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