An O(n3log n) deterministic and an O(n3) Las Vegs isomorphism test for trivalent graphs
This paper describes an O(n3logn) deterministic algorithm and an O(n3) Las Vegas algorithm for testing whether two given trivalent graphs on n vertices are isomorphic. In fact, the algorithms construct the set of all isomorphisms between two such graphs,...
An efficient algorithm for the “optimal” stable marriage
In an instance of size n of the stable marriage problem, each of n men and n women ranks the members of the opposite sex in order of preference. A stable matching is a complete matching of men and women such that no man and woman who are not partners ...
A theory of intersection anomalies in relational database schemes
The desirability of acyclic database schemes is well argued in [8] and [13]. For schemas described by multivalued dependencies, acyclicity means that the dependencies do not split each other's left-hand sides and do not form intersection anomalies. In a ...
Complete inverted files for efficient text retrieval and analysis
Given a finite set of texts S = {w1, … , wk} over some fixed finite alphabet Σ, a complete inverted file for S is an abstract data type that provides the functions find(w), which returns the longest prefix of w that occurs (as a subword of a word) in S; ...
Fibonacci heaps and their uses in improved network optimization algorithms
In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated F-heaps), extends the binomial queues proposed by Vuillemin and studied further by Brown. F-heaps support arbitrary ...
New applications of failure functions
Presented are several algorithms whose operations are governed by a principle of failure functions: When searching for an extremal value within a sequence, it suffices to consider only the subsequence of items each of which is the first possible ...
Optimal clock synchronization
We present a simple, efficient, and unified solution to the problems of synchronizing, initializing, and integrating clocks for systems with different types of failures: crash, omission, and arbitrary failures with and without message authentication. ...
Systems of linear equations with dense univariate polynomial coefficients
An algorithm for computing the power series solution of a system of linear equations with components that are dense univariate polynomials over a field is described and analyzed. A method for converting the power series solution to rational form is ...
Stochastic catastrophe theory in computer performance modeling
In this paper catastrophic behavior found in computer systems is investigated. Deterministic Catastrophe theory is introduced first. Then it is shown how the theory can be applied in a stochastic framework, which is useful for understanding computer ...
Infinitesimal perturbation analysis for general discrete event systems
A rigorous extension of the recent perturbation analysis approach to more general discrete event systems is given. First, a general class of systems and performance measures is defined, and some basic reprsentational and linearity properties are ...
The existence and density of generalized complexity cores
If C is a class of sets and A is not in C, then an infinite set H is a proper hard core for A with respect to C, if H ⊆ A and for every C ε C such that C ⊆ A, C ⋒ H is finite. It is shown that if C is a countable class of sets of strings that is closed ...
The equivalence problem for real-time DPDAs
The equivalence problem for deterministic real-time pushdown automata is shown to be decidable. This result is obtained by showing that Valiant's parallel stacking technique using a replacement function introduced in this paper succeeds for ...
