15 citations · 20 across the 3 of their papers we have counts for
Showing cs.DCShow all
2 papers · 1 filter
cs.DC2011
Synchronization of P Systems with Simplex Channels
Florentin Ipate, Radu Nicolescu, Ionut-Mihai Niculescu +1
We solve the Firing Squad Synchronization Problem (FSSP), for P systems based on digraphs with simplex channels, where communication is restricted by the direction of structural ar…
cs.DC2010★ 15 cited
Edge- and Node-Disjoint Paths in P Systems
Michael J. Dinneen, Yun-Bum Kim, Radu Nicolescu
In this paper, we continue our development of algorithms used for topological network discovery. We present native P system versions of two fundamental problems in graph theory: fi…