Exploiting storage redundancy to speed up randomized shared memory simulations

DOI10.1007/3-540-59042-0_79zbMath1379.68133OpenAlexW1705934845MaRDI QIDQ4596628

Friedhelm Meyer auf der Heide, Christian Scheideier, Volker Stemann

Publication date: 4 December 2017

Published in: STACS 95 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59042-0_79

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Mathematical problems of computer architecture (68M07)

Related Items (4)

Gossiping and broadcasting versus computing functions in networks ⋮ Routing on networks of optical crossbars ⋮ Shared memory simulations with triple-logarithmic delay ⋮ Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.

This page was built for publication: Exploiting storage redundancy to speed up randomized shared memory simulations