SOFSEM 2017: Theory and Practice of Computer Science : 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Limerick, Ireland, January 16-20, 2017, Proceedings /
| Autor Corporativo: | |
|---|---|
| Otros Autores: | , , , , , |
| Formato: | eBook |
| Lenguaje: | English |
| Publicado: |
Cham :
Springer International Publishing : Imprint: Springer,
2017.
|
| Edición: | 1st ed. 2017. |
| Colección: | Theoretical Computer Science and General Issues ;
10139 |
| Materias: |
Tabla de Contenidos:
- Dependable and Optimal Cyber-Physical Systems
- Verifying Parametric Thread Creation
- Network Constructors: A Model for Programmable Matter
- Logical characterisations and compositionality of input-output conformance simulation
- A Linear-Time Branching-Time Spectrum of Behavioral Specification Theories
- Symbolic semantics for multiparty interactions in the link-calculus
- Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs
- Deciding structural liveness of Petri nets
- Distributed Network Generation based on Preferential Attachment in ABS
- Completeness of Hoare Logic Relative to the Standard Model
- Configuration- and Residual-Based Transition Systems for Event Structures with Asymmetric Conflict
- Hardness of deriving invertible sequences from finite state machines
- A Graph-theoretical Characterisation of State Separation
- Selfish Transportation Games
- Decomposable Relaxation for Concurrent Data Structures
- Sufficient Conditions for a Connected Graph to have a Hamiltonian Path
- Enumerating Minimal Tropical Connected Sets
- Bamboo Garden Trimming Problem (Perpetual maintenance of machines with different attendance urgency factors)
- Exact quantum query complexity of EXACT_{k,l} n
- Adjacent vertices can be hard to find by quantum walks
- Matrix semigroup freeness problems in SL(2,Z)
- Order-preserving 1-string representations of planar graphs
- How to Draw a Planarization
- Finding Largest Common Substructures of Molecules in Quadratic Time
- Lower Bounds for On-line Interval Coloring with Vector and Cardinality Constraints
- Parameterized and Exact Algorithms for Class Domination Coloring
- The Approximability of Partial Vertex Covers in Trees
- Longest Common Subsequence in at Least k Length Order-isomorphic Substrings
- Computing longest single-arm-gapped palindromes in a string
- Edit-Distance between Visibly Pushdown Languages
- Trends and Challenges in Predictive Analytics
- Model-driven Development in Practice: From Requirements to Code
- Webpage Menu Detection Based on DOM
- A Hybrid Model for Linking Multiple Social Identities across Heterogeneous Online Social Networks
- Eco Data Warehouse Design Through Logical Variability
- On Featured Transition Systems
- Domain-Specific Languages: A Systematic Mapping Study
- Characterising Malicious Software with High-Level Behavioural Patterns
- AErlang at work
- Software Systems Migration towards Cloud-native Architectures for SME-sized Software Vendors
- Using n-grams for the Automated Clustering of Structural Models.