Titlebook: Computer Science – Theory and Applications; 12th International C Pascal Weil Conference proceedings 2017 Springer International Publishing

Ischemic-Stroke

Advances in Parameterized Verification of Population Protocols,nd thereby change their states. Computations are infinite sequences of interactions satisfying a strong fairness constraint..A population protocol is well specified if for every initial configuration . of devices, and every computation starting at ., all devices eventually agree on a consensus value

colony

Graph Sketching and Streaming: New Approaches for Analyzing Massive Graphs,ory, may be distributed across numerous machines, and may change over time. This has motivated a rich body of work on analyzing graphs in the data stream model and the development of general algorithmic techniques, such as graph sketching, that can help minimize the space and communication costs req

drusen

Can We Locally Compute Sparse Connected Subgraphs?,solve optimization problems on big data, we are presented with a double catastrophe, as .. One ray of hope is that often, the portion of the output that is needed by the user is, in fact, of a more manageable size. In such a situation, it would be useful if one could find very fast ways of computing

irreducible

Palindromic Decompositions with Gaps and Errors,iscovery of the relation of palindromes in the DNA sequence with the HIV virus. Efficient algorithms for the factorization of sequences into palindromes and maximal palindromes have been devised in recent years. We extend these studies by allowing gaps in decompositions and errors in palindromes, an

Morose

Cascade Heap: Towards Time-Optimal Extractions, heap with an “optimal” . operation. Assuming an arbitrary linear ordering of keys, a heap with . elements typically takes . time to extract the minimum. Extracting . elements faster is impossible as this would violate the . bound for comparison-based sorting. It is known, however, that is takes onl

Dendritic-Cells

Lymphocyte

,Green’s Relations in Finite Transformation Semigroups,achability in the (right/left/two-sided) Cayley graph. The equivalence classes then correspond to the strongly connected components. It is not difficult to show that, in the worst case, the number of equivalence classes is in the same order of magnitude as the number of elements. Another important p

內(nèi)疚

臭了生氣

Unary Coded PSPACE-Complete Languages in ASPACE(loglog n),hine using an initially delimited worktape of size .. As a consequence, the standard translation between unary languages accepted with . space and binary languages accepted with . space works for alternating machines . ...In general, if a binary language . is in ., i.e., if .?is accepted by a determ

無(wú)瑕疵

Turing Degree Spectra of Minimal Subshifts,erns. It has been proved by Jeandel and Vanier that the Turing degree spectra of non-periodic minimal subshifts always contain the cone of Turing degrees above any of its degrees. It was however not known whether each minimal subshift’s spectrum was formed of exactly one cone or not. We construct in