scientific article; zbMATH DE number 1998328

zbMath1030.68048arXiv1801.00237MaRDI QIDQ4432962

Bogdan S. Chlebus, Andrzej Pelc, Leszek Gąsieniec

Publication date: 29 October 2003

Full work available at URL: https://arxiv.org/abs/1801.00237

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Parallel Random Access Machine

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (4)

Designing reliable algorithms in unreliable memories ⋮ Sorting and searching in faulty memories ⋮ The price of resiliency: a case study on sorting with memory faults ⋮ Optimal resilient sorting and searching in the presence of memory faults

This page was built for publication: