Full Description
This book
constitutes the proceedings of the 42nd International Conference on Current
Trends in Theory and Practice of Computer Science, SOFSEM 2016, held in
Harrachov, Czech Republic, in January 2016.
The 43 full
papers presented in this volume were carefully reviewed and selected from 116
submissions. They are organized in topical sections named: foundations of
computer science; software engineering: methods, tools, applications; and data,
information, and knowledge engineering. The volume also contains 7 invited
talks in full paper length.
Contents
Foundations of Computer Science.- Cryptography
in a Quantum World.- Relating Sublinear Space Computability among Graph
Connectivity and Related Problems.- Learning Automatic Families of Languages.- Software
Engineering: Methods, Tools, Applications From ESSENCE to Theory Oriented
Software Engineering.- Incremental Queries and Transformations: From Concepts to
Industrial Applications.- Data, Information, and Knowledge Engineering Big
Sequence Management: A Glimpse on the Past, the Present, and the Future.- Pay-as-you-go
Data Integration: Experiences and Recurring Themes.- Foundations of Computer
Science.- Robust Recoverable Path Using Backup Nodes.- On Contact Graphs with
Cubes and Proportional Boxes.- Orthogonal Layout with Optimal Face Complexity.-
L-Drawings of Directed Graphs.- A Combinatorial Model of Two-sided Search.- On
the Power of Laconic Advice in Communication Complexity.- Using Attribute
Grammars to Model Nested Workflows with Extra Constraints.- A Natural Counting
of Lambda Terms.- Online Minimum Spanning Tree with Advice.- Subsequence Automata
with Default Transitions.- Run-Time Checking Multi-threaded Java Programs.- Online
Graph Coloring with Advice and Randomized Adversary.- Pseudoknot-Generating
Operation.- Capabilities of Ultrametric Automata with One, Two, and Three
States.- The Complexity of Paging Against a Probabilistic Adversary.- On Parity
Game Preorders and the Logic of Matching Plays.- A PTAS for Scheduling
Unrelated Machines of Few Different Types.- Compacting a Dynamic Edit Distance
Table by RLE Compression.- Walking Automata in Free Inverse Monoids.- Precedence
Scheduling with Unit Execution Time is Equivalent to Parametrized Biclique.- Grover's
Search with Faults on Some Marked Elements.- Reachability problems for PAMs.- On
the Effects of Nondeterminism on Ordered Restarting Automata.- Quantum Walks on
Two-Dimensional Grids with Multiple Marked Locations.- How to Smooth Entropy?.-
Bounded TSO-to-SC Linearizability is Decidable.- Probabilistic Autoreductions.-
Software Engineering: Methods, Tools, Applications ABS: A High-Level Modeling Language for
Cloud-Aware Programming.- Aspect, Rich, and Anemic Domain Models in Enterprise Information
Systems.- Finding Optimal Compatible Set of Software Components Using Integer Linear
Programming.- Effective Parallel Multicore-optimized K-mers Counting
Algorithm.- Meta-Evolution Style for Software Architecture Evolution.- The
Simulation Relation for Formal e-contracts.- Data, Information, and Knowledge
Engineering Solving the Problem of Selecting Suitable Objective Measures by Clustering
Association Rules through the Measures Themselves.- Survey On Concern Separation
in Service Integration.- Utilizing Vector Models for Automatic Text
Lemmatization.- Improving Keyword Extraction from Movie Subtitles by Utilizing Temporal Properties.- Identification of
Navigation Lead Candidates Using Citation and Co-Citation Analysis.- Summarizing
Online User Reviews Using Bicliques.-Post-Processing Association Rules: a
Network Based Label Propagation Approach.- Application of Multiple Sound
Representations in Multipitch Estimation Using Shift-Invariant Probabilistic
Latent Component Analysis.- Projection for Nested Word Automata Speeds up XPath
Evaluation on XML Streams.- Evaluation of Static/Dynamic Cache for Similarity
Search Engines.
