default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID40. SOFSEM 2014: Nový Smokovec, Slovakia
- Viliam Geffert, Bart Preneel, Branislav Rovan, Julius Stuller, A Min Tjoa:
SOFSEM 2014: Theory and Practice of Computer Science - 40th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 26-29, 2014, Proceedings. Lecture Notes in Computer Science 8327, Springer 2014, ISBN 978-3-319-04297-8
Invited Papers
- Miklós Biró
:
Open Services for Software Process Compliance Engineering. 1-6 - David Janin:
Towards a Higher-Dimensional String Theory for the Modeling of Computerized Systems. 7-20 - Rastislav Královic:
Advice Complexity: Quantitative Approach to A-Priori Information - (Extended Abstract). 21-29 - Dmytro Mishkin, Jiri Matas:
Matching of Images of Non-planar Objects with View Synthesis. 30-39 - Jerzy R. Nawrocki, Miroslaw Ochodek, Jakub Jurkiewicz, Sylwia Kopczynska, Bartosz Alchimowicz:
Agile Requirements Engineering: A Research Perspective. 40-51
Contributed Papers
- Md. Jawaherul Alam, Michael Kaufmann, Stephen G. Kobourov, Tamara Mchedlidze:
Fitting Planar Graphs on Planar Maps. 52-64 - Hasna Mohsen Alqahtani, Thomas Erlebach:
Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded Treewidth. 65-76 - Kfir Barhum:
Tight Bounds for the Advice Complexity of the Online Minimum Steiner Tree Problem. 77-88 - Kfir Barhum, Hans-Joachim Böckenhauer, Michal Forisek, Heidi Gebauer, Juraj Hromkovic, Sacha Krug, Jasmin Smula, Björn Steffen:
On the Power of Advice and Randomization for the Disjoint Path Allocation Problem. 89-101 - Kristian Beckers:
Goal-Based Establishment of an Information Security Management System Compliant to ISO 27001. 102-113 - Sebastian Biedermann, Nikolaos P. Karvelas, Stefan Katzenbeisser, Thorsten Strufe, Andreas Peter:
ProofBook: An Online Social Network Based on Proof-of-Work and Friend-Propagation. 114-125 - Mária Bieliková, Ivan Polásek, Michal Barla, Eduard Kuric, Karol Rástocný, Jozef Tvarozek, Peter Lacko:
Platform Independent Software Development Monitoring: Design of an Architecture. 126-137 - Guillaume Blin, Paul Morel, Romeo Rizzi, Stéphane Vialette:
Towards Unlocking the Full Potential of Multileaf Collimators. 138-149 - Marin Bougeret, Nicolas Bousquet, Rodolphe Giroudeau, Rémi Watrigant:
Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs. 150-161 - Ferenc Bujtor, Walter Vogler:
Error-Pruning in Interface Automata. 162-173 - Karel Cemus, Tomás Cerný:
Aspect-Driven Design of Information Systems. 174-186 - Manfred Cochefert, Dieter Kratsch:
Exact Algorithms to Clique-Colour Graphs. 187-198 - Valeria de Castro, Martin A. Musicante, Umberto Souza da Costa, Plácido A. Souza Neto, Genoveva Vargas-Solar:
Supporting Non-functional Requirements in Services Software Development Process: An MDD Approach. 199-210 - Iulia Dragomir, Iulian Ober, Christian Percebois:
Safety Contracts for Timed Reactive Components in SysML. 211-222 - Tobias Fleck, Andrea Kappes, Dorothea Wagner:
Graph Clustering with Surprise: Complexity and Exact Solutions. 223-234 - Allyx Fontaine, Yves Métivier, John Michael Robson, Akka Zemmari:
On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms - (Extended Abstract). 235-245 - Rusins Freivalds, Thomas Zeugmann:
Active Learning of Recursive Functions by Ultrametric Algorithms. 246-257 - Ran Gelles, Rafail Ostrovsky, Alan Roytman:
Efficient Error-Correcting Codes for Sliding Windows. 258-268 - Alessandro Gerlinger Romero, Klaus Schneider, Maurício Gonçalves Vieira Ferreira:
Integrating UML Composite Structures and fUML. 269-280 - Hugo Gimbert, Youssouf Oualhadj:
Deciding the Value 1 Problem for $\sharp$ -acyclic Partially Observable Markov Decision Processes. 281-292 - Alexander Grigoriev, Athanassios Koutsonas, Dimitrios M. Thilikos:
Bidimensionality of Geometric Intersection Graphs. 293-305 - Lucjan Hanzlik, Kamil Kluczniak:
Attack against a Pairing Based Anonymous Authentication Protocol. 306-314 - Pinar Heggernes, Pim van 't Hof, Erik Jan van Leeuwen, Reza Saei:
Finding Disjoint Paths in Split Graphs. 315-326 - Klaus Jansen, Lars Prädel:
A New Asymptotic Approximation Algorithm for 3-Dimensional Strip Packing. 327-338 - Natasa Jonoska, Florin Manea, Shinnosuke Seki:
A Stronger Square Conjecture on Binary Words. 339-350 - Audris Kalnins, Lelde Lace, Elina Kalnina, Agris Sostaks:
DSL Based Platform for Business Process Management. 351-362 - Tomoki Komatsu, Ryosuke Okuta, Kazuyuki Narisawa, Ayumi Shinohara:
Bounded Occurrence Edit Distance: A New Metric for String Similarity Joins with Edit Distance Constraints. 363-374 - Ivan Korec, Jirí Wiedermann:
Deterministic Verification of Integer Matrix Multiplication in Quadratic Time. 375-382 - Petr Kroha, Matthias Friedrich:
Comparison of Genetic Algorithms for Trading Strategies. 383-394 - Lukasz Krzywiecki, Przemyslaw Kubiak, Miroslaw Kutylowski:
Probabilistic Admissible Encoding on Elliptic Curves - Towards PACE with Generalized Integrated Mapping. 395-406 - Katerina Ksystra, Petros S. Stefaneas, Panayiotis Frangos:
An Algebraic Framework for Modeling of Reactive Rule-Based Intelligent Agents. 407-418 - Martin Kutrib, Katja Meckel, Matthias Wendlandt:
Parameterized Prefix Distance between Regular Languages. 419-430 - Frantisek Mráz, Friedrich Otto:
Ordered Restarting Automata for Picture Languages. 431-442 - Alexandros Palioudakis, Kai Salomaa, Selim G. Akl:
Unary NFAs with Limited Nondeterminism. 443-454 - Ladislav Peska, Peter Vojtás:
Recommending for Disloyal Customers with Low Consumption Rate. 455-465 - Aneta Poniszewska-Maranda:
Security Constraints in Modeling of Access Control Rules for Dynamic Information Systems. 466-477 - George Roumelis, Michael Vassilakopoulos, Antonio Corral, Yannis Manolopoulos:
A New Plane-Sweep Algorithm for the K-Closest-Pairs Query. 478-490 - Arthur Strasser, Benjamin Cool, Christoph Gernert, Christoph Knieke, Marco Körner, Dirk Niebuhr, Henrik Peters, Andreas Rausch, Oliver Brox, Stefanie Jauns-Seyfried, Hanno Jelden, Stefan Klie, Michael Krämer:
Mastering Erosion of Software Architecture in Automotive Software Product Lines. 491-502 - Kazuya Tsuruta, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Shortest Unique Substrings Queries in Optimal Time. 503-513 - Tomoyuki Yamakami:
Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages. 514-525
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 2025-11-02 21:01 CET 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:
