Showing papers in "Information Processing Letters in 1992"

TL;DR: This paper gives efficient polynomial-time algorithms for the case when one tree is a string or has a bounded number of leaves and shows that the problem is NP-complete even for binary trees having a label alphabet of size two.

TL;DR: It is NP-hard to find α-edge separators and α-vertex separators of size no more than OPT+n 1 2 − e, where OPT is the size of the optimal solutio n.

TL;DR: The equivalence of these problems with the gate matrix layout and the node search number problems is shown and it is shown how all tree obstructions in these sets may be constructively obtained.

TL;DR: The resilience shown in this paper is better than that of the previously known correction procedures and is close to the information theoretic optimum, which shows that programs computing polynomials are “resilient” to a high fraction of errors.

TL;DR: The proof consists of showing how to color an arbitrary uncolored edge of a valid graph (which may require changing the colors of already-colored edges to maintain validity) and can be repeated until all edges are colored.

TL;DR: A new interconnection topology is presented, called the arrangement graph, as a generalization of the star graph topology and many of its properties such as: hierarchical structure, vertex and edge symmetry, simple and optimal routing, and many fault tolerance properties are proved.

TL;DR: This paper presents approximation algorithms for median problems in metric spaces and fixed-dimensional Euclidean space that use a new method for transforming an optimal solution of the linear program relaxation of the s-median problem into a provably good integral solution.

TL;DR: An improved lower bound of 1.540 is given for the parametric case where all items are smaller than or equal to 1/r, rϵ N +, and this work gives improved lower bounds for the asymptotic worst case ratio.

TL;DR: This work presents an efficient implementation of vector clocks that reduces the size of timestamp related information to be transferred in a message and is resilient to changes in the topology of the distributed system.

TL;DR: A self-stabilizing algorithm for constructing breadth-first trees is proposed and its self-Stabilizing property is proven.

TL;DR: The algorithm is probabilistic, involving generation of random graphs, and uses expected linear time and requires a linear number of words to represent the hash function, and thus is optimal up to constant factors.

TL;DR: A new algorithm is invented for the all pairs shortest path problem with O (n 3 ( log log n log n ) time on a unifor RAM) by an improvement of Fredman's result by a factor of 1.6.

TL;DR: A self-stabilizing algorithm for finding a maximal matching in distributed networks that can automatically detect and recover from the faults caused by unexpected perturbations on local variables maintained on each node of the system.

TL;DR: An on-line linear-time algorithm is presented that tests if each prefix of an input string is superprimitive while the string is given a symbol at a time.

TL;DR: It is shown that for the vast majority of satisfiable 3CNF formulae, the local search heuristic that starts at a random truth assignment and repeatedly flips the variable that improves the number of satisfied clauses the most, almost always succeeds in discovering a satisfying truth assignment.

TL;DR: It is shown that, assuming the complexity of each cell is bounded by a constant, point location queries in fat subdivisions in d -dimensional space can be performed in a very simple way in time O(log d -1 n ) with a data structure using O( n log d - 1 n ) storage.

TL;DR: With a slight extension and modification of the algorithm, the maximum weight k -independent set problem on an interval graph with n vertices can be solved in O ( n k ) time using O (n k ) space.

TL;DR: It is not difficult to show that the general partition problem is NPComplete, so the attention is restricted to some special classes of graphs.

TL;DR: An algorithm is presented that solves the problem of finding the suffix-prefix match for each of the k(k - 1) ordered pairs of strings in O(m + k 2) time, for any fixed alphabet.

TL;DR: A simple algorithm is given for the computation of the Euclidian distance from the set of black points in an N × N black and white image, for all points in the image, with running time O(N2 log N) and extra space required.

TL;DR: The average complexity of any algorithm whatsoever under the universal distribution is of the same order of magnitude as the worst-case complexity for time complexity and for space complexity.

TL;DR: This work accounts for the phenomenon of implicit "liveness" of time by defining safety and liveness relative to a given condition, such as the progress of time.

TL;DR: The algorithm is much higher than the original one for cyclic reference counting with local mark-scan, and more shared cells will now be claimed directly, without any need for mark- scan.

TL;DR: It is proved that the concept class of rank-r decision trees is contained within the class of r-decision lists (defined by Rivest) and one result of this note is that the simpler algorithm of Rivest can be used for both.

TL;DR: This work presents Vizing’s theorem, which states that A