Now showing items 1-3 of 3

    • Goles Chacc, Eric; Montealegre, Pedro; Ríos Wilson, Martín (American Institute of Mathematical Sciences AIMS, 2020)
      A boolean network is a map F : {0, 1}(n) -> {0, 1}(n) that defines a discrete dynamical system by the subsequent iterations of F. Nevertheless, it is thought that this definition is not always reliable in the context of ...
    • Becker, Florent; Montealegre, Pedro; Rapaport, Ivan; Todinca, Ioan (Springer Verlag, 2018)
      The broadcast congested clique model is a message-passing model of distributed computation where n nodes communicate with each other in synchronous rounds. The joint input to the n nodes is an undirected graph G on the ...
    • Even, Guy; Fischer, Orr; Fraigniaud, Pierre; Gonen, Tzlil; Levi, Reut; Medina, Moti; Montealegre, Pedro; Olivetti, Dennis; Oshman, Rotem; Rapaport Zimermann, Iván; Todinca, Ioan (Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017)
      In this paper we present distributed property-testing algorithms for graph properties in thecongestmodel, with emphasis on testing subgraph-freeness. Testing a graph propertyPmeansdistinguishing graphsG= (V,E)having ...