| Invited Talks | |
| Quantum Random Walks - New Method for Designing Quantum Algorithms | p. 1 |
| Social Information Access: The Other Side of the Social Web | p. 5 |
| Designing Adaptive Web Applications | p. 23 |
| Best of Both: Using Semantic Web Technologies to Enrich User Interaction with the Web and Vice Versa | p. 34 |
| On the Hardness of Reoptimization | p. 50 |
| Describing Self-assembly of Nanostructures | p. 66 |
| On the Undecidability of the Tiling Problem | p. 74 |
| Remote Entrusting by Run-Time Software Authentication | p. 83 |
| Trusted Computing - Special Aspects and Challenges | p. 98 |
| Optimizing Winning Strategies in Regular Infinite Games | p. 118 |
| Foundations of Computer Science | |
| Recursive Domain Equations of Filter Models | p. 124 |
| Algorithmic Problems for Metrics on Permutation Groups | p. 136 |
| Periodic and Infinite Traces in Matrix Semigroups | p. 148 |
| From Asynchronous to Synchronous Specifications for Distributed Program Synthesis | p. 162 |
| Exact OBDD Bounds for Some Fundamental Functions (Extended Abstract) | p. 174 |
| Clustering-Based Similarity Search in Metric Spaces with Sparse Spatial Centers | p. 186 |
| A Useful Bounded Resource Functional Language | p. 198 |
| On Reachability Games of Ordinal Length | p. 211 |
| An Algorithm for Computation of the Scene Geometry by the Log-Polar Area Matching Around Salient Points | p. 222 |
| The Power of Tokens: Rendezvous and Symmetry Detection for Two Mobile Agents in a Ring | p. 234 |
| How Much Information about the Future Is Needed? | p. 247 |
| On Compiling Structured Interactive Programs with Registers and Voices | p. 259 |
| Optimal Orientation On-Line | p. 271 |
| Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality | p. 280 |
| Assisted Problem Solving and Decompositions of Finite Automata | p. 292 |
| Energy-Efficient Windows Scheduling | p. 304 |
| A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns | p. 316 |
| Certification of Proving Termination of Term Rewriting by Matrix Interpretations | p. 328 |
| Extension of Rescheduling Based on Minimal Graph Cut | p. 340 |
| Deriving Complexity Results for Interaction Systems from I-Safe Petri Nets | p. 352 |
| Computing Longest Common Substring and All Palindromes from Compressed Strings | p. 364 |
| Basic Sets in the Digital Plane | p. 376 |
| Algebraic Optimization of Relational Queries with Various Kinds of Preferences | p. 388 |
| Mortality Problem for 2 x 2 Integer Matrices | p. 400 |
| Element Distinctness and Sorting on One-Tape Off-Line Turing Machines | p. 406 |
| Improved Bounds for Range Mode and Range Median Queries | p. 418 |
| An Automata Theoretic Approach to Rational Tree Relations | p. 424 |
| Slicing Petri Nets with an Application to Workflow Verification | p. 436 |
| Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata | p. 448 |
| Verifying Parameterized taDOM+ Lock Managers | p. 460 |
| Untangling a Planar Graph | p. 473 |
| Computing by Nature | |
| Quantum Walks with Multiple or Moving Marked Locations | p. 485 |
| Parallel Immune System for Graph Coloring | p. 497 |
| The Quantum Complexity of Group Testing | p. 506 |
| Quantum Walks: A Markovian Perspective | p. 519 |
| A Memetic Algorithm for Global Induction of Decision Trees | p. 531 |
| Geometric Rates of Approximation by Neural Networks | p. 541 |
| A Sensitive Metaheuristic for Solving a Large Optimization Problem | p. 551 |
| Networks, Security, and Cryptography | |
| Domain Name System as a Memory and Communication Medium | p. 560 |
| Strong Authentication over Lock-Keeper | p. 572 |
| Short Ballot Assumption and Threeballot Voting Protocol | p. 585 |
| Practical Deniable Encryption | p. 599 |
| Taming of Pict | p. 610 |
| Classification, Formalization and Verification of Security Functional Requirements | p. 622 |
| ONN the Use of Neural Networks for Data Privacy | p. 634 |
| Threshold Privacy Preserving Keyword Searches | p. 646 |
| Web Technologies | |
| 3DöXML: A Three-Dimensional XML-Based Model | p. 659 |
| Visual Exploration of RDF Data | p. 672 |
| Creation, Population and Preprocessing of Experimental Data Sets for Evaluation of Applications for the Semantic Web | p. 684 |
| Algorithm for Intelligent Prediction of Requests in Business Systems | p. 696 |
| Mining Personal Social Features in the Community of Email Users | p. 708 |
| Proofs of Communication and Its Application for Fighting Spam | p. 720 |
| Web Pages Reordering and Clustering Based on Web Patterns | p. 731 |
| Compression of Concatenated Web Pages Using XBW | p. 743 |
| The Dynamic Web Presentations with a Generality Model on the News Domain | p. 755 |
| A Highly Efficient XML Compression Scheme for the Web | p. 766 |
| Improving Semantic Search Via Integrated Personalized Faceted and Visual Graph Navigation | p. 778 |
| Author Index | p. 791 |
| Table of Contents provided by Blackwell. All Rights Reserved. |
