Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID43. SOFSEM 2017: Limerick, Ireland
- Bernhard Steffen, Christel Baier, Mark van den Brand
, Johann Eder, Mike Hinchey, Tiziana Margaria:
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. Lecture Notes in Computer Science 10139, Springer 2017, ISBN 978-3-319-51962-3
Foundations in Computer Science
- Kim Guldstrand Larsen:
Dependable and Optimal Cyber-Physical Systems. 3-10 - Igor Walukiewicz:
Verifying Parametric Thread Creation. 11-14 - Othon Michail, Paul G. Spirakis:
Network Constructors: A Model for Programmable Matter. 15-34
Semantics, Specification and Compositionality
- Luca Aceto, Ignacio Fábregas, Carlos Gregorio-Rodríguez, Anna Ingólfsdóttir:
Logical Characterisations and Compositionality of Input-Output Conformance Simulation. 37-48 - Uli Fahrenberg, Axel Legay:
A Linear-Time-Branching-Time Spectrum of Behavioral Specification Theories. 49-61 - Linda Brodo, Carlos Olarte:
Symbolic Semantics for Multiparty Interactions in the Link-Calculus. 62-75
Theory of Mobile and Distributed Systems
- Evangelos Kranakis, Danny Krizanc, Euripides Markou, Aris Pagourtzis, Felipe Ramírez:
Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs. 79-90 - Petr Jancar:
Deciding Structural Liveness of Petri Nets. 91-102 - Keyvan Azadbakht, Nikolaos Bezirgiannis, Frank S. de Boer:
Distributed Network Generation Based on Preferential Attachment in ABS. 103-115
Verification and Automated System Analysis
- Zhaowei Xu, Wenhui Zhang, Yuefei Sui:
Completeness of Hoare Logic Relative to the Standard Model. 119-131 - Eike Best, Nataliya S. Gribovskaya, Irina B. Virbitskaite:
Configuration- and Residual-Based Transition Systems for Event Structures with Asymmetric Conflict. 132-146 - Robert M. Hierons, Mohammad Reza Mousavi, Michael Kirkedal Thomsen, Uraz Cengiz Türker:
Hardness of Deriving Invertible Sequences from Finite State Machines. 147-160
Petri Nets, Games and Relaxed Data Structures
- Eike Best, Raymond R. Devillers, Uli Schlachter:
A Graph-Theoretical Characterisation of State Separation. 163-175 - Dimitris Fotakis, Laurent Gourvès, Jérôme Monnot:
Selfish Transportation Games. 176-187 - Chao Wang, Yi Lv, Peng Wu:
Decomposable Relaxation for Concurrent Data Structures. 188-202
Graph Theory and Scheduling Algorithms
- Benjamin Momège:
Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path. 205-216 - Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi:
Enumerating Minimal Tropical Connected Sets. 217-228 - Leszek Gasieniec, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik:
Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors). 229-240
Quantum and Matrix Algorithms
- Andris Ambainis, Janis Iraids, Daniel Nagaj:
Exact Quantum Query Complexity of \text EXACT_k, l^n. 243-255 - Nikolajs Nahimovs, Raqueline A. M. Santos:
Adjacent Vertices Can Be Hard to Find by Quantum Walks. 256-267 - Sang-Ki Ko, Igor Potapov:
Matrix Semigroup Freeness Problems in SL (2, \mathbb Z). 268-279
Planar and Molecular Graphs
- Therese Biedl, Martin Derka:
Order-Preserving 1-String Representations of Planar Graphs. 283-294 - Thomas Bläsius, Marcel Radermacher, Ignaz Rutter:
How to Draw a Planarization. 295-308 - Andre Droschinsky, Nils M. Kriege, Petra Mutzel:
Finding Largest Common Substructures of Molecules in Quadratic Time. 309-321
Coloring and Vertex Covers
- Grzegorz Gutowski, Patryk Mikos:
Lower Bounds for On-line Interval Coloring with Vector and Cardinality Constraints. 325-335 - R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale:
Parameterized and Exact Algorithms for Class Domination Coloring. 336-349 - Vahan Mkrtchyan, Ojas Parekh, Danny Segev, K. Subramani:
The Approximability of Partial Vertex Covers in Trees. 350-360
Algorithms for Strings and Formal Languages
- Yohei Ueki, Diptarama, Masatoshi Kurihara, Yoshiaki Matsuoka, Kazuyuki Narisawa, Ryo Yoshinaka, Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara:
Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings. 363-374 - Shintaro Narisada, Diptarama, Kazuyuki Narisawa, Shunsuke Inenaga, Ayumi Shinohara:
Computing Longest Single-arm-gapped Palindromes in a String. 375-386 - Yo-Sub Han, Sang-Ki Ko:
Edit-Distance Between Visibly Pushdown Languages. 387-401
Data, Information and Knowledge Engineering
- Oscar Pastor:
Model-Driven Development in Practice: From Requirements to Code. 405-410 - Julián Alarte, David Insa, Josep Silva:
Webpage Menu Detection Based on DOM. 411-422 - Athanasios Kokkos, Theodoros Tzouramanis, Yannis Manolopoulos:
A Hybrid Model for Linking Multiple Social Identities Across Heterogeneous Online Social Networks. 423-435 - Selma Bouarar, Ladjel Bellatreche, Amine Roukh:
Eco-Data Warehouse Design Through Logical Variability. 436-449
Software Engineering: Methods, Tools, Applications
- Axel Legay, Gilles Perrouin, Xavier Devroey, Maxime Cordy, Pierre-Yves Schobbens, Patrick Heymans:
On Featured Transition Systems. 453-463 - Marjan Mernik:
Domain-Specific Languages: A Systematic Mapping Study. 464-472 - Jana St'astná, Martin Tomásek:
Characterising Malicious Software with High-Level Behavioural Patterns. 473-484 - Rocco De Nicola, Tan Duong, Omar Inverso, Catia Trubiani:
AErlang at Work. 485-497 - Frank Fowley, Divyaa Manimaran Elango, Hany Magar, Claus Pahl:
Software System Migration to Cloud-Native Architectures for SME-Sized Software Vendors. 498-509 - Önder Babur, Loek Cleophas:
Using n-grams for the Automated Clustering of Structural Models. 510-524
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-26 18:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
