• Publications
  • Influence
Environmental variability and modularity of bacterial metabolic networks
BackgroundBiological systems are often modular: they can be decomposed into nearly-independent structural units that perform specific functions. The evolutionary origin of modularity is a subject ofExpand
  • 185
  • 21
  • PDF
Facilitated Variation: How Evolution Learns from Past Environments To Generalize to New Environments
One of the striking features of evolution is the appearance of novel structures in organisms. Recently, Kirschner and Gerhart have integrated discoveries in evolution, genetics, and developmentalExpand
  • 134
  • 12
  • PDF
MST in Log-Star Rounds of Congested Clique
TLDR
We present a randomized algorithm that computes a Minimum Spanning Tree (MST) in O(log* n) rounds, with high probability, in the Congested Clique model of distributed computing. Expand
  • 62
  • 7
  • PDF
Dual Failure Resilient BFS Structure
TLDR
We study breadth-first search (BFS) spanning trees, and address the problem of designing a sparse fault-tolerant BFS structure, or FT-BFS for short, resilient to the failure of up to two edges in the given unweighted undirected graph G. Expand
  • 34
  • 6
  • PDF
Sparse Fault-Tolerant BFS Trees
TLDR
A sparse fault-tolerant structure for a network is required to continue functioning following the failure of a single edge or vertex, the surviving part T′ of T still contains a BFS spanning tree for (the surviving part of) G. Expand
  • 42
  • 5
  • PDF
Fault Tolerant Approximate BFS Structures
TLDR
This paper addresses the problem of designing a fault-tolerant (α, β) approximate BFS structure (or FT-ABFS structure for short), namely, a subgraph H of the network G such that subsequent to the failure of some subset F of edges or vertices, the surviving part of H still contains a BFS spanning tree. Expand
  • 32
  • 4
Secluded Connectivity Problems
TLDR
We present a polynomial algorithm (based on a nontrivial dynamic program) for the problem on unweighted undirected bounded-degree graphs. Expand
  • 19
  • 4
  • PDF
The Power of Distributed Verifiers in Interactive Proofs
TLDR
We explore the power of interactive proofs with a distributed verifier with short proof size for Graph Non-Isomorphism. Expand
  • 20
  • 4
  • PDF
Local-on-Average Distributed Tasks
TLDR
This paper makes a step towards establishing the hypothesis that many (statically) non-local distributed tasks are local-on-average in the dynamic setting, namely, their time complexity is O(log* n). Expand
  • 19
  • 3
  • PDF
Extinctions in Heterogeneous Environments and the Evolution of Modularity
Extinctions of local subpopulations are common events in nature. Here, we ask whether such extinctions can affect the design of biological networks within organisms over evolutionary timescales. WeExpand
  • 42
  • 2
  • PDF