Book Volume 8939 2015

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

ISBN: 978-3-662-46077-1 (Print) 978-3-662-46078-8 (Online)

Table of contents (50 chapters)

previous Page of 3
  1. Front Matter

    Pages -

  2. Invited Talks

    1. Keynote Talk

      1. No Access

        Chapter

        Pages 1-13

        What is Computation: An Epistemic Approach

      Foundations of Computer Science

      1. No Access

        Chapter

        Pages 14-23

        Progress (and Lack Thereof) for Graph Coloring Approximation Problems

      2. No Access

        Chapter

        Pages 24-44

        Recent Results in Scalable Multi-Party Computation

      3. No Access

        Chapter

        Pages 45-45

        Online Bipartite Matching in Offline Time (Abstract)

      Software and Web Engineering

      1. No Access

        Chapter

        Pages 46-57

        Quo Vadis Explicit-State Model Checking

      2. No Access

        Chapter

        Pages 58-64

        The Dos and Dont’s of Crowdsourcing Software Development

      Data, Information and Knowledge Engineering

      1. No Access

        Chapter

        Pages 65-77

        Adaptively Approximate Techniques in Distributed Architectures

      2. No Access

        Chapter

        Pages 78-101

        Back to the Future – Should SQL Surrender to SPARQL?

  3. Regular Papers

    1. Foundations of Computer Science

      1. No Access

        Chapter

        Pages 102-114

        Balancing Energy Consumption for the Establishment of Multi-interface Networks

      2. No Access

        Chapter

        Pages 115-127

        The Maximum k-Differential Coloring Problem

      3. No Access

        Chapter

        Pages 128-139

        Exact Algorithms for 2-Clustering with Size Constraints in the Euclidean Plane

      4. No Access

        Chapter

        Pages 140-151

        Local Routing in Convex Subdivisions

      5. No Access

        Chapter

        Pages 152-163

        Nondeterministic Modal Interfaces

      6. No Access

        Chapter

        Pages 164-176

        Group Search on the Line

      7. No Access

        Chapter

        Pages 177-188

        Online Makespan Scheduling with Sublinear Advice

      8. No Access

        Chapter

        Pages 189-200

        Deterministic Rendezvous in Restricted Graphs

      9. No Access

        Chapter

        Pages 201-216

        Fastest, Average and Quantile Schedule

      10. No Access

        Chapter

        Pages 217-229

        Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP

      11. No Access

        Chapter

        Pages 230-241

        Maximally Permissive Controlled System Synthesis for Modal Logic

      12. No Access

        Chapter

        Pages 242-253

        Approximation Hardness of the Cross-Species Conserved Active Modules Detection Problem

previous Page of 3