Titlebook: SOFSEM 2021: Theory and Practice of Computer Science; 47th International C Tomáš Bureš,Riccardo Dondi,Prudence W.H. Wong Conference proceed

osculate

Interlocking

New Bounds on the Half-Duplex Communication Complexityical model of communication complexity introduced by Yao, in the half-duplex model, Alice and Bob can speak or listen simultaneously, as if they were talking using a walkie-talki.e. The motivation for such a communication model comes from the study of the KRW conjecture. Following the open questions

轻而薄

Towards Minimally Conscious Cyber-Physical Systems: A Manifestos to more trustworthy systems, as it strengthens their behavioral flexibility in varying environments and their resilience to operation and cooperation failures of their components and as a whole. The notion of minimal machine consciousness has the potential to become one of the defining attributes of Industry 4.0.

Comedienne

Balanced Independent and Dominating Sets on Colored Interval Graphsnd the other by the vertex cover number of .. Moreover, for an optimization variant of BIS on interval graphs, we present a polynomial time approximation scheme (PTAS) and an . time 2-approximation algorithm.

Costume

Coma704

Aggressive

0302-9743 Trends in Theory and Practice of Computer Science, which was held online during January 25–28, 2021, hosted by the Free University of Bozen-Bolzano, Italy..The 33 full and 7 short papers included in the volume were carefully reviewed and selected from 100 submissions. They were organized in topical

FOLLY

SEMI

ungainly

New Bounds on the Half-Duplex Communication Complexityomplexity of the Karchmer-Wigderson games for the counting functions and for the recursive majority function, adapting the ideas used in the classical communication complexity. Finally, we define the non-deterministic half-duplex complexity and establish bounds connecting it with non-deterministic complexity in the classical model.