default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID41. SOFSEM 2015: Pec pod Sněžkou, Czech Republic
- Giuseppe F. Italiano
, Tiziana Margaria-Steffen, Jaroslav Pokorný, Jean-Jacques Quisquater, Roger Wattenhofer:
SOFSEM 2015: Theory and Practice of Computer Science - 41st International Conference on Current Trends in Theory and Practice of Computer Science, Pec pod Sněžkou, Czech Republic, January 24-29, 2015. Proceedings. Lecture Notes in Computer Science 8939, Springer 2015, ISBN 978-3-662-46077-1
Invited Talks
- Jirí Wiedermann, Jan van Leeuwen:
What is Computation: An Epistemic Approach. 1-13 - Magnús M. Halldórsson:
Progress (and Lack Thereof) for Graph Coloring Approximation Problems. 14-23 - Jared Saia, Mahdi Zamani:
Recent Results in Scalable Multi-Party Computation. 24-44 - Piotr Sankowski:
Online Bipartite Matching in Offline Time (Abstract). 45 - Jiri Barnat:
Quo Vadis Explicit-State Model Checking. 46-57 - Brian Fitzgerald, Klaas-Jan Stol:
The Dos and Dont's of Crowdsourcing Software Development. 58-64 - Barbara Catania, Giovanna Guerrini:
Adaptively Approximate Techniques in Distributed Architectures. 65-77 - Rainer Manthey:
Back to the Future - Should SQL Surrender to SPARQL? 78-101
Regular Papers
- Alessandro Aloisio, Alfredo Navarra:
Balancing Energy Consumption for the Establishment of Multi-interface Networks. 102-114 - Michael A. Bekos, Michael Kaufmann, Stephen G. Kobourov, Sankar Veeramoni:
The Maximum k-Differential Coloring Problem. 115-127 - Alberto Bertoni, Massimiliano Goldwurm, Jianyi Lin:
Exact Algorithms for 2-Clustering with Size Constraints in the Euclidean Plane. 128-139 - Prosenjit Bose, Stephane Durocher, Debajyoti Mondal, Maxime Peabody, Matthew Skala, Mohammad Abdul Wahid:
Local Routing in Convex Subdivisions. 140-151 - Ferenc Bujtor, Sascha Fendrich, Gerald Lüttgen, Walter Vogler:
Nondeterministic Modal Interfaces. 152-163 - Marek Chrobak, Leszek Gasieniec, Thomas Gorry, Russell Martin:
Group Search on the Line. 164-176 - Jérôme Dohrau:
Online Makespan Scheduling with Sublinear Advice. 177-188 - Ashley Farrugia, Leszek Gasieniec, Lukasz Kuszner, Eduardo Pacheco:
Deterministic Rendezvous in Restricted Graphs. 189-200 - Armin Fügenschuh, Konstanty Junosza-Szaniawski, Torsten Klug, Slawomir Kwasiborski, Thomas Schlechte:
Fastest, Average and Quantile Schedule. 201-216 - Ronald de Haan, Stefan Szeider:
Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP. 217-229 - Allan van Hulst, Michel A. Reniers, Wan J. Fokkink:
Maximally Permissive Controlled System Synthesis for Modal Logic. 230-241 - Thomas Hume, Hayssam Soueidan, Macha Nikolski, Guillaume Blin:
Approximation Hardness of the Cross-Species Conserved Active Modules Detection Problem. 242-253 - Falk Hüffner, Christian Komusiewicz, Manuel Sorge:
Finding Highly Connected Subgraphs. 254-265 - Konstanty Junosza-Szaniawski, Mathieu Liedloff, Pawel Rzazewski:
Fixing Improper Colorings of Graphs. 266-276 - Shahin Kamali, Alejandro López-Ortiz:
Efficient Online Strategies for Renting Servers in the Cloud. 277-288 - Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur:
Pal k is Linear Recognizable Online. 289-301 - Peter Kostolányi:
Two Grammatical Equivalents of Flip-Pushdown Automata. 302-313 - Rihards Krislauks, Kaspars Balodis:
On the Hierarchy Classes of Finite Ultrametric Automata. 314-326 - Christian Laforest, Benjamin Momège:
Nash-Williams-type and Chvátal-type Conditions in One-Conflict Graphs. 327-338 - Nelma Moreira, Giovanni Pighizzini, Rogério Reis:
Optimal State Reductions of Automata with Partially Specified Behaviors. 339-351 - Masaki Nakanishi:
Quantum Pushdown Automata with a Garbage Tape. 352-363 - Ragnar Nevries, Christian Rosenke:
Towards a Characterization of Leaf Powers by Clique Arrangements. 364-376 - Hiroaki Ookawa, Taisuke Izumi:
Filling Logarithmic Gaps in Distributed Complexity for Global Problems. 377-388 - Friedrich Otto:
On Visibly Pushdown Trace Languages. 389-400 - Ralf Rothenberger, Sascha Grau, Michael Rossberg:
Dominating an s-t-Cut in a Network. 401-411 - Kei Uchizawa, Eiji Takimoto:
Lower Bounds for Linear Decision Trees with Bounded Weights. 412-422 - Valerio Cosentino, Massimo Tisi, Javier Luis Cánovas Izquierdo:
A Model-Driven Approach to Generate External DSLs from Object-Oriented APIs. 423-435 - Florian Himmler:
Function Based Requirements Engineering and Design -Towards Efficient and Transparent Plant Engineering. 436-448 - Martin Konopka, Mária Bieliková:
Software Developer Activity as a Source for Identifying Hidden Source Code Dependencies. 449-462 - Lotte B. Romijn, Breanndán Ó Nualláin, Leen Torenvliet:
Discovering Motifs in Real-World Social Networks. 463-474
Data, Information, and Knowledge Engineering
- Andreas Bögl, Michael Karlinger, Christoph G. Schütz, Michael Schrefl, Gustav Pomberger:
Exploiting Semantic Activity Labels to Facilitate Consistent Specialization of Abstract Process Activities. 475-485 - Nieves R. Brisaboa, Ana Cerdeira-Pena, Veronica Gil-Costa, Mauricio Marín, Oscar Pedreira:
Efficient Similarity Search by Combining Indexing and Caching Strategies. 486-497 - Vladimir Soares Catão, Marcus Costa Sampaio, Ulrich Schiel:
Retrieving Documents Related to Database Queries. 498-510 - Seyed Amin Mirlohi Falavarjani, Gholamreza Ghassem-Sani:
Advantages of Dependency Parsing for Free Word Order Natural Languages. 511-518 - Michal Holub, Ondrej Proksa, Mária Bieliková:
Detecting Identical Entities in the Semantic Web Data. 519-530 - Martin Labaj, Mária Bieliková:
Conducting a Web Browsing Behaviour Study - An Educational Scenario. 531-542 - Pavel Labath, Joachim Niehren:
A Uniform Programmning Language for Implementing XML Standards. 543-554 - Carlos Roberto Valêncio, Diogo Lemos Guimaraes, Geraldo F. D. Zafalon, Leandro Alves Neves, Angelo Cesar Colombini:
OntoSDM: An Approach to Improve Quality on Spatial Data Mining Algorithms. 555-565
Cryptography, Security, and Verification
- Máté Horváth:
Attribute-Based Encryption Optimized for Cloud Computing. 566-577 - Hamed Nemati, Roberto Guanciale, Mads Dam:
Trustworthy Virtualization of the ARMv7 Memory Subsystem. 578-589 - Maciej Skorski:
True Random Number Generators Secure in a Changing Environment: Improved Security Bounds. 590-602 - Maciej Zielenkiewicz, Jacek Chrzaszcz, Aleksy Schubert:
Java Loops Are Mainly Polynomial. 603-614
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:
