Erratum and addendum to: parallel computation and conflicts in memory access

DOI10.1016/0020-0190(83)90080-7zbMath0509.68031OpenAlexW254906929MaRDI QIDQ1838292

Luděk Kučera

Publication date: 1983

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(83)90080-7

zbMATH Keywords

parallel computationgraph algorithmsmodel of computationparallel RAMparallel time complexityconflict-resolution rules in an idealized concurrent environment

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Theory of operating systems (68N25)

Related Items (2)

Fast and optimal simulations between CRCW PRAMs ⋮ Two-coloring linked lists is NC\(^ 1\)-complete for logarithmic space

This page was built for publication: Erratum and addendum to: parallel computation and conflicts in memory access