In this paper we introduce and study a new family of combinatorial simplicialcomplexes, which we call immediate snapshot complexes. Our construction andterminology is strongly motivated by theoretical distributed computing, asthese complexes are combinatorial models of the standard protocol complexesassociated to immediate snapshot read/write shared memory communication model.In order to define the immediate snapshot complexes we need a new combinatorialobject, which we call a witness structure. These objects are indexing thesimplices in the immediate snapshot complexes, while a special operation onthem, called ghosting, describes the combinatorics of taking simplicialboundary. In general, we develop the theory of witness structures and use...
We look in detail at the structural liveness problem (SLP) for subclasses ofPetri nets, namely immed...
AbstractThe theory of distributed computing shares a deep and fascinating connection with combinator...
Abstract We give necessary and sufficient combinatorial conditions characterizing the class of decis...
21st International Conference on Principles of Distributed Systems (OPODIS 2017), 18-20 December 201...
International audienceWe show that the protocol complex formalization of fault-tolerant protocols ca...
Combinatorial topology is used in distributed computing to model concurrencyand asynchrony. The basi...
International audienceBuilding on the work of Martinetz, Schulten and de Silva, Carlsson, we introdu...
International audienceWe show that the protocol complex formalization of fault-tolerant protocols ca...
International audienceThis paper introduces a data structure, called simplex tree, to represent abst...
Topological data analysis computes and analyses topological features of the point clouds by construc...
International audienceThe standard chromatic subdivision of the standard simplex is a combinatorial ...
article published in a peer reviewed, open access journal.The goal of this paper is to introduce a n...
International audienceWe propose new axioms relative to combinatorial topology. These axioms are set...
International audienceWe show in this article that some concepts from homotopy theory, in algebraic ...
This dissertation involves the interplay between structure, randomness, and pseudorandomness in theo...
We look in detail at the structural liveness problem (SLP) for subclasses ofPetri nets, namely immed...
AbstractThe theory of distributed computing shares a deep and fascinating connection with combinator...
Abstract We give necessary and sufficient combinatorial conditions characterizing the class of decis...
21st International Conference on Principles of Distributed Systems (OPODIS 2017), 18-20 December 201...
International audienceWe show that the protocol complex formalization of fault-tolerant protocols ca...
Combinatorial topology is used in distributed computing to model concurrencyand asynchrony. The basi...
International audienceBuilding on the work of Martinetz, Schulten and de Silva, Carlsson, we introdu...
International audienceWe show that the protocol complex formalization of fault-tolerant protocols ca...
International audienceThis paper introduces a data structure, called simplex tree, to represent abst...
Topological data analysis computes and analyses topological features of the point clouds by construc...
International audienceThe standard chromatic subdivision of the standard simplex is a combinatorial ...
article published in a peer reviewed, open access journal.The goal of this paper is to introduce a n...
International audienceWe propose new axioms relative to combinatorial topology. These axioms are set...
International audienceWe show in this article that some concepts from homotopy theory, in algebraic ...
This dissertation involves the interplay between structure, randomness, and pseudorandomness in theo...
We look in detail at the structural liveness problem (SLP) for subclasses ofPetri nets, namely immed...
AbstractThe theory of distributed computing shares a deep and fascinating connection with combinator...
Abstract We give necessary and sufficient combinatorial conditions characterizing the class of decis...