Adam Shimi
YOU?
Author Swipe
View article: Characterization and Derivation of Heard-Of Predicates for Asynchronous Message-Passing Models
Characterization and Derivation of Heard-Of Predicates for Asynchronous Message-Passing Models Open
In distributed computing, multiple processes interact to solve a problem together. The main model of interaction is the message-passing model, where processes communicate by exchanging messages. Nevertheless, there are several models varyi…
View article: Characterization and Derivation of Heard-Of Predicates for Asynchronous\n Message-Passing Models
Characterization and Derivation of Heard-Of Predicates for Asynchronous\n Message-Passing Models Open
In distributed computing, multiple processes interact to solve a problem\ntogether. The main model of interaction is the message-passing model, where\nprocesses communicate by exchanging messages. Nevertheless, there are several\nmodels va…
View article: K-set agreement bounds in round-based models through combinatorial topology
K-set agreement bounds in round-based models through combinatorial topology Open
Round-based models are very common message-passing models; combinatorial topology applied to distributed computing provides sweeping results like general lower bounds. We combine both to study the computability of k-set agreement. Among al…
View article: K set-agreement bounds in round-based models through combinatorial\n topology
K set-agreement bounds in round-based models through combinatorial\n topology Open
Round-based models are very common message-passing models; combinatorial\ntopology applied to distributed computing provides sweeping results like\ngeneral lower bounds. We combine both to study the computability of k-set\nagreement. Among…
View article: Characterizing Asynchronous Message-Passing Models Through Rounds
Characterizing Asynchronous Message-Passing Models Through Rounds Open
Message-passing models of distributed computing vary along numerous dimensions: degree of synchrony, kind of faults, number of faults... Unfortunately, the sheer number of models and their subtle distinctions hinder our ability to design a…
View article: Asynchronous Message Orderings Beyond Causality
Asynchronous Message Orderings Beyond Causality Open
In the asynchronous setting, distributed behavior is traditionally studied through computa- tions, the Happened-Before posets of events generated by the system. An equivalent perspective considers the linear extensions of the generated com…
View article: Entanglement and semantics : application to language processing
Entanglement and semantics : application to language processing Open
International audience