Advertisement

SOFSEM 2010: Theory and Practice of Computer Science

36th Conference on Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic, January 23-29, 2010. Proceedings

  • Jan van Leeuwen
  • Anca Muscholl
  • David Peleg
  • Jaroslav Pokorný
  • Bernhard Rumpe
Conference proceedings SOFSEM 2010

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5901)

Table of contents

  1. Front Matter
    PDF

  2. Invited Talks

    1. Forcing Monotonicity in Parameterized Verification: From Multisets to Words
      Parosh Aziz Abdulla
      Pages 1-15
    2. Research Issues in the Automated Testing of Ajax Applications
      Arie van Deursen, Ali Mesbah
      Pages 16-28
    3. Essential Performance Drivers in Native XML DBMSs
      Theo Härder, Christian Mathis, Sebastian Bächle, Karsten Schmidt, Andreas M. Weiner
      Pages 29-46
    4. Continuous Processing of Preference Queries in Data Streams
      Maria Kontaki, Apostolos N. Papadopoulos, Yannis Manolopoulos
      Pages 47-60
    5. Clock Synchronization: Open Problems in Theory and Practice
      Christoph Lenzen, Thomas Locher, Philipp Sommer, Roger Wattenhofer
      Pages 61-70
    6. Regret Minimization and Job Scheduling
      Yishay Mansour
      Pages 71-76
    7. Lessons in Software Evolution Learned by Listening to Smalltalk
      Oscar Nierstrasz, Tudor Gîrba
      Pages 77-95
    8. The Web of Things: Extending the Web into the Real World
      Dave Raggett
      Pages 96-107
    9. Web Science: The Digital-Heritage Case
      Guus Schreiber
      Pages 108-111
    10. Model-Driven Software Product Line Testing: An Integrated Approach
      Andy Schürr, Sebastian Oster, Florian Markert
      Pages 112-131
    11. Taming the Complexity of Inductive Logic Programming
      Filip Železný, Ondřej Kuželka
      Pages 132-140

  3. Regular Papers

    1. A Rule Format for Unit Elements
      Luca Aceto, Anna Ingolfsdottir, MohammadReza Mousavi, Michel A. Reniers
      Pages 141-152
    2. Approximability of Edge Matching Puzzles
      Antonios Antoniadis, Andrzej Lingas
      Pages 153-164
    3. A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks
      Maxim A. Babenko, Ignat I. Kolesnichenko, Ilya P. Razenshteyn
      Pages 165-175
    4. R-Programs: A Framework for Distributing XML Structural Joins across Function Calls
      David Bednárek
      Pages 176-187
    5. Fast Arc-Annotated Subsequence Matching in Linear Space
      Philip Bille, Inge Li Gørtz
      Pages 188-199
    6. Automated Deadlock Detection in Synchronized Reentrant Multithreaded Call-Graphs
      Frank S. de Boer, Immo Grabe
      Pages 200-211
    7. A Kernel for Convex Recoloring of Weighted Forests
      Hans L. Bodlaender, Marc Comas
      Pages 212-223
    8. Symbolic OBDD-Based Reachability Analysis Needs Exponential Space
      Beate Bollig
      Pages 224-234
    9. A Social Vision of Knowledge Representation and Reasoning
      François Bry, Jakub Kotowski
      Pages 235-246
    10. Flavors of KWQL, a Keyword Query Language for a Semantic Wiki
      François Bry, Klara Weiand
      Pages 247-258
    11. On Pattern Density and Sliding Block Code Behavior for the Besicovitch and Weyl Pseudo-distances
      Silvio Capobianco
      Pages 259-270
    12. On a Labeled Vehicle Routing Problem
      Hatem Chatti, Laurent Gourvès, Jérôme Monnot
      Pages 271-282
    13. Improved Matrix Interpretation
      Pierre Courtieu, Gladys Gbedo, Olivier Pons
      Pages 283-295
    14. Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
      Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Waleń
      Pages 296-307
    15. Query Optimization through Cached Queries for Object-Oriented Query Language SBQL
      Piotr Cybula, Kazimierz Subieta
      Pages 308-320
    16. Perfect Matching for Biconnected Cubic Graphs in O(n log2n) Time
      Krzysztof Diks, Piotr Stanczyk
      Pages 321-333
    17. Destructive Rule-Based Properties and First-Order Logic
      David Duris
      Pages 334-345
    18. Learning User Preferences for 2CP-Regression for a Recommender System
      Alan Eckhardt, Peter Vojtáš
      Pages 346-357
    19. Parallel Randomized Load Balancing: A Lower Bound for a More General Model
      Guy Even, Moti Medina
      Pages 358-369
    20. Ant-CSP: An Ant Colony Optimization Algorithm for the Closest String Problem
      Simone Faro, Elisa Pappalardo
      Pages 370-381
    21. Linear Complementarity Algorithms for Infinite Games
      John Fearnley, Marcin Jurdziński, Rahul Savani
      Pages 382-393
    22. Mixing Coverability and Reachability to Analyze VASS with One Zero-Test
      Alain Finkel, Arnaud Sangnier
      Pages 394-406
    23. Practically Applicable Formal Methods
      Jędrzej Fulara, Krzysztof Jakubczyk
      Pages 407-418
    24. Fast and Compact Prefix Codes
      Travis Gagie, Gonzalo Navarro, Yakov Nekrich
      Pages 419-427
    25. New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes
      Robert Ganian, Petr Hliněný
      Pages 428-439
    26. Smooth Optimal Decision Strategies for Static Team Optimization Problems and Their Approximations
      Giorgio Gnecco, Marcello Sanguineti
      Pages 440-451
    27. Algorithms for the Minimum Edge Cover of H-Subgraphs of a Graph
      Alexander Grigoriev, Bert Marchal, Natalya Usotskaya
      Pages 452-464
    28. On the Complexity of the Highway Pricing Problem
      Alexander Grigoriev, Joyce van Loon, Marc Uetz
      Pages 465-476
    29. Accelerating Smart Play-Out
      David Harel, Hillel Kugler, Shahar Maoz, Itai Segall
      Pages 477-488
    30. Optimum Broadcasting in Complete Weighted-Vertex Graphs
      Hovhannes Harutyunyan, Shahin Kamali
      Pages 489-502
    31. On Contracting Graphs to Fixed Pattern Graphs
      Pim van ’t Hof, Marcin Kamiński, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos
      Pages 503-514
    32. Dynamic Edit Distance Table under a General Weighted Cost Function
      Heikki Hyyrö, Kazuyuki Narisawa, Shunsuke Inenaga
      Pages 515-527
    33. How to Complete an Interactive Configuration Process?
      Mikoláš Janota, Goetz Botterweck, Radu Grigore, Joao Marques-Silva
      Pages 528-539
    34. Design Patterns Instantiation Based on Semantics and Model Transformations
      Peter Kajsa, L’ubomír Majtás
      Pages 540-551
    35. A Complete Symbolic Bisimulation for Full Applied Pi Calculus
      Jia Liu, Huimin Lin
      Pages 552-563
    36. OTwig: An Optimised Twig Pattern Matching Approach for XML Databases
      Jun Liu, Mark Roantree
      Pages 564-575
    37. Picture Recognizability with Automata Based on Wang Tiles
      Violetta Lonati, Matteo Pradella
      Pages 576-587
    38. Unilateral Orientation of Mixed Graphs
      Tamara Mchedlidze, Antonios Symvonis
      Pages 588-599

About these proceedings

Keywords

Code Graph classification data mining design graph theory linear optimization load balancing modeling optimization parametrized verification rules mining search trees software reuse verification

Editors and affiliations

  • Jan van Leeuwen
    • 1
  • Anca Muscholl
    • 2
  • David Peleg
    • 3
  • Jaroslav Pokorný
    • 4
  • Bernhard Rumpe
    • 5
  1. 1.Department of Information and Computing SciencesUtrecht UniversityUtrechtThe Netherlands
  2. 2.LaBRIUniversit BordeauxTalence CedexFrance
  3. 3.Department of Computer Science & Applied MathematicsWeizmann Institute, Faculty of Mathematics and Computer ScienceRehovotIsrael
  4. 4.Department of Software Engineering Faculty of Mathematics and Physics Malostranské námCharles UniversityPrague 1Czech Republic
  5. 5.Software Engineering, Department of Computer ScienceRWTH Aachen UniversityAachenGermany

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-11266-9
  • Copyright Information Springer-Verlag Berlin Heidelberg 2010
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-11265-2
  • Online ISBN 978-3-642-11266-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site