Numerous models of concurrency have been considered in the framework of automata. Among the more interesting concurrency models are classical nondeterminism and pure concur-rency, the two facets of alternation, and the bounded concurrency model. Bounded concurrency was previously considered to be similar to nondeterminism and pure concurrency in the sense of the succinctness of automata augment...

I show that the potential V (x,m) = [b 4 −m(1−m)a(a+ 1) ] sn(x,m) dn(x,m) − b(a+ 1 2 ) cn(x,m) dn(x,m) constitutes a QES band-structure problem in one dimension. In particular, I show that for any positive integral or half-integral a, 2a+ 1 band edge eigenvalues and eigenfunctions can be obtained analytically. In the limit of m going to 0 or 1, I recover the well known results for the QES doubl...

Nonperturbative effects in c < 1 noncritical string theory are studied using the two-matrix model. Such effects are known to have the form fixed by the string equations but the numerical coefficients have not been known so far. Using the method proposed recently, we show that it is possible to determine the coefficients for (p, q) string theory. We find that they are indeed finite in the double...

This paper deals with (global) nite-gain input/output stabilization of linear systems with saturated controls. For neutrally stable systems, it is shown that the linear feedback law suggested by the passivity approach indeed provides stability, with respect to every L p -norm. Explicit bounds on closed-loop gains are obtained, and they are related to the norms for the respective systems without...

This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover where the inputs are n points in R and a positive integer k, and we are asked to answer if we can cover these n points with at most k lines where these lines are restricted to be axis parallel. We show that this problem has efficie...

Infeasible code has proved to be an interesting target for static analysis. It allows modular and scalable analysis, and at the same time, can be implemented with a close-to-zero rate of false warnings. The challenge for an infeasible code detection algorithm is to find executions that cover all statements with feasible executions as fast as possible. The remaining statements are infeasible cod...

In this paper we consider the problem of finding maximum weight matchings in bipartite graphs with nonnegative integer weights. The presented algorithm for this problemworks in Õ(Wnω)1 time, whereω is thematrixmultiplication exponent, andW is the highest edge weight in the graph. As a consequence of this result we obtain Õ(Wn) time algorithms for computing: minimum weight bipartite vertex cover...

We introduce a simplified model for platform game levels with falling platforms based on interval graphs and show that solvability of such levels corresponds to finding Steiner cycles or Steiner paths in the corresponding graphs. Linear time algorithms are obtained for both of these problems. We also study these algorithms as streaming algorithms and analyze the necessary memory with respect to...

A paired many-to-many -disjoint path cover (paired -DPC) of a graph  is a set of  disjoint paths joining  distinct source-sink pairs in which each vertex of  is covered by a path. In this paper, we investigate disjoint path covers in recursive circulants   with ≥  and tori, and show that provided the number of faulty elements (vertices and/or edges) is  or less, every nonbiparti...

An approach, based on the Smith Normal Form, is introduced to study the spectra of symmetric matrices with a given graph. The approach serves well to explain how the path cover number (resp. diameter of a tree T) is related to the maximum multiplicity occurring for an eigenvalue of a symmetric matrix whose graph is T (resp. the minimum number q(T) of distinct eigenvalues over the symmetric matr...