Table of Contents

• Quantum Random Walks - New Method for Designing Quantum AlgorithmsAndris Ambainis. 1-4 [doi]
• Social Information Access: The Other Side of the Social WebPeter Brusilovsky. 5-22 [doi]
• Designing Adaptive Web ApplicationsPeter Dolog. 23-33 [doi]
• Best of Both: Using Semantic Web Technologies to Enrich User Interaction with the Web and Vice VersaMartin Dzbor. 34-49 [doi]
• On the Hardness of ReoptimizationHans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke, Peter Widmayer. 50-65 [doi]
• Describing Self-assembly of NanostructuresNatasa Jonoska, Gregory L. McColm. 66-73 [doi]
• On the Undecidability of the Tiling ProblemJarkko Kari. 74-82 [doi]
• Remote Entrusting by Run-Time Software AuthenticationMariano Ceccato, Yoram Ofek, Paolo Tonella. 83-97 [doi]
• Trusted Computing - Special Aspects and ChallengesAhmad-Reza Sadeghi. 98-117 [doi]
• Optimizing Winning Strategies in Regular Infinite GamesWolfgang Thomas. 118-123 [doi]
• Recursive Domain Equations of Filter ModelsFabio Alessi, Paula Severi. 124-135 [doi]
• Algorithmic Problems for Metrics on Permutation GroupsV. Arvind, Pushkar S. Joglekar. 136-147 [doi]
• Periodic and Infinite Traces in Matrix SemigroupsPaul Bell, Igor Potapov. 148-161 [doi]
• From Asynchronous to Synchronous Specifications for Distributed Program SynthesisJulien Bernet, David Janin. 162-173 [doi]
• Exact OBDD Bounds for Some Fundamental FunctionsBeate Bollig, Niko Range, Ingo Wegener. 174-185 [doi]
• Clustering-Based Similarity Search in Metric Spaces with Sparse Spatial CentersNieves R. Brisaboa, Oscar Pedreira, Diego Seco, Roberto Solar, Roberto Uribe. 186-197 [doi]
• A Useful Bounded Resource Functional LanguageMichael J. Burrell, James H. Andrews, Mark Daley. 198-210 [doi]
• On Reachability Games of Ordinal LengthJulien Cristau, Florian Horn. 211-221 [doi]
• An Algorithm for Computation of the Scene Geometry by the Log-Polar Area Matching Around Salient PointsBoguslaw Cyganek. 222-233 [doi]
• The Power of Tokens: Rendezvous and Symmetry Detection for Two Mobile Agents in a RingJurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis, Danny Krizanc. 234-246 [doi]
• How Much Information about the Future Is Needed?Stefan Dobrev, Rastislav Kralovic, Dana Pardubská. 247-258 [doi]
• On Compiling Structured Interactive Programs with Registers and VoicesCezara Dragoi, Gheorghe Stefanescu. 259-270 [doi]
• Optimal Orientation On-LineLech Duraj, Grzegorz Gutowski. 271-279 [doi]
• Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from TrivialityBruno Escoffier, Jérôme Monnot, Olivier Spanjaard. 280-291 [doi]
• Assisted Problem Solving and Decompositions of Finite AutomataPeter Gazi, Branislav Rovan. 292-303 [doi]
• Energy-Efficient Windows SchedulingChristian Gunia. 304-315 [doi]
• A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short PatternsCostas S. Iliopoulos, M. Sohel Rahman. 316-327 [doi]
• Certification of Proving Termination of Term Rewriting by Matrix InterpretationsAdam Koprowski, Hans Zantema. 328-339 [doi]
• Extension of Rescheduling Based on Minimal Graph CutMarián Lekavý, Pavol Návrat. 340-351 [doi]
• Deriving Complexity Results for Interaction Systems from 1-Safe Petri NetsMila E. Majster-Cederbaum, Christoph Minnameier. 352-363 [doi]
• Computing Longest Common Substring and All Palindromes from Compressed StringsWataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, Kazuo Hashimoto. 364-375 [doi]
• Basic Sets in the Digital PlaneNeza Mramor-Kosta, Eva Trenklerová. 376-387 [doi]
• Algebraic Optimization of Relational Queries with Various Kinds of PreferencesRadim Nedbal. 388-399 [doi]
• Mortality Problem for 2×2 Integer MatricesC. Nuccio, E. Rodaro. 400-405 [doi]
• Element Distinctness and Sorting on One-Tape Off-Line Turing MachinesHolger Petersen. 406-417 [doi]
• Improved Bounds for Range Mode and Range Median QueriesHolger Petersen. 418-423 [doi]
• An Automata Theoretic Approach to Rational Tree RelationsFrank G. Radmacher. 424-435 [doi]
• Slicing Petri Nets with an Application to Workflow VerificationAstrid Rakow. 436-447 [doi]
• Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing AutomataAdam Roman, Wit Forys. 448-459 [doi]
• Verifying Parameterized taDOM+ Lock ManagersAntti Siirtola, Michal Valenta. 460-472 [doi]
• Untangling a Planar GraphAndreas Spillner, Alexander Wolff. 473-484 [doi]
• Quantum Walks with Multiple or Moving Marked LocationsAndris Ambainis, Alexander Rivosh. 485-496 [doi]
• Parallel Immune System for Graph ColoringJacek Dabrowski. 497-505 [doi]
• The Quantum Complexity of Group TestingSebastian Dörn, Thomas Thierauf. 506-518 [doi]
• Quantum Walks: A Markovian PerspectiveDiego de Falco, Dario Tamascelli. 519-530 [doi]
• A Memetic Algorithm for Global Induction of Decision TreesMarek Kretowski. 531-540 [doi]
• Geometric Rates of Approximation by Neural NetworksVera Kurková, Marcello Sanguineti. 541-550 [doi]
• A Sensitive Metaheuristic for Solving a Large Optimization ProblemCamelia-Mihaela Pintea, Camelia Chira, D. Dumitrescu, Petrica C. Pop. 551-559 [doi]
• Domain Name System as a Memory and Communication MediumDusan Bernát. 560-571 [doi]
• Strong Authentication over Lock-KeeperFeng Cheng 0002, Christoph Meinel. 572-584 [doi]
• Short Ballot Assumption and Threeballot Voting ProtocolJacek Cichon, Miroslaw Kutylowski, Bogdan Weglorz. 585-598 [doi]
• Practical Deniable EncryptionMarek Klonowski, Przemyslaw Kubiak, Miroslaw Kutylowski. 599-609 [doi]
• Taming of PictMatej Kosík. 610-621 [doi]
• Classification, Formalization and Verification of Security Functional RequirementsShoichi Morimoto, Shinjiro Shigematsu, Yuichi Goto, Jingde Cheng. 622-633 [doi]
• ONN the Use of Neural Networks for Data PrivacyJordi Pont-Tuset, Pau Medrano-Gracia, Jordi Nin, Josep-Lluis Larriba-Pey, Victor Muntés-Mulero. 634-645 [doi]
• Threshold Privacy Preserving Keyword SearchesPeishun Wang, Huaxiong Wang, Josef Pieprzyk. 646-658 [doi]
• 3D_XML: A Three-Dimensional XML-Based ModelKhadija Abied Ali, Jaroslav Pokorný. 659-671 [doi]
• Visual Exploration of RDF DataJirí Dokulil, Jana Katreniaková. 672-683 [doi]
• Creation, Population and Preprocessing of Experimental Data Sets for Evaluation of Applications for the Semantic WebGyörgy Frivolt, Ján Suchal, Richard Vesely, Peter Vojtek, Oto Vozár, Mária Bieliková. 684-695 [doi]
• Algorithm for Intelligent Prediction of Requests in Business SystemsPiotr Kalita, Igor T. Podolak, Adam Roman, Bartosz Bierkowski. 696-707 [doi]
• Mining Personal Social Features in the Community of Email UsersPrzemyslaw Kazienko, Katarzyna Musial. 708-719 [doi]
• Proofs of Communication and Its Application for Fighting SpamMarek Klonowski, Tomasz Struminski. 720-730 [doi]
• Web Pages Reordering and Clustering Based on Web PatternsMilos Kudelka, Václav Snásel, Ondrej Lehecka, Eyas El-Qawasmeh, Jaroslav Pokorný. 731-742 [doi]
• Compression of Concatenated Web Pages Using XBWRadovan Sesták, Jan Lansky. 743-754 [doi]
• The Dynamic Web Presentations with a Generality Model on the News DomainHyun Woong Shin, Eduard H. Hovy, Dennis McLeod. 755-765 [doi]
• A Highly Efficient XML Compression Scheme for the WebPrzemyslaw Skibinski, Jakub Swacha, Szymon Grabowski. 766-777 [doi]
• Improving Semantic Search Via Integrated Personalized Faceted and Visual Graph NavigationMichal Tvarozek, Michal Barla, György Frivolt, Marek Tomsa, Mária Bieliková. 778-789 [doi]