activity
20112024
most citedWeak CSR expansions and transience bounds in max-plus algebra

22 citations · 91 across the 20 of their papers we have counts for

collaborators
Showing 2023 · cs.DCShow all

1 paper · 2 filters

cs.DC2023

Topological Characterization of Task Solvability in General Models of Computation

Hagit Attiya, Armando Castañeda, Thomas Nowak

The famous asynchronous computability theorem (ACT) relates the existence of an asynchronous wait-free shared memory protocol for solving a task with the existence of a simplicial…