Showing papers in "Theoretical Computer Science in 1996"

TL;DR: In this paper, the authors studied the complexity of finding the values and optimal strategies of mean payoff games on graphs, a family of perfect information games introduced by Ehrenfeucht and Mycielski and considered by Gurvich, Karzanov and Khachiyan.

TL;DR: A constructive definition of partial derivatives is given, their properties are studied, and they are employed to develop a new algorithm for turning regular expressions into relatively small NFA and to provide certain improvements to Brzozowski's algorithm constructing DFA.

TL;DR: Rather than express the cost of an incremental computation as a function of the size of the current input, the cost is measured in terms of the sum of the sizes of the changes in the input and the output to develop a more informative theory of computational complexity for dynamic problems.

TL;DR: An efficient dynamic-programming algorithm is presented that produces precise solutions to interprocedural dataflow-analysis problems in which the dataflow information at a program point is represented by an environment and the effect of a program operation is representation by a distributive environment transformer.

TL;DR: The basic objects of pseudo-linear algebra are introduced (pseudo-derivations, skew polynomials, and pseudo- linear operators) and several recent algorithms on them are described, which yield algorithms for uncoupling and solving systems of linear differential and difference equations in closed form.

TL;DR: By imposing bounds on the order of the types of πI and of the Higher-Order π-calculus, a hierarchy of name-passing calculi based on internal mobility and one of agent-passed calculi is defined, and it is shown that there is an exact correspondence between the two hierarchies.

TL;DR: Both algorithms are generalized and lead to new linear strategies for Union-Find that are neither covered by the algorithm of Gabow and Tarjan (1984) nor by the one of Dillencourt et al. (1992).

TL;DR: It is shown that many of the semantics proposed for logic programs with negation can be expressed in terms of notions emerging from graph theory, establishing in this way a link between the fields.

TL;DR: Universal Turing machines are proved to exist in the following classes: UTM (24,2), UTM(10,3), U TM(7,4), UTR(5,5), USM(4,6), UTSM (3,10) and U TM (2,18).

TL;DR: Some operations for recontructing convex polyominoes by means of vectors H's and V's partial sums allows a new algorithm to be defined whose complexity is less than O(n2m2).

TL;DR: It is shown that partial real numbers can be considered as “continuous words” and it is proved that the operational semantics is sound and complete with respect to the denotational semantics.

TL;DR: In this paper, recognizability is understood in an algebraic sense, relative to a finite set of graph operations and basic graphs that generate all graphs of C, the modular decomposition of which uses prime graphs of bounded size.

TL;DR: The proof uses a special coding function for finite sequences of positive integers and some strong classical results concerning distribution of primes to construct several small universal register machines.

TL;DR: A case of recursive functions on the reals analogous to the classical recursive functionson the natural numbers, corresponding to a conceptual analog computer that operates in continuous time is defined, and this class turns out to be surprisingly large, and includes many functions which are uncomputable in the traditional sense.

TL;DR: This paper presents Forum, a logic programming presentation of all of linear logic that modularly extends λProlog, Lolli, and LO, and specifies in it a sequent calculus proof system and the operational semantics of a programming language that incorporates references and concurrency.

TL;DR: A polynomial algorithm for the equivalence problem for simple context-free grammars is presented, which solves the problem of deciding bisimilarity between normed context- free processes.

TL;DR: The basic model of a new class of queueing networks with “negative and positive” customers was introduced by one of the authors, and shown to have a nonstandard product form is extended to several classes of positive customers, and multiple classes of negative customers.

TL;DR: Mutual exclusion scheduling is the problem of scheduling unit-time tasks non-preemptively on m processors subject to constraints represented by a graph G, such that tasks represented by adjacent vertices in G must run in disjoint time intervals.

TL;DR: In this paper, a transformation system for pure logic programs and modules is presented, which is inspired by the one of Tamaki and Sato for pure Logic programs and allows to introduce new operations such as splitting and constraint replacement.

TL;DR: Under the hypothesis that NP does not have p-measure 0 (roughly, that NP contains more than a negligible subset of exponential time), it is shown that there is a language that is ≤ T P -complete (“Cook complete”), but not ≤ m P - complete (’Karp-Levin complete’), for NP.

TL;DR: Three different types of complexity lower bounds for the one-way unbounded-error and bounded-error error probabilistic communication protocols for boolean functions are proved.

TL;DR: This new model of computing, splicing systems, is investigated, and with a few exceptions, the author is able to obtain precise characterizations for all resulting families.

TL;DR: This work considers the scenario in which the data resides in an array of read-only memory and hence the elements cannot be moved within the array, and develops efficient selection algorithms using very little extra space.

TL;DR: The first proof of the existence of access structures with optimal information rate and optimal average information rate less that 1/2 + e is given, where e is an arbitrary positive constant.

TL;DR: A step towards a classification of models for concurrency based on the parameters above is moved, and a representative of any of the eight classes of models obtained by varying the three parameters is chosen using the language of category theory.

TL;DR: The basic axioms, definitions and concepts of net theory are reviewed, and new concepts and results presented, among them security constructions, compilation of nets, measurement and modelling of continuous variables, and a law on the limits of precision in observation, measurement, control and realistic modelling.

TL;DR: Using Martin's Determinacy Theorem, it is proved that any formula has either a model or a refutation, and is a starting point for the completeness theorem for the μ-calculus to be presented elsewhere.

TL;DR: In this paper, a solution method for recursive domain equations that combines and extends the standard order-theoretic (Smyth and Plotkin, 1982) and metric (America and Rutten, 1989) approaches is presented.

TL;DR: It is shown that the calculus lacks strong completeness, so selection functions to cut down the search space are not applicable, and it is established an interesting connection between itsStrong completeness and the completeness of basic narrowing.

TL;DR: The one-dimensional firing squad synchronization problem (FSSP) is to construct a generic automaton of a one dimensional cellular network made of a segment of n identical machines so that, at some time (the firing time t(n), all automata enter simultaneously and for the very first time the firing state F.