Related papers: On the cost of simulating a parallel Boolean autom…
We study parallel algorithms for the minimisation and equivalence checking of Deterministic Finite Automata (DFAs). Regarding DFA minimisation, we implement four different massively parallel algorithms on Graphics Processing Units~(GPUs).…
Given a bidirected ring with capacities and a demand graph, we present an approximation algorithm to the problem of finding the minimum $\alpha$ such that there exists a feasible unsplittable routing of the demands after multiplying each…
We investigate the influence of a deterministic but non-synchronous update on Random Boolean Networks, with a focus on critical networks. Knowing that ``relevant components'' determine the number and length of attractors, we focus on such…
We consider the scheduling problem on $n$ strategic unrelated machines when no payments are allowed, under the objective of minimizing the makespan. We adopt the model introduced in [Koutsoupias, Theory Comput. Syst. (2014)] where a machine…
This paper studies parallelization schemes for stochastic Vector Quantization algorithms in order to obtain time speed-ups using distributed resources. We show that the most intuitive parallelization scheme does not lead to better…
The {\em asynchronous automaton} associated with a Boolean network $f:\{0,1\}^n\to\{0,1\}^n$, considered in many applications, is the finite deterministic automaton where the set of states is $\{0,1\}^n$, the alphabet is $[n]$, and the…
We study the structural constraint of random scale-free networks that determines possible combinations of the degree exponent $\gamma$ and the upper cutoff $k_c$ in the thermodynamic limit. We employ the framework of graphicality…
Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly problem fall into two broad categories -- based on the data structures which…
Directed acyclic graphs or Bayesian networks that are popular in many AI related sectors for probabilistic inference and causal reasoning can be mapped to probabilistic circuits built out of probabilistic bits (p-bits), analogous to binary…
We use activity networks (task graphs) to model parallel programs and consider series-parallel extensions of these networks. Our motivation is two-fold: the benefits of series-parallel activity networks and the modelling of programming…
Computing the connected components of a graph is a fundamental problem in algorithmic graph theory. A major question in this area is whether we can compute connected components in $o(\log n)$ parallel time. Recent works showed an…
We study \emph{multiplicity equivalence} testing of automata over partially commutative monoids (pc monoids) and show efficient algorithms in special cases, exploiting the structure of the underlying non-commutation graph of the monoid.…
We introduce a numerical method to study random Boolean networks with asynchronous stochas- tic update. Each node in the network of states starts with equal occupation probability and this probability distribution then evolves to a steady…
We introduce Symbolic Alternating Finite Automata (s-AFA) as an expressive, succinct, and decidable model for describing sets of finite sequences over arbitrary alphabets. Boolean operations over s-AFAs have linear complexity, which is in…
Correlation clustering is a central topic in unsupervised learning, with many applications in ML and data mining. In correlation clustering, one receives as input a signed graph and the goal is to partition it to minimize the number of…
Given a complete graph $K_{n}=(V, E)$ with non-negative edge costs $c\in {\mathbb R}^{E}$, the problem $2EC$ is that of finding a 2-edge connected spanning multi-subgraph of $K_{n}$ of minimum cost. The integrality gap $\alpha\text{2EC}$ of…
In applications of group testing in networks, e.g. identifying individuals who are infected by a disease spread over a network, exploiting correlation among network nodes provides fundamental opportunities in reducing the number of tests…
Small subgraph counts can be used as summary statistics for large random graphs. We use the Stein-Chen method to derive Poisson approximations for the distribution of the number of subgraphs in the stochastic block model which are…
Identifying the connected components of a graph, apart from being a fundamental problem with countless applications, is a key primitive for many other algorithms. In this paper, we consider this problem in parallel settings. Particularly,…
The cop throttling number $th_c(G)$ of a graph $G$ for the game of Cops and Robbers is the minimum of $k + capt_k(G)$, where $k$ is the number of cops and $capt_k(G)$ is the minimum number of rounds needed for $k$ cops to capture the robber…