Showing papers in "Information Processing Letters in 1990"

TL;DR: In this article, the authors give elementary derivations of the various inequalities collectively known as Chernoff bounds, which are strong upper bounds on the probability of obtaining very few or very many heads in series of independent coin tossings.

TL;DR: A probabilistic self-stabilizing algorithm for a ring of identical processes is presented, which results probabilistically in convergence to a normal state with one token if the initial state of the ring is abnormal.

TL;DR: An O(nm log m) algorithm is presented to solve the string-to-string correction problem for cyclic strings and it is shown that the solution to this problem is simple and efficient.

TL;DR: It is shown that the Held-Karp 1-trees have a certain monotonicity property: given a particular instance of the symmetric TSP with triangle inequality, the cost of the minimum weighted 1-tree is monotonic with respect to the set of nodes included.

TL;DR: It is shown that quadratic programming lies in NP, thereby proving that it is NP-complete.

TL;DR: This work presents an algorithm for finding a shortest edit distance of A and B whose worst-case running time is O( NP ) and whose expected running time was O( N + PD ).

TL;DR: A constant time sorting algorithm is derived on a three-dimensional processor array equipped with a reconfigurable bus system, which is far more feasible than the CRCW PRAM model.

TL;DR: This work presents a linear algorithm for this problem on interval graphs, given the adjacency lists of an interval graph with n vertices and m edges, that runs in O(m+n) time.

TL;DR: It is shown by a reduction from 3SAT that INDEPENDENT DOMINATING SET remains NP-complete when restricted to chordal bipartite graphs.

TL;DR: This work designs P.i programs so that the system is guaranteed to reach a unison state; i.e., one where all the x variables have equal values.

TL;DR: It is shown that the worst-case running time of the new deterministic algorithm for factoring polynomials over Zp of degree n is O(p12(log p)2n2+∈), which is faster than the running times of previous determi nistic algorithms with respect to both n and p.

TL;DR: It is shown that the following two conditions are equivalent: (1) the existence of pseudorandom generators; (2) theexistence of a pair of efficiently constructible distributions that are computationally indistinguishable but statistically very different.

TL;DR: This paper shows how to implement bounded ordered dictionaries, also called bounded priority queues, in O(log log N ) time per operation and O( n ) space.

TL;DR: The algorithm is a randomized O(log n) time, n/log n processor algorithm for an EREW PRAM that is substantially simpler than other optimal algorithms for list-ranking.

TL;DR: It is shown that a bipartite digraph admits an upward drawing, i.e., a planar drawing with the additional constraint that all the edges flow in the same direction if and only if it is planar.

TL;DR: It is proved that this channel routing model, times square mode, can be wired in three or four layers, and given a condition, testable in polynomial time, to decide the number of layers needed.

TL;DR: A linear algorithm for partitioning a biconnected graph into a pair of disjoint connected subgraphs, each of which contains a specified vertex and has a specified number of vertices is presented.

TL;DR: Three channel primitives for sending messages: two-way- flush, forward-flush, and backward-flush are presented, collectively termed Flush, which can permit as much concurrency as non-FIFO channels and yet retain the properties of FIFOannels.

TL;DR: The general idea of the algorithm is to perform a local mark-scan whenever a pointer to a shared structure is deleted, and any subgraphs with external references are remarked as ordinary cells, and their counts reset.

TL;DR: A probabilistic protocol is presented that solves this Processor Identiy Problem for asynchronous processors that communicate through a common shared memory and simplifies shared memory processor design by eliminating the need to encode processor identifiers in system hardware or software structures.

TL;DR: It is shown that any linear triangulation of a simple polygon can be realized as a (combinatorially equivalent) Delaunay triangulations.

TL;DR: It is argued that solutions to the problem of mutual exclusion can be extended to solve the issue of replica control in a distributed database by exploiting the structural information of the underlying system.

TL;DR: A simple construction of a family of permutations with a certain pseudo-random property can be used to derandomize a recent randomized maximum-flow algorithm of Cheriyan and Hagerup for all relatively dense networks.

TL;DR: This paper shows that the two-dimensional processor array with a reconfigurable bus system is at least as powerful as the CRCW shared-memory computer, and suggests a general method to convert algorithms designed on the former into algorithms on the latter.

TL;DR: It is shown that there exists a canonical form for a Hamiltonian path and an Hamiltonian circuit that may be produced by a simple algorithm in optimal time and space.

TL;DR: It is proved that the (unweighted) perfect domination problem is NP-complete for bipartite graphs and chordal graphs and the linear algorithm for the weighted perfect dominationProblem in trees is given.

TL;DR: An average case analysis of the Karp-Rabin string matching algorithm, a probabilistic algorithm, that adapts hashing techniques to string searching, and an efficient implementation of this algorithm are presented.

TL;DR: An ultrametric suitable for the domain of traces is derived, which constitutes a natural generalization of the standard metric used in the complete metric space of strings, which has applications in the denotational semantics for concurrency.

TL;DR: An O(n2) algorithm to solve the problem of how many triangles with corners at points in set S contain p, given a set S of n points in the plane is given.