Showing papers in "Journal of Algorithms in 1990"

TL;DR: It is proved that computing the rank of a three-dimensional tensor over any finite field is NP-complete and over the rational numbers the problem isNP-hard.

TL;DR: This paper seeks to develop on-line algorithms whose performance on any sequence of requests is as close as possible to the performance of the optimum off-line algorithm.

TL;DR: A general model for reasoning about recovery in distributed systems is presented, and it is proved that the set of recoverable system states that have occurred during any single execution of the system forms a lattice, and that there is always a unique maximum recoverable state state, which never decreases.

TL;DR: A new randomized algorithm for achieving consensus among asynchronous processes that communicate by reading and writing shared registers that is polynomial, requiring an expected O ( n 4 ) operations.

TL;DR: In this paper, it was shown that graph isomorphism and chromatic index are solvable in polynomial time when restricted to the class of graphs with treewidth ≤ k (k a constant).

TL;DR: It is shown that the option of allowing ties in the preference lists can significantly affect the computational complexity of stable matching, and it will be shown that, when ties are allowed, the roommate problem is NP-complete.

TL;DR: This paper shows how to generate k -regular graphs on n vertices uniformly at random in expected time O ( nk 3), provided k = O(n 1 3 ) .

TL;DR: Several simple families of routing schemes for general networks are presented, featuring some desirable properties, and the new important features of these schemes are applicability to networks with arbitrary edge costs and attractive stretch factors for small values of k.

TL;DR: Two new translation mechanisms for synchronous systems are described that can be used to translate any protocol tolerant of the most benign failures into a protocol tolerantOf the most severe with respect to fault-tolerance.

TL;DR: This paper presents an overall resource analysis of Algorithms 2 and 3 and discusses strategies and inspiration: Landau-Vishkin algorithm, a simple algorithm improving the simple algorithm--l”he second improvement.

TL;DR: This paper provides a simple proof that for each fixed N > 2 there exist distributed tasks for N processors, that can be solved in the presence of a faulty processor, but any protocol that solves them must send arbitrarily many messages in the worst case.

TL;DR: This work extends algorithms for solving the minimum-weight edit sequence problem with non-linear costs for multiple insertions and deletions to cost functions that are neither convex nor concave, but a mixture of both.

TL;DR: This paper shows how to determine, in linear time, whether a graph is the visibility graph of a spiral polygon.

TL;DR: This work considers algorithms for generating the elements of T(n), the set of all bitstrings with n 1's and n 0's that satisfy the property that in every prefix the number of 0's does not exceed thenumber of 1's, a well known representation of binary trees.

TL;DR: It is proved that maximum planar H-matching (the problem of determining the maximum number of node-disjoint copies of the fixed graph H contained in a variable planar graph G) is NP-complete for any connected planar graphs H with three or more nodes.

TL;DR: This paper develops an algorithm to generate a random subset U ∈ B such that the P(U = B) is proportioned to w(B), and it is shown that this proposed algorithm unifies many existing algorithms.

TL;DR: An account is given of the calculation of the 2-variable polynomial for an oriented knot or link from its presentation as a closed braid, including the theoretical background and the resulting algorithm for computer implementation, together with its practical limitations.

TL;DR: Two algorithms which find such a coloring when Δ ≥ 9 are presented, one of which is a sequential O(n log n) time algorithm and the other is a parallel EREW PRAM algorithm which works in time O(log3n) and uses O( n) processors.

TL;DR: It is shown that, given a convex polygon P with n vertices, the denser lattice packing of P in the plane can be found in O(n) time and the sparsest lattice covering of the plane by a centrally symmetric convexpolygon can be solved in O-time.

TL;DR: A new algorithm is proposed which joins all the pure cycles of the complementing circulating register (CCR) f(X 1, X 2, ..., X n )=X 1 to form a full cycle of 2 n.

TL;DR: An O (log∥ V ∥) parallel reconstruction of root graphs from line graphs is presented that uses O (∥ E∥) processors in the CRCW model, based on a divide-and-conquer scheme that partitions the line graph into two sets, such that each set induces a connected subgraph.

TL;DR: It is shown that the recognition problem for cographs, transitive orientation, maximum node weighted clique, minimum node coloring, minimum weight domination set, minimum fill-in, isomorphism for cograph are in the class NC, and a NC algorithm for parity graph recognition is presented.

TL;DR: An adaptive algorithm is given which identifies the faulty units of a system of n units in O(1 + log[nt]t) rounds of testing using O(n) tests.

TL;DR: It is shown that the normalizer of P can also be found in polynomial time, and given two Sylow p-subgroups of G, all elements conjugating one to the other can be found.

TL;DR: It is proved that a lower bound of 2[ n 2 ] − 1 steps for sorting on a ring of n processors is proved, under the constraint that each processor retains only a single value at any time.

TL;DR: The running time of Shellsort was long thought to be Θ(N3/2) for increment sequences that are "almost geometric", but recent results have lowered the upper bound substantially, although the new bounds were not known to be tight.

TL;DR: A robust election scheme which is optimally secure and verifiable and does not rely on any additional trusted agent and a proof that a simple and natural problem, the distributed sum problem, is universal for the whole class of multi-party problems.

TL;DR: A new framework is introduced, which provides a unified way for proving correctness as well as analyzing the performance of an important class of communication protocols, called (asynchronous) Reset protocols, which are algorithmic transformers, converting protocols working in a static asynchronous network into protocolsWorking in a dynamic asynchronous network.

TL;DR: It is shown that even though the merit value of a node is described by probabilities, α-β bounded windows can still be used to cut off some subtrees from search when a space-efficient depth-first traversal is applied to the game tree.