Showing papers in "Information Processing Letters in 1995"
••
TL;DR: An attack upon the Needham-Schroeder public-key authentication protocol is presented, which allows an intruder to impersonate another agent.
708 citations
••
TL;DR: A linear-time algorithm is presented that, given an n -vertex planar graph G, finds an embedding of G into a (2 n − 4) × ( n − 2) grid such that the edges of G are straight-line segments.
191 citations
••
TL;DR: A linear time algorithm for unit interval graph recognition based on Breadth-First Search, which produces an ordering of the vertices of the graph whenever G is a unit intervals graph.
150 citations
••
TL;DR: The objective of this paper is to propose a new topology, called the (n,k)-star graph, such that it removes the restriction of the number of nodes n! in the n- star graph, and preserves many attractive properties of then-star graph.
138 citations
••
TL;DR: An algorithm which computes the MAST of k trees on n leaves where some tree has maximum outdegree d in time O( kn 3 + n d ) is given.
124 citations
••
TL;DR: This work points out a relation between the minimum diameter spanning tree of a graph and its absolute 1-center and uses this relation to solve the diameter problem and an extension of it efficiently.
120 citations
••
TL;DR: Lower bounds on the number of sample points and on thenumber of coin tosses used by general sampling algorithms for estimating the average value of functions over a large domain are shown and a non-constructive proof of existence of an algorithm that improves the known upper bounds by a constant factor is given.
110 citations
••
[...]
TL;DR: A small calculus of extreme fixed points is presented and the fixed-point theorem presented in Section 3.1 exploits the calculational properties of Galois connections.
83 citations
••
TL;DR: A randomized on-line algorithm for the list update problem which achieves a competitive factor of 1.6, the best known so far.
80 citations
••
TL;DR: This paper focuses on string distance computation based on a set of edit operations, which is based on dynamic programming and has a time complexity of O(n . m), where n and m give the lengths of the two strings to be compared.
69 citations
••
TL;DR: It turns out that the new subalgorithm called COMPUTE-COVERS is itself sufficient to solve the original problem — that is, to compute all the covers of a given string in time linear in the string length — and so it is presented here as a self-contained algorithm in its own right.
••
TL;DR: A simple quadratic-time algorithm for solving the satisfiability problem for a special class of boolean formulas that properly contains the class of extended Horn formulas and balanced formulas.
••
TL;DR: This paper presents randomized algorithms for finding a smallest circle enclosing at least k points of P in the plane and an integer k ⩽ n, which improves on previous results by logarithmic factors.
••
TL;DR: It is shown how to recognize proper interval graphs in linear time by constructing the clique partition from the output of a single lexicographic breadth-first search.
••
TL;DR: This work shows that there is a proper connected subcollection of a collection of non-overlapping polygons that can be separated from its complement moving as a rigid body, without disturbing the other parts of the collection, and such that the complement is also connected.
••
TL;DR: The solutions presented in this note are protocols in which all processes are identical and use a constant amount of space per process, which is a deterministic protocol for a tree network; another solution is a probabilistic Protocol for a network of arbitrary topology.
••
TL;DR: It is shown that in general finding a O(2 poly(¦V¦) )- approximation for p- Center (α) is NP-hard, where ¦ V¦ denotes the number of nodes in the network.
••
TL;DR: The proof of a new property of the Fibonacci word F, namely the characterization of all the palindromes that occur in F, is proved.
••
[...]
TL;DR: The time complexity of insertion and deletion of an interval, and that of interval intersection is reduced from O(n^2) to O(log n + F) where F is the time used to report intersections.
••
TL;DR: Hoare's Find algorithm can be used to select p specified order statistics j1, j2, …, jp from a file of n elements simultaneously and precise formulae are given for both the average number of passes and theaverage number of comparisons.
••
TL;DR: In this paper the first parallel slicing algorithm for static program slicing is introduced and it is shown how the control flow graph of the program to be sliced is converted into a network of concurrent processes, thereby producing a parallel version of Weiser's original static slicing algorithm.
••
TL;DR: Informally, this work is interested in approximate solutions such that the performance ratio, that is the ratio between the value of such solution and thevalue of the optimum solution, is bounded by a constant, independently from the instance of the problem.
••
TL;DR: An O(PN2(N + log P)) algorithm for approximately matching a string of length N and a context-free language specified by a grammar of size P is given, which generalizes the Cocke-Younger-Kasami algorithm for determining membership in a context -free language.
••
TL;DR: It is proved that (ignoring lower order terms) the new algorithm uses at most 5n3 moves, and that any real-time algorithm for the (n2 − 1)-puzzle must make at least n3 moves in the worst case.
••
TL;DR: This work develops polynomial time algorithms for finding a minimum edge dominating set for a cotriangulated graph and a bipartite permutation graph.
••
TL;DR: Hwang and Chen examined the SLICE/AS authentification protocol and found two attacks, and again they describe a modification to the protocol that is independent of the encryption mechanism.
••
TL;DR: The makespan scheduling problem on one machine and Cmax criterion is considered and two polynomial-time algorithms for finding an optimal schedule are given.
••
TL;DR: The weakest equivalence is presented (actually, congruence) with the above-mentioned property, it is proved that it has these properties, and it is compared to failures equivalence.
••
••
TL;DR: This paper compares and contrast the effects of four different types of noise on learning in Valiant's PAC, a distribution-free, model of learning, and shows that any algorithm that chooses as its output concept some concept that minimizes disagreements with a polynomial size set of examples meets this bound.