We present fast and efficient parallel algorithms for finding the connected components of an
undirected graph. These algorithms run on the exclusive-read, exclusive-write (EREW) …

Computing the connected components of an undirected graph G=(V, E) on| V|= n vertices
and| E|= m edges is a fundamental computational problem. The best known parallel …

We study the depth (~-parallel time) complexity of widely used shared memory CRCW
PRAM models. We first consider COMMON (m), ARBITRARY (m) and PRIORITY (m), for m< …

The sensitivity conjecture is a long-standing problem in theoretical computer science that
seeks to fit the sensitivity of a Boolean function into a unified framework formed by the other …

We prove that nested canalizing functions are the minimum-sensitivity Boolean functions for
any activity ratio and we determine the functional form of this boundary which has a …

This paper studies the mathematical properties of collectively canalizing Boolean functions,
a class of functions that has arisen from applications in systems biology. Boolean networks …

For a Boolean function f:{0, 1} n→{0, 1} computed by a Boolean circuit C over a finite basis
B, the energy complexity of C (denoted by EC B (C)) is the maximum over all inputs {0, 1} n …

Boolean networks and, more generally, probabilistic Boolean networks, as one class of
gene regulatory networks, model biological processes with the network dynamics …

This brief investigates the sensitivity and influence of probabilistic Boolean networks (PBNs).
By resorting to the weighted Jacobian matrix and semi-tensor product technique, the …

Supercomputers generate vast amounts of data, typically organized into large directory
hierarchies on parallel file systems. While the supercomputing applications are parallel, the …