Showing papers in "Information Processing Letters in 1985"

TL;DR: It is shown that this problem, for undirected and directed graphs, is complete in deterministic polynomial time with respect to deterministic log-space reductions.

TL;DR: It is shown that G S can be constructed in O(n 2 ) time and space for a set S of n nonintersecting line segments.

TL;DR: A fully polynomial approximation scheme for the problem of finding the shortest distance between two points in three-dimensional space in the presence of polyhedral obstacles is described.

TL;DR: A new distributed Depth-First-Search (DFS) algorithm for an asynchronous communication network, whose communication and time complexities are O(|E|) and O( |V|), respectively.

TL;DR: This paper presents a linear time algorithm for the Hamiltonian circuit problem in interval graphs and shows that this problem remains NP-complete for planar 3-connected graphs, bipartite graphs, and grid graphs.

TL;DR: It is shown that the basic security theorem does not support claims that the security model developed by Bell and LaPadula is superior to others partly because its authors prove a ‘Basic Security Theorem’ that applies to it.

TL;DR: The alternation level of the theory of real numbers under addition and order is log-complete for the polynomial hierarchy because the inequality of the following type is true: the inequality between the real numbers and the integers.

TL;DR: La famille de modeles de calcul utilisee dans cet article est la famille des machines a acces aleatoire parallele (PRAM).

TL;DR: Combinatory PDL is obtained, a conservative extension of Propositional Dynamic Logic that captures the ‘identity of states’ in CPDL, and its expressive power, as compared to PDL, strongly increases.

TL;DR: A deterministic algorithm for finding the k th smallest item in a set of n items, running in O log log n 2 parallel time on O(n) processors in Valiant's comparison model is given.

TL;DR: It is shown that, by extending any cell with the systolic stack introduced by Guibas and Liang (1982), a new array can be designed to recover an LCS in linear time.

TL;DR: It is shown that in some cases global time can be assumed while designing an algorithm, but need not be implemented—in these cases it can be replaced with Lamport's logical time in a routine manner, which clearly preserves the correctness of the algorithm.

TL;DR: It is shown that the special semi-Thue system S1 = {(abba, λ)} has no equivalent finite semi- Thue system which is uniquely terminating, i.e. canonical, so this system presents a monoid which is in fact a group.

TL;DR: By use of geometric transforms, the post-office problem for a finite set of points in two dimensions and certain two-dimensional point location problems are reduced to the former problem and thus also optimally solved.

TL;DR: This coloring algorithm is in turn used to derive an O(n log n) time heuristic for coloring circle graphs, with a performance guarantee (the worst-case ratio between the number of colors it uses and the chromatic number of the graph) of O(log n).

TL;DR: The algorithm presented here is based on a new divide-and-conquer technique, which can be applied to similar order related problems as well as theoretical interest because it has a relatively small constant time factor.

TL;DR: The self-embedding property is shown to be undecidable and partially decidable, and it follows that the nonself-embedded property is not partially decided, even for globally finite term rewriting systems.

TL;DR: An algorithm that runs in O(p + (n − p) l g( p + 1)) time is derived, where n is the number of wires given and p is the maximum number of noncrossing wires; in many practically relevant cases, e.g., when p is very high, it needs only linear time.

TL;DR: It is shown here that already a very special subproblem with positive switch cost is NP-hard, and efficient algorithms for the construction of an optimal strategy are proposed.

TL;DR: This paper shows how this well-known algorithm by Aho and Corasick can be modified to allow incremental diagram construction, so that new keywords may be entered at any time during the search.

TL;DR: Generalizations of the extended word problems of Dolev and Yao (1983) are investigated in the context of Thue systems with the Church-Rosser property.

TL;DR: It is shown that the difference l( n )− l ( n ) (respectively l (n )−⌈ log n ⌉ ) can be made arbbitrarily large.

TL;DR: Le but de cet article est de determiner l'ensemble C(u)={v∈A * /uv=vu|θ|}, qui est equivalent a determiner pour n=f(u), l'enser C(n)={n'∈Mθ(A)/nn'=n'n}