5 citations · 7 across the 4 of their papers we have counts for
5 papers
On the Complexity of Symmetric Boolean Functions in Multiparty Private Simultaneous Messages
Marshall Ball, Peter Crawford-Kahrl, Vladimir Podolskii +1
Multiparty Private Simultaneous Messages (PSM), also known as Decomposable Randomized Encoding (DRE) or information-theoretic garbling, is a model for non-interactive secure comput…
Genetic Networks Encode Secrets of Their Past
Peter Crawford-Kahrl, Robert R. Nerem, Bree Cummins +1
Research shows that gene duplication followed by either repurposing or removal of duplicated genes is an important contributor to evolution of gene and protein interaction networks…
Joint Realizability of Monotone Boolean functions
Peter Crawford-Kahrl, Bree Cummins, Tomas Gedeon
The study of monotone Boolean functions (MBFs) has a long history. We explore a connection between MBFs and ordinary differential equation (ODE) models of gene regulation, and, in…
A poset metric from the directed maximum common edge subgraph
Robert Nerem, Peter Crawford-Kahrl, Bree Cummins +1
We study the directed maximum common edge subgraph problem (DMCES) for the class of directed graphs that are finite, weakly connected, oriented, and simple. We use DMCES to define…
Comparison of two combinatorial models of global network dynamics
Peter Crawford-Kahrl, Bree Cummins, Tomas Gedeon
Modeling the dynamics of biological networks introduces many challenges, among them the lack of first principle models, the size of the networks, and difficulties with parameteriza…