Theoretical Computer Science

This paper considers the problem of reliable broadcast in asynchronous authenticated systems, in which n processes communicate using signed messages and up to t processes may behave arbitrarily (Byzantine processes). In addition, for each message ...

• This paper combines Byzantine faults with a message adversary to model disconnections and silent churn.
• It then solves asynchronous Byzantine reliable broadcast (BRB) in this model using signatures.
• The resulting algorithm is ...

For a given digraph D and distinct u , v ∈ V ( D ), we denote by λ D ( u , v ) the local arc-connectivity from u to v. Further, we define the total arc-connectivity t a c ( D ) of D to be ∑ { u , v } ⊆ V ( D ) ( λ D ( u , v ) + λ D ( v , u ) ). ...

In the decision tree computation model for Boolean functions, the depth corresponds to query complexity, and the size corresponds to storage space. The depth measure is the most well-studied one, and is known to be polynomially related to several ...

• Relating decision tree rank for Boolean functions with depth (query complexity), size, sparsity, certificate complexity.
• Relating rank of composed function with depth of outer function and rank of inner function.
• Decision tree size ...

In the Multicut problem, given an undirected graph G, a set of pairs of vertices P, and a budget k, the goal is to determine if there is a set S of at most k edges such that for each ( s , t ) ∈ P, the graph G − S has no path from s to t. In this ...

The merger paradox is a classic, counter-intuitive result from the literature of Industrial Organization saying that merging firms typically experience a decline in their overall profit compared to their total pre-merger profit. This phenomenon ...

Various forms of sorting problems have been studied over the years. Recently, two kinds of sorting puzzle apps have gained popularity. In these puzzles, we are given a set of bins filled with colored units, balls or water, and some empty bins. ...

We study the efficiency of executing transactions in a distributed transactional memory system. The system is modeled as a static network with the topology of a tree. Contrary to previous approaches, we allow the flexibility for both transactions ...

• Studies transaction scheduling problem on Trees in the dual-flow model.
• Allows flexibility for moving both transactions and objects during execution.
• SINGLE-OBJECT algorithm provides optimal communication cost when all transactions ...

We introduce a variant of the Localization game in which the cops only have visibility one, along with the corresponding optimization parameter, the one-visibility localization number ζ 1. By developing lower bounds using isoperimetric ...

We present the problem of finding a maximal independent set (MIS) (named as MIS Filling problem) of an arbitrary connected graph having n vertices with luminous myopic mobile robots. The robots enter the graph one after another from a particular ...

• We present the maximal independent set (MIS) filling problem for an arbitrary graph with Doors.
• Algorithm IND forms an MIS of size m for a single Door under asynchronous setting in O ( m 2 ) epochs.
• Algorithm MULTIND forms an MIS ...

A degenerate symbol over an alphabet Σ is a non-empty subset of Σ, and a sequence of such symbols is a degenerate string. We investigate the exact computation of maximal degenerate palindromes with gaps and mismatches. We present an algorithm ...

A first and second order progress rate analysis was conducted for the intermediate multi-recombinative Evolution Strategy ( μ / μ I , λ ) -ES with isotropic scale-invariant mutations on the highly multimodal Rastrigin test function. Closed-form ...