The feasibility of extracting both explicit and implicit synonym references from a machine readable dictionary is investigated; the extracted synonyms, both symmetric and asymmetr...
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...
We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, o...
Eric Allender, David A. Mix Barrington, Tanmoy Cha...
Abstract. We present a capability calculus for checking partial confluence of channel-communicating concurrent processes. Our approach automatically detects more programs to be par...
Generalization of the covariance concept is discussed for mixed categorical and numerical data. Gini's definition of variance for categorical data gives us a starting point to...