1 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.DC2026
Polynomial Time Local Decision Revisited
Laurent Feuilloley, Soumyadeep Paul, Ami Paz
We consider three classification systems for distributed decision tasks: With unbounded computation and certificates, defined by Balliu, D'Angelo, Fraigniaud, and Olivetti [JCSS'18…
eess.SY2018★ 1 cited
Towards the Existential Control of Boolean Networks: A Preliminary Report (Extended Abstract)
Soumya Paul, Jun Pang, Cui Su
Given a Boolean network BN and a subset A of attractors of BN, we study the problem of identifying a minimal subset C of vertices of BN, such that the dynamics of BN can reach from…
eess.SY2018★ 1 cited
A Decomposition-based Approach towards the Control of Boolean Networks (Technical Report)
Soumya Paul, Cui Su, Jun Pang +1
We study the problem of computing a minimal subset of nodes of a given asynchronous Boolean network that need to be controlled to drive its dynamics from an initial steady state (o…