Let As,k(m) be the maximum number of distinct letters in any sequence which can be partitioned into m contiguous blocks of pairwise distinct letters, has at least k occurrences of every letter, and has no subsequence forming an alternation of length s. Nivasch (2010) proved that A5,2d+1(m) = θ(mαd(m)) for all fixed d ≥ 2. We show that As+1,s(m) = ( m−⌈ s 2 ⌉ ⌊ s 2 ⌋ ) for all s ≥ 2, A5,6(m) = θ...

Let G be a nontrivial connected graph of order n and let k be an integer with 2 ≤ k ≤ n. For a set S of k vertices of G, let κ(S) denote the maximum number l of edge-disjoint trees T1, T2, . . . , Tl in G such that V (Ti)∩V (Tj) = S for every pair i, j of distinct integers with 1 ≤ i, j ≤ l. A collection {T1, T2, . . . , Tl} of trees in G with this property is called an internally disjoint set ...

Mobile computing is a new emerging computing paradigm posing many challenging data management problems. We identify these new challenges and investigate their technical signi cance. New research problems include management of location dependent data, frequent disconnections, structuring distributed algorithms for mobile hosts, wireless data broadcasting, and energy e cient data access.

Differential power analysis targets S-boxes to break ciphers that resist cryptanalysis. We relax cryptanalytic constraints to lower S-box leakage, as quantified by the transparency order. We apply genetic algorithms to generate 8-bit S-boxes, optimizing transparency order and nonlinearity as in existing work (Picek et al. 2015). We apply multiobjective evolutionary algorithms to generate a Pare...