Showing papers in "Information Processing Letters in 1996"

TL;DR: The problem of deciding whether a graph can be made into a chordal graph by adding a fixed number k of edges is shown to be solvable in 0( 4’( k + 1) --3’2 (m + n) ) time, and is thus fixed-parameter tractable.

TL;DR: A polynomial-time algorithm is demonstrated for calculating the block-interchange distance of a permutation (i.e. the minimum number of block- interchanges required to transform the permutation to the identity).

TL;DR: An application to multilevel statistical computation is presented, namely classified retrieval of exact statistics from unclassified computation on disclosure-protected (perturbed) data.

TL;DR: This paper investigates how the re-construction could be achieved with two dividing strategies to optimize a test suite with divide-and-conquer techniques.

TL;DR: This paper gives a simple unified algorithm for computing distance maps in O(N 2 ) time for an imput of N×N binary image.

TL;DR: A simple theorem is proved that provides a lower bound on the size of nondeterministic finite automata which accept a given regular language.

TL;DR: B branching bisimilarity can equivalently be defined in terms of semi-branching bisimulations; the results suggest that such a definition is more intuitive than the original definition of Van Glabbeek and Weijland (1989).

TL;DR: This work presents an algorithm for string matching with mismatches based in arithmetical operations that runs in linear worst case time for most practical cases and presents a new approach to string searching.

TL;DR: The pairwise comparison methodology introduced by Thurston in 1927 can be used as a powerful inference tool and knowledge acquisition technique in knowledge-based systems and should be considered as an empirical experiment using a Monte Carlo approach.

TL;DR: It is proved that for any ϵ > 0 it is NP-hard (even for bipartite graphs) to approximate the maximum balance of the connected partition for G = (V, E) with an absolute error guarantee of ¦V¦1 − e.

TL;DR: Experimental results on a Silicon Graphics Challenge multiprocessor demonstrate good overall performance for the new algorithm on small heaps, and significant performance improvements over known alternatives on large heaps with mixed insertion/deletion workloads.

TL;DR: This work presents a simple self-stabilizing leader election protocol that recovers in O(1) time from a state with a single transient fault on oriented rings, and reveals the effect of a single fault is tightly contained around the fault.

TL;DR: In this note the makespan scheduling problem on a single processor is considered and several polynomial-time algorithms for finding an optimal schedule are given.

TL;DR: This paper gives an alternative proof of the result of Long et al. (1994) that nested fixpoint expressions e of alternation depth d > 1 can be evaluated over a complete lattice of height h in time O (d · h · ¦e¦ (d − 1 )) ⌜ d 2 ⌝+1 .

TL;DR: A simple proof shows that BPP is contained in a complexity class that presumably lies even lower in this Polynomial-time Hierarchy than was previously known.

TL;DR: This paper shows a general lower bound of Ω(log( 1 δ ) e(1 − 2η) 2 ) on the number of examples required for PAC learning in the presence of classification noise and demonstrates the optimality of the generalLower bound by providing a noise-tolerant learning algorithm for the class of symmetric Boolean functions which uses a sample size within a constant factor of this bound.

TL;DR: This work studies the tree 3-spanner problem for some special classes of graphs namely interval graphs, permutation graphs and regular bipartite graphs.

TL;DR: The dynamic version of this problem is considered, and simple algorithms and data structures achieving O( n ) amortized time per edge insertion starting from an empty graph are provided, which favorably compares to the trivial O( m + n ) time bound per operation obtained applying the off-line algorithm.

TL;DR: An approximation-preserving reduction from MINSAT to the minimum vertex cover (MINVC) problem is presented, and it is observed thatMINSAT remains NP-complete even when restricted to planar instances.

TL;DR: It is shown that two cryptographic schemes for encrypting 2-D gray scale images by using a large family of fractals can easily be broken with a pair of plain-image and cipher-sequential data.

TL;DR: It is shown that given a binary n -cube with f e ⩽ n − 4 faulty edges and f v n − 1 faulty vertices, a ring of length at least 2 n − 2 f v can be obtained.

TL;DR: Algorithms for finding the clique transversal number and theClique independence number for a comparability graph of n nodes are presented, where M ( n ) is the complexity of multiplying two n × n matrices.

TL;DR: It is shown that the work function algorithm for the 2-evader problem has competitive ratio m − 2 for all metric spaces with m points, which settles the k-server conjecture for metric Spaces with k + 2 points.

TL;DR: This paper shrinks the gap for the Max 3- set Splitting problem and its generalization Max k-Set Splitting from both ends, finding new lower bounds and new upper bounds.

TL;DR: The effect of local changes in variable ordering is studied and a simulated annealing algorithm for the computation of good variable orderings is presented.

TL;DR: A formal proof of convergence of a class of algorithms for reducing inconsistency of pairwise comparisons (pc) method and making an inference that iterated modifications of the pc matrix made by human experts should also converge is presented.

TL;DR: By proposing a general solution for all the authenticated encryption schemes based on the discrete logarithm problem, the recipient can easily determine the missing message blocks, and then acknowledge the sender to send only these blocks again.

TL;DR: In this article, the authors present distributed algorithms for constructing a depth-first search tree for a communication network, which are more efficient than previous methods and achieve the best performance in the worst case.

TL;DR: This paper addresses the preemptive case of deterministic scheduling parallel applications in a multiprogrammed multiprocessor system and proposes a low-order polynomial time algorithm for the makespan optimality criterion and tasks with different release times.