SOFSEM 2011: Theory and Practice of Computer Science" ed. by Ivana Černá, et al. (Repost)

This book constitutes the refereed proceedings of the 37th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2011.

SOFSEM 2011 was organized around the following four tracks: foundations of computer science; software, systems, and services; processing large datasets; and cryptography, security, and trust.

Table of Contents
Preface
Conference Organization
Integrity and Consistency for Untrusted Services
A Structured Codesign Approach to Many-Core Architectures for Embedded Systems
SIMPL Systems, or: Can We Design Cryptographic Hardware without Secret Key Information?
Verification of Timed-Arc Petri Nets
Efficient Algorithms for Handling Nondeterm in istic Automata
The Straight-Line RAC Drawing Problem Is NP-Hard
Tracking the Evolution of Code Clones
Liquidsoap: A High-Level Programming Language for Multimedia Streaming
Combining Traditional Map Labeling with Boundary Labeling
On Making a Distinguished Vertex Minimum Degree by Vertex Deletion
Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size
GreedyMAX-type Algorithms for the Maximum Independent Set Problem
Sequential Optimization of Matrix Chain Multiplication Relative to Different Cost Functions
One-Reversal Counter Machines and Multihead Automata: Revisited
Co 11 is ion less Gathering of Robots with an Extent
Min-Max Coverage in Multi-interface Networks
Bandwidth Constrained Multi-interface Networks
A Privacy-Preserving ID-Based Group Key Agreement Scheme Applied in VPAN
White Space Regions
New Results on the Complexity of the Max- and Min-Rep Problems
In-Place Sorting
On $d$-Regular Schematization of Embedded Paths
Upward Point-Set Embeddability
Cooperative Query Answering by Abstract Interpretation
An Improved B+ Tree for Flash File Systems
Comparing GPU and CPU in OLAP Cubes Creation
A Power Consumption Analysis Technique Using UML-Based Design Models in Embedded Software Development
Advice Complexity and Barely Random Algorithms
Alternative Parameterizations for Cluster Editing
The Complexity of Finding kth Most Probable Explanations in Probabilistic Networks
Optimal File-Distribution in Heterogeneous and Asymmetric Storage Networks
On the Complexity of the Metric TSP under Stability Considerations
Structural Properties of Hard Metric TSP Inputs
An Automata-Theoretical Characterization of Context-Free Trace Languages
Unambiguous UML Composite Structures: The OMEGA2 Experience
Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages
A Local Search Algorithm for Branch width
Finding the Description of Structure by Counting Method: A Case Study
On Approximating the £d£-Girth of a Graph
SScAC: Towards a Framework for Small-Scale Software Architectures Comparison
Folk Theorems on the Correspondence between State-Based and Event-Based Systems
Privacy, Liveliness and Fairness for Reputation
Minimizing Interference for the Highway Model in Wireless Ad-Hoc and Sensor Networks
Join-Queries between Two Spatial Datasets Indexed by a Single R*-Tree
Information Leakage Analysis by Abstract Interpretation
Partition into Triangles on Bounded Degree Graphs
Author Index

http://nitroflare.com/view/2F8B9CBF2860BA8/SOFSEM2011TheoryPracticeComputerScience.pdf