scientific article; zbMATH DE number 177547

MaRDI QIDQ4037417zbMATH OpenFDO

Authors Yijie Han

Publication date 18 May 1993

zbMATH Keywords

CREW PRAMmaximal independent setmaximal matching problemPROFIT/COST problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Recommendations

• A Fast Derandomization Scheme and Its Applications
• Removing randomness in parallel computation without a processor penalty
• A fast parallel algorithm for the maximal independent set problem
• Parallel PROFIT/COST algorithms through fast derandomization
• A fast and simple randomized parallel algorithm for the maximal independent set problem

Cited in

(8)

• A fast method for complete randomization of messages.
• Parallel PROFIT/COST algorithms through fast derandomization
• SPRING: Fast Pseudorandom Functions from Rounded Ring Products
• A Fast Derandomization Scheme and Its Applications
• Fast Time-Recursive Block Correlators for Pseudorandom Sequences
• Amplification and Derandomization without Slowdown
• Fast Computation of Large Distributions and Its Cryptographic Applications
• An improvement on parallel computation of a maximal matching

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