SOFSEM 2016: Theory and Practice of Computer Science

Foundations of Computer Science.- Cryptographyin a Quantum World.- Relating Sublinear Space Computability among GraphConnectivity and Related Problems.- Learning Automatic Families of Languages.- SoftwareEngineering: Methods, Tools, Applications From ESSENCE to Theory OrientedSoftware Engineering.- Incremental Queries and Transformations: From Concepts toIndustrial Applications.- Data, Information, and Knowledge Engineering BigSequence Management: A Glimpse on the Past, the Present, and the Future.- Pay-as-you-goData Integration: Experiences and Recurring Themes.- Foundations of ComputerScience.- Robust Recoverable Path Using Backup Nodes.- On Contact Graphs withCubes and Proportional Boxes.- Orthogonal Layout with Optimal Face Complexity.-L-Drawings of Directed Graphs.- A Combinatorial Model of Two-sided Search.- Onthe Power of Laconic Advice in Communication Complexity.- Using AttributeGrammars to Model Nested Workflows with Extra Constraints.- A Natural Countingof Lambda Terms.- Online Minimum Spanning Tree with Advice.- Subsequence Automatawith Default Transitions.- Run-Time Checking Multi-threaded Java Programs.- OnlineGraph Coloring with Advice and Randomized Adversary.- Pseudoknot-GeneratingOperation.- Capabilities of Ultrametric Automata with One, Two, and ThreeStates.- The Complexity of Paging Against a Probabilistic Adversary.- On ParityGame Preorders and the Logic of Matching Plays.- A PTAS for SchedulingUnrelated Machines of Few Different Types.- Compacting a Dynamic Edit DistanceTable by RLE Compression.- Walking Automata in Free Inverse Monoids.- PrecedenceScheduling with Unit Execution Time is Equivalent to Parametrized Biclique.- Grover'sSearch with Faults on Some Marked Elements.- Reachability problems for PAMs.- Onthe Effects of Nondeterminism on Ordered Restarting Automata.- Quantum Walks onTwo-Dimensional Grids with Multiple Marked Locations.- How to Smooth Entropy?.-Bounded TSO-to-SC Linearizability is Decidable.- Probabilistic