scientific article; zbMATH DE number 17533

MaRDI QIDQ3974857zbMATH OpenFDO

Authors Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik

Publication date 26 June 1992

zbMATH Keywords

CRCW PRAM

Mathematics Subject Classification ID

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

Recommendations

• Fast and optimal simulations between CRCW PRAMs
• Processor-time tradeoffs in PRAM simulations
• Achieving optimal CRCW PRAM fault-tolerance
• Shared memory simulations with triple-logarithmic delay
• Partially effective randomization in simulations between ARBITRARY and COMMON PRAMs

Cited in

(10)

• ERCW PRAMs and optical communication
• Improved deterministic parallel integer sorting
• Processor-time tradeoffs in PRAM simulations
• Some considerations about NPRIORITY(1) without ROM
• The log-star revolution
• Simulations among concurrent-write PRAMs
• Two-coloring linked lists is NC\(^ 1\)-complete for logarithmic space
• Efficient PRAM simulation on a distributed memory machine
• Coloring k-colorable graphs in constant expected parallel time
• Fast and optimal simulations between CRCW PRAMs

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