SOFSEM 2017: Theory and Practice of Computer Science: Lecture Notes in Computer Science
Editat de Bernhard Steffen, Christel Baier, Mark van den Brand, Johann Eder, Mike Hinchey, Tiziana Margariaen Limba Engleză Paperback – 11 ian 2017
The 34 papers presented in this volume were carefully reviewed and selected from 41 submissions. They were organized in topical sections named: foundations in computer science; semantics, specification and compositionality; theory of mobile and distributed systems; verification and automated system analysis; petri nets, games and relaxed data structures; graph theory and scheduling algorithms; quantum and matrix algorithms; planar and molecular graphs; coloring and vertex covers; algorithms for strings and formal languages; data, information and knowledge engineering; and software engineering: methods, tools, applications.
Din seria Lecture Notes in Computer Science
- 20%
Preț: 461.83 lei - 20%
Preț: 461.57 lei - 20%
Preț: 424.26 lei - 20%
Preț: 390.69 lei - 20%
Preț: 498.50 lei - 15%
Preț: 388.50 lei - 20%
Preț: 390.35 lei - 20%
Preț: 460.98 lei - 20%
Preț: 461.52 lei - 20%
Preț: 497.55 lei - 20%
Preț: 389.72 lei - 20%
Preț: 461.83 lei - 20%
Preț: 389.90 lei - 20%
Preț: 497.04 lei - 20%
Preț: 462.05 lei - 20%
Preț: 391.14 lei - 20%
Preț: 389.85 lei - 20%
Preț: 461.32 lei - 20%
Preț: 498.32 lei - 20%
Preț: 496.64 lei - 20%
Preț: 532.28 lei - 20%
Preț: 527.36 lei - 20%
Preț: 498.46 lei - 15%
Preț: 461.85 lei - 20%
Preț: 390.12 lei - 20%
Preț: 532.41 lei - 20%
Preț: 462.24 lei - 20%
Preț: 391.14 lei - 20%
Preț: 461.77 lei - 20%
Preț: 390.35 lei - 20%
Preț: 461.06 lei - 20%
Preț: 461.65 lei - 20%
Preț: 390.18 lei - 20%
Preț: 392.64 lei - 20%
Preț: 252.15 lei - 20%
Preț: 390.94 lei - 20%
Preț: 461.52 lei - 20%
Preț: 391.86 lei - 20%
Preț: 532.54 lei - 20%
Preț: 462.67 lei - 20%
Preț: 461.65 lei - 20%
Preț: 639.72 lei - 20%
Preț: 255.91 lei - 15%
Preț: 535.92 lei - 20%
Preț: 535.77 lei - 5%
Preț: 516.27 lei - 20%
Preț: 499.36 lei - 20%
Preț: 391.20 lei - 20%
Preț: 391.20 lei - 20%
Preț: 249.95 lei
Preț: 333.61 lei
Preț vechi: 417.02 lei
-20% Nou
Puncte Express: 500
Preț estimativ în valută:
59.04€ • 69.24$ • 51.77£
59.04€ • 69.24$ • 51.77£
Carte tipărită la comandă
Livrare economică 26 ianuarie-09 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783319519623
ISBN-10: 331951962X
Pagini: 544
Ilustrații: XVIII, 526 p. 109 illus.
Dimensiuni: 155 x 235 x 30 mm
Greutate: 0.81 kg
Ediția:1st edition 2017
Editura: Springer
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
ISBN-10: 331951962X
Pagini: 544
Ilustrații: XVIII, 526 p. 109 illus.
Dimensiuni: 155 x 235 x 30 mm
Greutate: 0.81 kg
Ediția:1st edition 2017
Editura: Springer
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
Cuprins
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.
Caracteristici
Includes supplementary material: sn.pub/extras