Accepted Papers

Foundations of Computer Sciences

• Fabio Alessi and Paula Severi (Udine, Italy)
  Recursive domain equations of filter models
  
  
• Vikraman Arvind and Pushkar Joglekar (Chennai, India)
  Algorithmic problems for metrics on permutation groups
  
  
• Paul Bell (Turku, Finland) and Igor Potapov (Liverpool, United Kingdom)
  Periodic and infinite traces in matrix semigroups
  
  
• Julien Bernet and David Janin (Bordeaux, France)
  From asynchronous to synchronous specifications for distributed program synthesis
  
  
• Beate Bollig, Niko Range, and Ingo Wegener (Dortmund, Germany)
  Exact OBDD bounds for some fundamental functions
  
  
• Nieves Brisaboa, Oscar Pedreira, Diego Seco (A Coruña, Spain), Roberto Solar, and Roberto Uribe (Punta Arenas, Chile)
  Clustering based similarity search in metric spaces with sparse spatial centers
  
  
• Michael J. Burrell, James H. Andrews, and Mark Daley (London/ON, Canada)
  A useful bounded resource functional language
  
  
• Julien Cristau (Paris, France) and Florian Horn (Aachen, Germany)
  On reachability games of ordinal length
  
  
• Bogusław Cyganek (Kraków, Poland)
  An algorithm for computation of the scene geometry by the log-polar area matching around salient points
  
  
• Jurek Czyzowicz (Gatineau/QC, Canada), Stefan Dobrev (Bratislava, Slovakia), Evangelos Kranakis (Ottawa/ON, Canada), and Danny Krizanc (Middletown/CT, USA)
  The power of tokens: rendezvous and symmetry detection for two mobile agents in a ring
  
  
• Stefan Dobrev (Ottawa/ON, Canada), Rastislav Královič, and Dana Pardubská (Bratislava, Slovakia)
  How much information about the future is needed ?
  
  
• Cezara Dragoi and Gheorghe Stefanescu (Bucharest, Romania)
  On compiling structured interactive programs with registers and voices
  
  
• Lech Duraj and Grzegorz Gutowski (Kraków, Poland)
  Optimal orientation on-line
  
  
• Bruno Escoffier, Jérôme Monnot, and Olivier Spanjaard (Paris, France)
  Some tractable instances of interval data minmax regret problems: bounded distance from triviality
  
  
• Peter Gaži and Branislav Rovan (Bratislava, Slovakia)
  Assisted problem solving and decompositions of finite automata
  
  
• Christian Gunia (Freiburg, Germany)
  Energy-efficient windows scheduling
  
  
• Costas S. Iliopoulos and Mohammad Sohel Rahman (London, United Kingdom)
  A new model to solve the swap matching problem and efficient algorithms for short patterns
  
  
• Adam Koprowski and Hans Zantema (Eindhoven, the Netherlands)
  Certification of proving termination of term rewriting by matrix interpretations
  
  
• Marián Lekavý and Pavol Návrat (Bratislava, Slovakia)
  Extension of rescheduling based on minimal graph cut
  
  
• Mila Majster-Cederbaum and Christoph Minnameier (Mannheim, Germany)
  Deriving complexity results for interaction systems from 1-safe Petri nets
  
  
• Wataru Matsubara (Sendai, Japan), Shunsuke Inenaga (Fukuoka, Japan), Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, and Kazuo Hashimoto (Sendai, Japan)
  Computing longest common substring and all palindromes from compressed strings
  
  
• Neža Mramor-Kosta (Ljubljana, Slovenia) and Eva Trenklerová (Košice, Slovakia)
  Basic sets in the digital plane
  
  
• Radim Nedbal (Prague, Czech Republic)
  Algebraic optimization of relational queries with various kinds of preferences
  
  
• Claudia Nuccio and Emanuele Rodaro (Milano, Italy)
  Mortality problem for 2x2 integer matrices
  
  
• Holger Petersen (Stuttgart, Germany)
  Element distinctness and sorting on one-tape off-line Turing machines
  
  
• Holger Petersen (Stuttgart, Germany)
  Improved bounds for range mode and range median queries
  
  
• Frank G. Radmacher (Aachen, Germany)
  An automata theoretic approach to rational tree relations
  
  
• Astrid Rakow (Oldenburg, Germany)
  Slicing Petri nets with an application to workflow verification
  
  
• Adam Roman and Wit Foryś (Kraków, Poland)
  Lower bound for the length of synchronizing words in partially-synchronizing automata
  
  
• Antti Siirtola (Oulu, Finland) and Michal Valenta (Prague, Czech Republic)
  Verifying parameterized taDOM+ lock managers
  
  
• Andreas Spillner (Norwich, United Kingdom) and Alexander Wolff (Eindhoven, the Netherlands)
  Untangling a planar graph