Theoretical computer science

Mehr zum Buch

This collection features a range of invited and technical contributions exploring various challenges and advancements in computer science and related fields. Topics include semantic subtyping, biological systems as reactive systems, and security issues in mobile agent computing. The technical contributions cover efficient algorithms for detecting regular point configurations and address the complexities of moving objects on broken lines. Key discussions include static analysis of PKI-based systems, logical subtyping of object and recursive types, and the interplay between circuits, computations, and classical logic. The collection also delves into local policy checks for risky events, the confluence and expressiveness of graph rewriting calculus, and safe object composition amid subtyping. Additional studies tackle reachability analysis in boxed ambients, error mining for regex patterns, and reconstructing binary matrices from orthogonal projections. Inapproximability results for gene transfer problems, advancements in deterministic wakeup algorithms, and complexity results in weighted coloring are highlighted. Moreover, quantum algorithms for group theoretic problems and a polymerase-based SAT algorithm are discussed, alongside insights into broadcast scheduling and the enforcement of mathematical properties in complexity theory. Theoretical analyses of alignment and edit problems for trees, as well as advancements in typ