CRPITS

Chang and Lyuu [Chang and Lyuu, 2008] study the spreading of a message in an Erdős-Rényi random graph G(n, p) starting from a set of vertices that are convinced of the message initially. In their strict-majority scenario, whenever more than half of the ...

For digraphs D and H, a homomorphism of D to H is a mapping f: V(D)→V(H) such that uv ∈ A(D) implies f(u)f(v) ∈ A(H). Suppose D and H are two digraphs, and c_i(u), u ∈ V(D), i ∈ V(H), are non-negative real costs. The cost of the homomorphism f of D to H ...

In this paper we study the problem of deciding whether a given compressed string contains a square. A string x is called a square if x = zz and z = u^k implies k = 1 and u = z. A string w is said to be square-free if no substrings of w are squares. Many ...

Process complexity is one of the basic variants of Kolmogorov complexity. Unlike plain Kolmogorov complexity process complexity provides a simple characterization of randomness for real numbers in terms of initial segment complexity. Process complexity ...

Reasoning about a distributed system that exhibits a combination of probabilistic and temporal behaviour does not seem to be easy with current techniques. The reason is the interaction between probability and abstraction (local block), made worse by ...

Given a graph G = (V, E) and a requirement function r: W₁ x W₂ → R₊ for two families W₁, W₂ ⊆ 2^V - {θ}, we consider the problem (called area-to-area edge-connectivity augmentation problem) of augmenting G by a smallest number of new edges so that the ...

Vertex-connectivity and edge-connectivity represent the extent to which a graph is connected. Study of these key properties of graphs plays an important role in varieties of computer science applications. Recent years have witnessed a number of linear ...

This paper proves undecidability of type checking and type inference problems in some variants of typed lambda calculi with polymorphic and existential types. First, type inference in the domain-free polymorphic lambda calculus is proved to be ...

Z is a formal specification language combining typed set theory, predicate calculus, and a schema calculus. This paper describes an extension of Z that allows transformation and reasoning rules to be written in a Z-like notation. This gives a high-level,...

In this paper we show that some decision problems regarding the computation of Nash equilibria are to be considered particularly hard. Most decision problems regarding Nash equilibria have been shown to be NP-complete. While some NP-complete problems ...

We introduce a complexity measure for decision trees called the soft rank, which measures how well-balanced a given tree is. The soft rank is a somehow relaxed variant of the rank. Among all decision trees of depth d, the complete binary decision tree (...

Reachability and distance computation are known to be NL-complete in general graphs, but within UL ∩ co-UL if the graphs are planar. However, finding longest paths is known to be NP-complete, even for planar graphs. We show that with the combination of ...

Reuse of components is a burgeoning field in chip design. Shorter time to market and assured quality are just two good reasons to reuse previously engineered components. Problems arise however when chip designers need to interface these components as ...

Selman and Kautz's work on knowledge compilation has established how approximation (strengthening and/or weakening) of a propositional knowledgebase can be used to speed up query processing, at the expense of completeness. In the classical approach, the ...

Many different random graph constructions are used to model large real life graphs. Often it is not clear, however, how the strength of the different models compare to each other, e.g., when does it hold that a certain model class contains another. We ...

A linear axis is a straight line skeleton for a polygonal shape. The concept of a linear axis ε-equivalent to the medial axis has been introduced and studied for simple polygons and for those with holes. In this paper, we generalize the notions of a ...

The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both combinatorics and statistical physics. It contains several other polynomial ...

Data stream computations in domains such as internet applications are often performed in a highly distributed fashion in order to save time. An example is the class of applications that use the Google Mapreduce framework of scalable distributed ...