Showing papers in "Information Processing Letters in 1991"

TL;DR: The first section introduces the running example, of leakage in a gas burner, and defines and axiomatises the proposed calculus as an extension of interval temporal logic.

TL;DR: Divide-and-conquer search strategies are described for satisfying proximity queries involving arbitrary distance metrics involving arbitrarydistance metrics.

TL;DR: It is shown that the models are essentially equal in communication complexity and the relative power of the common random string model vs. the private randomstring model is investigated.

TL;DR: It is proved that maximum 3-dimensional matching is a MAX SNP-hard problem if the number of occurrences of elements in triples is bounded by a constant, and that maximum covering by 3-sets and maximum covering of a graph by triangles are MAX SNP hard.

TL;DR: A new message ordering relation, known as causal ordering, has been introduced by Birman and Joseph, and a simple algorithm to implement it is proposed, based on message sequence numbering.

TL;DR: An optimal O( n log n ) algorithm for translating two sets of points on a line so that their Hausdorff distance is as small as possible.

TL;DR: This work shows how to compute a maximum cardinality matching in a bipartite graph of n vertices in time O(n1.5 m log n ) for dense graphs, and improves on the O( n m) algorithm of Hopcroft and Karp.

TL;DR: It turns out that with this linear order, the well-known greedy heuristic “always use the smallest available color” yields an exact coloring algorithm for interval graphs.

TL;DR: A self-stabilizing algorithm is proposed for constructing spanning trees for connected graphs that can handle error recovery automatically and has the added property of being able to be scalable.

TL;DR: It is shown that the property of being superprimitive is testable on a string of n symbols in O(n) time and space.

TL;DR: A fast approximation algorithm that generates provably good solutions and an improved polynomial-time approximation scheme for this problem of covering with the minimum number of fixed-size orthogonal hypersquares all points in P are presented.

TL;DR: The dominance relation on X can be computed in time O(n 3/2 M3/2 ), where M(n) denotes the time needed to multiply two nxn matrices over Z n+1.

TL;DR: The main result is that the suffix array data structure of Manber and Myers can be used to reduce the problem of proximity searching in text searching systems and special searching problems in biological sequences to the two-dimensional orthogonal range queries problem.

TL;DR: This paper presents an extremely simple O(n) algorithm which simultaneously solves the following three problems on circular-arc graphs: the maximum independent set, the minimum clique cover, and the minimum dominating set problems, whereas the best previous bounds for the latter two problems were O (n2) and O( n3), respectively.

TL;DR: An algorithm is presented for checking the consistency of a fuzzy knowledge base via a set of reduction rules that preserve the properties of the FPN.

TL;DR: A very simple ramdomized algorithm for selecting the pair of points determining the line with k th smallest slope with O( n log n ) expected running time is given.

TL;DR: This algorithm is a simple O(n log n) algorithm for computing the smallest enclosing circle of a convex polygon and can be easily extended to algorithms that compute the farthest-and the closest-point Voronoi diagram of a conveyed polygon within the same time bound.

TL;DR: This is the first randomized strategy whose competitive factor beats a constant less than 2, and it achieves an optimal competitive ratio of 2L (L+1) against an oblivious adversary.

TL;DR: A new data structure for answering shortest path queries inside a simple polygon is described, which has the same asymptotic performance as the previously known data structure, but is significantly less complicated.

TL;DR: It is shown that, unless P = NP, no polynomial-time approximation algorithm can guarantee to find an independent dominating set with size within a factor of K of the optimal, where K is any fixed constant >1.

TL;DR: This study includes 2-way infinite automata with a pebble, which establishes the space complexity of decision problems (such as membership, nonemptiness and equivalence) for some finite automata.

TL;DR: A simple greedy algorithm for finding small dominating sets in undirected graphs of N nodes and M edges is analyzed and it is shown that dg < N + 1 - v2M + 1, where dg is the cardinality of the dominating set returned by the algorithm.

TL;DR: Planar orthogonal drawings of graphs are studied and lower bounds on the number of bends along the edges are provided and this work finds applications in VLSI layout, aesthetic graph drawing, and communication by light or microwave.

TL;DR: The nonparallel approximability of computing the number of true gates in a Boolean circuit is proved and it is shown that approximating within any factor ϵ > 0 any of those problems is P-complete under log-space reductions.

TL;DR: A loopless algorithm for generating all binary trees with n nodes is presented here and the algorithm generates an integer sequence representation of the binary trees.

TL;DR: It is shown that an n -star can be decomposed into (n −2)! vertex disjoint cycles of lenght ( n −1) n . These cycles may be used in designing parallel algorithms on an interconnection network based on the star topology.

TL;DR: A technique for efficient and fault-tolerant simulations of {\em arbitrary} PRAM algorithms in the presence of arbitrary dynamic fail-stop processor errors is described.