Titlebook: SOFSEM 2020: Theory and Practice of Computer Science; 46th International C Alexander Chatzigeorgiou,Riccardo Dondi,Florian Si Conference pr

解开

违反

Bounds for the Number of Tests in Non-adaptive Randomized Algorithms for Group Testingandomly choose the tests. For a model ., let . be the minimum number of tests required to detect at most . defectives within . items, with success probability at least ., for some constant .. In this paper, we study the measures .In the literature, the analyses of such models only give upper bounds

可用

Burning Two Worldsan be spread in a network. The burning process takes place in discrete rounds. In each round, a new fire breaks out at a selected vertex and burns it. Meanwhile, the old fires extend to their adjacent vertices and burn them. A . selects where the new fire breaks out in each round, and the . asks for

Systemic

Faster STR-EC-LCS Computation.. More recently, a set of four constrained LCS problems (called generalized constrained LCS problem) were proposed by Chen and Chao [J. Comb. Optim, 2011]. In this paper, we consider the substring-excluding constrained LCS (STR-EC-LCS) problem. A string . is said to be . . and . . . if, . is one of

incarcerate

繁荣地区

Minimal Unique Substrings and Minimal Absent Words in a Sliding Windowt twice in .. A string . is called a minimal absent word (MAW) of . if . does not occur in . and any proper substring of . occurs in .. In this paper, we study the problems of computing MUSs and MAWs in a sliding window over a given string .. We first show how the set of MUSs can change in a sliding

严峻考验

Outwit

On the Average State Complexity of Partial Derivative Transducersdard transducers (.) that can be defined for (general) 2. expressions where basic terms are pairs of ordinary regular expressions (1.). While in the worst case the number of states of . can be ., where . is the size of the expression, asymptotically and on average that value is bounded from above by

有常识

定点