34. SOFSEM 2008: Novy Smokovec, High Tatras, Slovakia

Invited Talks

• Andris Ambainis:
  Quantum Random Walks - New Method for Designing Quantum Algorithms. 1-4
  
• Peter Brusilovsky:
  Social Information Access: The Other Side of the Social Web. 5-22
  
• Peter Dolog:
  Designing Adaptive Web Applications. 23-33
  
• Martin Dzbor:
  Best of Both: Using Semantic Web Technologies to Enrich User Interaction with the Web and Vice Versa. 34-49
  
• Hans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke, Peter Widmayer:
  On the Hardness of Reoptimization. 50-65
  
• Natasa Jonoska, Gregory L. McColm:
  Describing Self-assembly of Nanostructures. 66-73
  
• Jarkko Kari:
  On the Undecidability of the Tiling Problem. 74-82
  
• Mariano Ceccato, Yoram Ofek, Paolo Tonella:
  Remote Entrusting by Run-Time Software Authentication. 83-97
  
• Ahmad-Reza Sadeghi:
  Trusted Computing - Special Aspects and Challenges. 98-117
  
• Wolfgang Thomas:
  Optimizing Winning Strategies in Regular Infinite Games. 118-123
  

Foundations of Computer Science

• Fabio Alessi, Paula Severi:
  Recursive Domain Equations of Filter Models. 124-135
  
• Vikraman Arvind, Pushkar S. Joglekar:
  Algorithmic Problems for Metrics on Permutation Groups. 136-147
  
• Paul Bell, Igor Potapov:
  Periodic and Infinite Traces in Matrix Semigroups. 148-161
  
• Julien Bernet, David Janin:
  From Asynchronous to Synchronous Specifications for Distributed Program Synthesis. 162-173
  
• Beate Bollig, Niko Range, Ingo Wegener:
  Exact OBDD Bounds for Some Fundamental Functions. 174-185
  
• Nieves R. Brisaboa, Oscar Pedreira, Diego Seco, Roberto Solar, Roberto Uribe:
  Clustering-Based Similarity Search in Metric Spaces with Sparse Spatial Centers. 186-197
  
• Michael J. Burrell, James H. Andrews, Mark Daley:
  A Useful Bounded Resource Functional Language. 198-210
  
• Julien Cristau, Florian Horn:
  On Reachability Games of Ordinal Length. 211-221
  
• Boguslaw Cyganek:
  An Algorithm for Computation of the Scene Geometry by the Log-Polar Area Matching Around Salient Points. 222-233
  
• Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis, Danny Krizanc:
  The Power of Tokens: Rendezvous and Symmetry Detection for Two Mobile Agents in a Ring. 234-246
  
• Stefan Dobrev, Rastislav Kralovic, Dana Pardubská:
  How Much Information about the Future Is Needed? 247-258
  
• Cezara Dragoi, Gheorghe Stefanescu:
  On Compiling Structured Interactive Programs with Registers and Voices. 259-270
  
• Lech Duraj, Grzegorz Gutowski:
  Optimal Orientation On-Line. 271-279
  
• Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard:
  Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality. 280-291
  
• Peter Gazi, Branislav Rovan:
  Assisted Problem Solving and Decompositions of Finite Automata. 292-303
  
• Christian Gunia:
  Energy-Efficient Windows Scheduling. 304-315
  
• Costas S. Iliopoulos, M. Sohel Rahman:
  A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns. 316-327
  
• Adam Koprowski, Hans Zantema:
  Certification of Proving Termination of Term Rewriting by Matrix Interpretations. 328-339
  
• Marián Lekavý, Pavol Návrat:
  Extension of Rescheduling Based on Minimal Graph Cut. 340-351
  
• Mila E. Majster-Cederbaum, Christoph Minnameier:
  Deriving Complexity Results for Interaction Systems from 1-Safe Petri Nets. 352-363
  
• Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, Kazuo Hashimoto:
  Computing Longest Common Substring and All Palindromes from Compressed Strings. 364-375
  
• Neza Mramor-Kosta, Eva Trenklerová:
  Basic Sets in the Digital Plane. 376-387
  
• Radim Nedbal:
  Algebraic Optimization of Relational Queries with Various Kinds of Preferences. 388-399
  
• C. Nuccio, E. Rodaro:
  Mortality Problem for 2×2 Integer Matrices. 400-405
  
• Holger Petersen:
  Element Distinctness and Sorting on One-Tape Off-Line Turing Machines. 406-417
  
• Holger Petersen:
  Improved Bounds for Range Mode and Range Median Queries. 418-423
  
• Frank G. Radmacher:
  An Automata Theoretic Approach to Rational Tree Relations. 424-435
  
• Astrid Rakow:
  Slicing Petri Nets with an Application to Workflow Verification. 436-447
  
• Adam Roman, Wit Forys:
  Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata. 448-459
  
• Antti Siirtola, Michal Valenta:
  Verifying Parameterized taDOM+ Lock Managers. 460-472
  
• Andreas Spillner, Alexander Wolff:
  Untangling a Planar Graph. 473-484
  

Computing by Nature

• Andris Ambainis, Alexander Rivosh:
  Quantum Walks with Multiple or Moving Marked Locations. 485-496
  
• Jacek Dabrowski:
  Parallel Immune System for Graph Coloring. 497-505
  
• Sebastian Dörn, Thomas Thierauf:
  The Quantum Complexity of Group Testing. 506-518
  
• Diego de Falco, Dario Tamascelli:
  Quantum Walks: A Markovian Perspective. 519-530
  
• Marek Kretowski:
  A Memetic Algorithm for Global Induction of Decision Trees. 531-540
  
• Vera Kurková, Marcello Sanguineti:
  Geometric Rates of Approximation by Neural Networks. 541-550
  
• Camelia-Mihaela Pintea, Camelia Chira, D. Dumitrescu, Petrica C. Pop:
  A Sensitive Metaheuristic for Solving a Large Optimization Problem. 551-559
  

Networks, Security, and Cryptography

• Dusan Bernát:
  Domain Name System as a Memory and Communication Medium. 560-571
  
• Feng Cheng, Christoph Meinel:
  Strong Authentication over Lock-Keeper. 572-584
  
• Jacek Cichon, Miroslaw Kutylowski, Bogdan Weglorz:
  Short Ballot Assumption and Threeballot Voting Protocol. 585-598
  
• Marek Klonowski, Przemyslaw Kubiak, Miroslaw Kutylowski:
  Practical Deniable Encryption. 599-609
  
• Matej Kosík:
  Taming of Pict. 610-621
  
• Shoichi Morimoto, Shinjiro Shigematsu, Yuichi Goto, Jingde Cheng:
  Classification, Formalization and Verification of Security Functional Requirements. 622-633
  
• Jordi Pont-Tuset, Pau Medrano-Gracia, Jordi Nin, Josep-Lluis Larriba-Pey, Victor Muntés-Mulero:
  ONN the Use of Neural Networks for Data Privacy. 634-645
  
• Peishun Wang, Huaxiong Wang, Josef Pieprzyk:
  Threshold Privacy Preserving Keyword Searches. 646-658
  

Web Technologies

• Khadija Abied Ali, Jaroslav Pokorný:
  3D_XML: A Three-Dimensional XML-Based Model. 659-671
  
• Jirí Dokulil, Jana Katreniaková:
  Visual Exploration of RDF Data. 672-683
  
• György Frivolt, Ján Suchal, Richard Vesely, Peter Vojtek, Oto Vozár, Mária Bieliková:
  Creation, Population and Preprocessing of Experimental Data Sets for Evaluation of Applications for the Semantic Web. 684-695
  
• Piotr Kalita, Igor T. Podolak, Adam Roman, Bartosz Bierkowski:
  Algorithm for Intelligent Prediction of Requests in Business Systems. 696-707
  
• Przemyslaw Kazienko, Katarzyna Musial:
  Mining Personal Social Features in the Community of Email Users. 708-719
  
• Marek Klonowski, Tomasz Struminski:
  Proofs of Communication and Its Application for Fighting Spam. 720-730
  
• Milos Kudelka, Václav Snásel, Ondrej Lehecka, Eyas El-Qawasmeh, Jaroslav Pokorný:
  Web Pages Reordering and Clustering Based on Web Patterns. 731-742
  
• Radovan Sesták, Jan Lansky:
  Compression of Concatenated Web Pages Using XBW. 743-754
  
• Hyun Woong Shin, Eduard H. Hovy, Dennis McLeod:
  The Dynamic Web Presentations with a Generality Model on the News Domain. 755-765
  
• Przemyslaw Skibinski, Jakub Swacha, Szymon Grabowski:
  A Highly Efficient XML Compression Scheme for the Web. 766-777
  
• Michal Tvarozek, Michal Barla, György Frivolt, Marek Tomsa, Mária Bieliková:
  Improving Semantic Search Via Integrated Personalized Faceted and Visual Graph Navigation. 778-789