We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadh...
In the all-pairs bottleneck paths (APBP) problem (a.k.a. allpairs maximum capacity paths), one is given a directed graph with real non-negative capacities on its edges and is aske...
Virginia Vassilevska, Ryan Williams, Raphael Yuste...
Abstract. A lexicographic ranking function for the set of all permutations of n ordered symbols translates permutations to their ranks in the lexicographic order of all permutation...
We present an algorithm for synthesising controllers specified in a subset of the interval temporal logic Duration Calculus [13]. The synthesised controllers are given as PLC-Auto...
Dendritic Cells (DCs) are innate immune system cells which have the power to activate or suppress the ystem. The behaviour of human DCs is abstracted to form an algorithm suitable...