Showing papers in "Information Processing Letters in 1997"

TL;DR: It is shown that every stutter-invariant propositional linear temporal property is expressible without the next-time operator.

TL;DR: It is shown that unbounded-fanin circuits of depth d and size s have average sensitivity O(log s)d−1, and this bound is asymptotically tight.

TL;DR: This work shows how the results of Karger, Motwani, and Sudan (1994) and Blum ( 1994) can be combined in a natural manner to yield a polynomial-time algorithm for O (n 3 14 )- coloring any n-node 3-colorable graph.

TL;DR: The minimum labeling spanning tree is studied, to find a spanning tree whose edge set consists of the smallest possible number of labels, and this problem is shown to be NP-complete even for complete graphs.

TL;DR: It is proved that already for the case d = 2, the existence of an asymptotic polynomial time approximation scheme would imply P = NP, which is very simple and uses no new ideas.

TL;DR: In this paper, it was shown that for some problems (including natural ones) there cannot be approximation schemes running in time f(1/ϵ) n p0(1), no matter how fast function f grows.

TL;DR: It is proved that the classical bounds on the performance of the greedy algorithm for approximating MINIMUM COVER with costs are valid for PARTIAL COVER as well, thus lowering, by more than a factor of two, the previously known estimate.

TL;DR: It is shown that the problem of deciding whether a pair of 48 × 48 integer matrices is mortal is undecidable, and that the problems of deciding, for a given k, whether a couple of matrices are k-mortal is NP-complete.

TL;DR: These closed-form expressions for the average number of runs to cover an arbitrary square region in two dimensions using a Hilbert curve allow the estimation of the quality of the linearization obtained by using the Hilbert curve to map from a two- dimensional space to a one-dimensional space.

TL;DR: This work significantly improves the previous lower bounds on the performance of randomized algorithms for on-line scheduling jobs on m identical machines and shows that a natural idea for constructing an algorithm with matching performance does not work.

TL;DR: It was speculated that the connectivity of the n-dimensional crossed cube is n and this paper proves that the result is true.

TL;DR: It is proved that for any graph there exists a computation terminating with any a priori given enumeration of its nodes, and it is also proved that after successful termination individual nodes "know" this fact.

TL;DR: An authentication scheme that uses a novel design of shared tamper resistant cryptographic token is originally proposed which can be very useful to enhance the security of most remote login systems.

TL;DR: A simple combinatorial lemma is shown that one must alter at least c( n 2 r ) log( n r ) entries of an (n × n)-Cauchy matrix to reduce its rank below r, for some constant c.

TL;DR: It is shown that no shelf algorithm for on-line strip packing can have an asymptotic worst case ratio better than h∞ ≈ 1.69103.

TL;DR: Two O(n2) time algorithms for the node-to-set disjoint paths problem in n-dimensional star graphs Gn which are (n − 1)-connected are given.

TL;DR: This work presents an O (kn 4 ) time and O ( kn 3 ) space algorithm for finding a match of P into T or determining that no match exists, given that P is separable.

TL;DR: A polynomial time algorithm is given to decide, for a fixed r, whether or not a weighted graph G of bounded tree-width satisfies σ ( G , w ; r ) ⩽ q , for any given number q.

TL;DR: This work presents a linear-time algorithm for finding a minimum weighted feedback vertex set on interval graphs using the dynamic programming technique, which can solve the latter three problems inlinear-time on interval graph problems.

TL;DR: This paper focuses on three classes of graphs, defined in terms of forbidden subgraphs, in which either MS is NP-hard or can be solved by polynomial algorithms, and finds that in one of them, MS is still NP- hard; in the others, the problem difficulty is an open question.

TL;DR: It is shown that, in arbitrary graphs, any sense of direction has a dramatic effect on the communication complexity of several important distributed problems: Broadcast, Depth First Traversal, Election, and Spanning Tree Construction.

TL;DR: A simple linear-time algorithm to find a partition V1, V2, V3, V4 of the vertex set V such that ui ∈ Vi, ¦Vi¦=ni and Vi induces a connected subgraph of G for each i, 1 ≤ i ≤ 4 is given.

TL;DR: A polynomial time approximation algorithm which computes a k-clustering for graphs having a dominating diametral path and the intractability of graph clustering and the hardness of approximating minimum graph clusterings is developed.

TL;DR: The notion of associative one-way functions are introduced and it is proved that they exist if and only if P ≠ NP and they are presented as evidence of their utility.

TL;DR: An O(n + m) algorithm to process edge deletion and m queries for a tree with n nodes from which edges are deleted interspersed with m on-line connectivity queries is presented.

TL;DR: An efficient authenticated encryption scheme with message linkage based on the discrete logarithm problem that can be combined with ElGamal encryption in a natural manner and is lower than those of the straightforward method.

TL;DR: This paper presents a simple algorithm with worst-case ratio 43 for P2//Cmax with a buffer of length 1 and a goal to assign all jobs to the identical machines such that the makespan is minimized.

TL;DR: This paper shows that solving the reliability problem is NP-hard even when the distributed computing system is restricted to a series-parallel, a 2-tree, a tree, or a star structure.

TL;DR: A memory-efficient array data structure is presented to represent the Huffman tree and a fast Huffman decoding algorithm is presented.