default search action
39. SOFSEM 2013: Špindlerův Mlýn, Czech Republic
- Peter van Emde Boas, Frans C. A. Groen, Giuseppe F. Italiano, Jerzy R. Nawrocki, Harald Sack:
SOFSEM 2013: Theory and Practice of Computer Science, 39th International Conference on Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic, January 26-31, 2013. Proceedings. Lecture Notes in Computer Science 7741, Springer 2013, ISBN 978-3-642-35842-5
Invited Talks
- Ernie Cohen, Wolfgang J. Paul, Sabine Schmaltz:
Theory of Multi Core Hypervisor Verification. 1-27 - Frantisek Plásil, Tomás Bures:
Software Components in Computer Assisted Living? 28 - Peter Sanders:
Engineering Algorithms for Large Data Sets. 29-32 - Gerhard J. Woeginger:
Core Stability in Hedonic Coalition Formation. 33-50 - Sjaak Brinkkemper:
Software Production: A New Paradigm for Software Engineering Research. 51 - Carsten Kolassa
, Dirk Riehle, Michel A. Salim:
A Model of the Commit Size Distribution of Open Source. 52-66 - Michel Buffa
ISICIL: Semantics and Social Networks for Business Intelligence. 67-85 - Aldo Gangemi
A Multi-dimensional Comparison of Ontology Design Patterns for Representing n-ary Relations. 86-105 - Michael Beetz:
Cognition-Enabled Autonomous Robot Control for the Realization of Home Chore Task Intelligence. 106 - Arnold W. M. Smeulders:
Searching Things in Large Sets of Images. 107
Regular Papers
- Luca Aceto, Eugen-Ioan Goriac, Anna Ingólfsdóttir:
SOS Rule Formats for Idempotent Terms and Idempotent Unary Operators. 108-120 - Andris Ambainis, Arturs Backurs, Kaspars Balodis
Worst Case Analysis of Non-local Games. 121-132 - Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Two-Dimensional Rational Automata: A Bridge Unifying One- and Two-Dimensional Language Theory. 133-145 - Maxim A. Babenko:
Flow Decompositions in External Memory. 146-156 - Hans-Joachim Böckenhauer, Monika Steinová:
Improved Approximations for Ordered TSP on Near-Metric Graphs, . 157-168 - Michele Boreale
Asymptotic Risk Analysis for Trust and Reputation Systems. 169-181 - Britta Dorn, Dominikus Krüger:
Being Caught between a Rock and a Hard Place in an Election - Voter Deterrence by Deletion of Candidates. 182-193 - Feodor F. Dragan, Muad Abu-Ata:
Collective Additive Tree Spanners of Bounded Tree-Breadth Graphs with Generalizations and Consequences. 194-206 - Stijn de Gouw
Weak Arithmetic Completeness of Object-Oriented First-Order Assertion Networks. 207-219 - Matthew Gwynne
Generalising and Unifying SLUR and Unit-Refutation Completeness. 220-232 - Sepp Hartung, Christian Komusiewicz
On Structural Parameterizations for the 2-Club Problem. 233-243 - David Janin:
On Languages of One-Dimensional Overlapping Tiles. 244-256 - Mamadou Moustapha Kanté, Christian Laforest, Benjamin Momège:
An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions. 257-267 - Mamadou Moustapha Kanté, Lhouari Nourine:
Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs. 268-279 - Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara
Permuted Pattern Matching on Multi-track Strings. 280-291 - Balázs Keszegh, Nathan Lemons, Dömötör Pálvölgyi
Online and Quasi-online Colorings of Wedges and Intervals. 292-306 - Violetta Lonati
Logic Characterization of Invisibly Structured Languages: The Case of Floyd Languages. 307-318 - Eva Maia
Incomplete Transition Complexity of Some Basic Operations. 319-331 - George B. Mertzios, Paul G. Spirakis:
Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs. 332-343 - Ehab Morsy:
Approximating the k-Splittable Capacitated Network Design Problem. 344-355 - Michael Rink:
Mixed Hypergraphs for Linear-Time Construction of Denser Hashing-Based Data Structures. 356-368 - Jurriaan Rot, Marcello M. Bonsangue
Coalgebraic Bisimulation-Up-To. 369-381 - Jesús Manuel Almendros-Jiménez
A Model Transformation Language Based on Logic Programming. 382-394 - Tim Frey, Matthias Gräf:
Hypermodelling Reporting: Towards Cockpits for Code Structure. 395-407 - Eduard Kuric
Search in Source Code Based on Identifying Popular Fragments. 408-419 - Richard Lipka, Tomas Potuzak
SimCo - Hybrid Simulator for Testing of Component Based Applications. 420-431 - Lunjin Lu, Dae-Kyoo Kim:
Refinement Inference for Sequence Diagrams. 432-444 - Milan Lucanský, Marián Simko
Improving Relevance of Keyword Extraction from the Web Utilizing Visual Style Information. 445-456 - Tomás Uhercík, Marián Simko
Utilizing Microblogs for Web Page Relevant Term Acquisition. 457-468 - Dries Vanoverberghe, Emma Eyckmans, Frank Piessens:
State Coverage: An Empirical Analysis Based on a User Study. 469-480 - Lukás Bajer, Martin Holena:
Surrogate Model for Mixed-Variables Evolutionary Optimization Based on GLM and RBF Networks. 481-490 - András Dobó, János Csirik:
Computing Semantic Similarity Using Large Static Corpora. 491-502 - Sergejs Kozlovics
The Orchestra of Multiple Model Repositories. 503-514 - Václav Slavícek:
An Ontology-Driven Fuzzy Workflow System. 515-527 - Ondrej Sváb-Zamazal, Anne Schlicht, Heiner Stuckenschmidt
Constructs Replacing and Complexity Downgrading via a Generic OWL Ontology Transformation Framework. 528-539 - Marek Takác, Alena Kovárová:
Tempo Adaptation within Interactive Music Instruments in Mobile Phone. 540-551 - Michail Tsikerdekis:
Dynamic Voting Interface in Social Media: Does it Affect Individual Votes? 552-563
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-12-30 19:15 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: