• Publications
  • Influence
Three Notes on Distributed Property Testing
TLDR
In this paper we present distributed property-testing algorithms for graph properties in the CONGEST model, with emphasis on testing subgraph-freeness. Expand
  • 35
  • 2
  • PDF
Communication complexity and intrinsic universality in cellular automata
TLDR
We introduce necessary conditions for a cellular automaton to be ''universal'', according to a precise notion of simulation, related both to the dynamics of cellular automata and to their computational power. Expand
  • 25
  • 1
  • PDF
Inducing an Order on Cellular Automata by a Grouping Operation
TLDR
A grouped instance of a cellular automaton (CA) is another one obtained by grouping several states into blocks and by letting interact neighbor blocks. Expand
  • 27
A discrete mathematical model applied to genetic regulation and metabolic networks.
This paper describes the use of a discrete mathematical model to represent the basic mechanisms of regulation of the bacteria E. coli in batch fermentation. The specific phenomena studied were theExpand
  • 6
Continuous modeling of metabolic networks with gene regulation in yeast and in vivo determination of rate parameters
A continuous model of a metabolic network including gene regulation to simulate metabolic fluxes during batch cultivation of yeast Saccharomyces cerevisiae was developed. The metabolic networkExpand
  • 7
Distributed Subgraph Detection
TLDR
In the standard CONGEST model for distributed network computing, it is known that "global" tasks such as minimum spanning tree, diameter, and all-pairs shortest paths, consume large bandwidth, for their running-time is $\Omega(\mbox{poly}(n))$ rounds in $n$-node networks with constant diameter. Expand
  • 11
  • PDF
Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol
TLDR
We find a non-trivial communication protocol describing the dynamics of an elementary CA, and we prove that there are no simpler descriptions (protocols) for such CA. Expand
  • 8
  • PDF
The Impact of Locality on the Detection of Cycles in the Broadcast Congested Clique Model
TLDR
The broadcast congested clique model is a message-passing model of distributed computation where n nodes communicate with each other in synchronous rounds. Expand
  • 6
  • PDF
On Distributed Merlin-Arthur Decision Protocols
TLDR
In a distributed locally-checkable proof, we are interested in checking the legality of a given network configuration with respect to some Boolean predicate, and we require that at most one node be marked 1. Expand
  • 6
  • PDF
Additive Cellular Automata over Zp and the Bottom of (CA, <=)
TLDR
In a previous work we began to study the question of “how to compare” cellular automata (CA). Expand
  • 6