TL;DR: General investigations for finite @m are presented, a limit result for @m going to infinity is derived in terms of a density of points and lower bounds for placing the reference point to guarantee the Pareto front's extreme points in an optimal @m-distribution are derived.

TL;DR: It is proved that independent set reconfigurability in perfect graphs (under any of the three models) generalizes the shortest path reconfigURability problem in general graphs and is therefore PSPACE-complete.

TL;DR: This paper proposes the first attribute-based encryption (ABE) schemes allowing for truly expressive access structures and with constant ciphertext size and describes a new efficient identity-based revocation mechanism that gives rise to the most expressive KP-ABE realization with constant-size ciphertexts.

TL;DR: This theorem shows that for problems such as arithmetic circuit lower bounds or black-box derandomization of identity testing, the case of depth four circuits is in a certain sense the general case.

TL;DR: In this article, the authors analyzed the role of population in EAs and showed rigorously that large populations may not always be useful and the conditions under which large populations can be harmful.

TL;DR: The speed of convergence on deterministic best-response walks in selfish routing games and cut games is studied and it is proved that starting from an arbitrary configuration, after one round of best responses of players, the resulting configuration is a @Q(n)-approximate solution.

TL;DR: In this article, the authors show how to use wavelet trees to solve fundamental algorithmic problems such as range quantile queries, range next value queries, and range intersection queries.

TL;DR: This paper presents linear-time algorithms for computing all the strong bridges and all theStrong articulation points of directed graphs, solving an open problem posed in Beldiceanu et al. (2005).

TL;DR: It is obtained that an n-dimension balanced hypercube BH"n has the matching preclusion number 2n, and it is mainly proved that for the balancedhypercube B H"n, each matchingPreclusion set of cardinality 2n is trivial, and the conditional matching preclusions number of balanced hyper cube is 4n-2 whenever n>=2.

TL;DR: This article presents a language independent theory of product line refinement, establishing refinement properties that justify stepwise and compositional product line evolution.

TL;DR: This paper first shows that this problem is NP-hard by a reduction from Exact 3-Cover, and presents a parameterized algorithm based on a refined search tree technique with a running time of O(4.612^k+|V|^4^.^5), which improves the trivial algorithm of running time O(6^k+.

TL;DR: This paper presents an efficient method for computing the minimal absent words of bounded length using a trie of bounded depth, representing bounded length factors, and provides a linear-time algorithm with less memory usage than previous solutions.

TL;DR: A definition of security against chosen ciphertext attacks for C-PRES schemes with keyword anonymity, which combines C-PRE and PEKS is proposed, and a scheme that satisfies the definition is presented.

TL;DR: The algorithm is obtained by combining a greedy solution to the generalization of the well known sparse approximation problem and an existence result on the possibility of sparse approximation with guarantees on the performance and the number of columns chosen.

TL;DR: An improved lower bound is developed showing that no deterministic semi-online algorithm can attain a competitive ratio smaller than 1.585, which significantly reduces the gap between the previous lower bound and the upper bound of 1.6.

TL;DR: It is shown that with strong multiplicity detection, there exists a deterministic algorithm solving the gathering problem starting from an arbitrary configuration for n robots if, and only if, n is odd.

TL;DR: In this article, a measure-once one-way general quantum finite automata (MO-1gQFA) was studied, where a measurement deciding to accept or reject is performed at the end of a computation and a similar measurement is performed after each trace-preserving quantum operation on reading each input symbol.

TL;DR: It is proved that k-SPC is NP-complete, the problem of the set of parameterized k-covers which combines k-cover measure with parameterized matching, which is a distance measure for strings.

TL;DR: A computationally secure scheme is constructed under the enhanced model, which involves much shorter shares and broadcast messages than the perfect schemes, and how to realize the enrollment and disenrollment of players, and particularly, how to deal with L-fold changes of access polices.

TL;DR: A new algorithm is presented achieving time O([email protected]) and space O(m+A), where A is the sum of the lower bounds of the lengths of the gaps in P and @a is the total number of occurrences of the strings in P within T.

TL;DR: Using the proposed data structure, several dynamic algorithms for solving problems as listing the cliques of a given size, recognizing diamond-free graphs, and finding simple, simplicial and dominated vertices are described.

TL;DR: A graph G that has no subgraph isomorphic to a graph H is called H-free and this paper solves the Vertex Coloring problem by showing polynomial-time solvability.

TL;DR: This paper considers the case that the lengths of the lists are bounded by some integer d, and shows that, even if d=3, there is some c>1 such that the problem of finding a matching with the minimum number of blocking pairs is not approximable within c unless P=NP.

TL;DR: It is shown that in the case of systems that are not computationally complete (with total size equal to 4), the computational completeness can be obtained by introducing the matrix control and using only binary matrices.

TL;DR: In this paper, the problem of reconstructing a near perfect phylogeny over a binary set of characters where characters can be gained and lost at most once is considered. But the problem is not restricted to binary perfect phylogenies.

TL;DR: It is shown that the branching bisimulation is the coarsest congruence for parallel composition that is included in the weaker version of the present equivalence, and that probabilistic CTL formulae are preserved by the equivalence.

TL;DR: A one-dimensional solution that is based on multiplying numbers by a suitable constant is described and the automaton to multiply by constant 3/2 is shown to be related to some difficult open questions in number theory.

TL;DR: A new category of typed attributed graphs with inheritance is introduced and the notion of abstract critical pairs is defined for the detection of conflicts between graph transformations on these graphs, which allows the analysis on polymorphic rules and transformations without the need for flattening.

TL;DR: A model of computation as an unbounded process, measuring complexity by the number of observed behavioural changes during the computation, bringing effective unbounded computation up to the second level of the Arithmetical Hierarchy, unifying several earlier concepts like trial-and-error predicates and relativistic computing.