Gonzalo Navarro & Leopoldo Bertossi 
Fourth IFIP International Conference on Theoretical Computer Science – TCS 2006 
IFIP 19th World Computer Congress, TC-1, Foundations of Computer Science, August 23-24, 2006, Santiago, Chile

The papers contained in this volume were presented at the fourth edition of the IFIP International Conference on Theoretical Computer Science (IFIP TCS), held August 23-24, 2006 in Santiago, Chile. They were selected from 44 pa pers submitted from 17 countries in response to the call for papers. A total of 16 submissions were accepted as full papers, yielding an acceptance rate of about 36%. Papers sohcited for IFIP TCS 2006 were meant to constitute orig inal contributions in two general areas: Algorithms, Complexity and Models of Computation; and Logic, Semantics, Specification and Verification. The conference also included six invited presentations: Marcelo Arenas (P- tificia Universidad Catolica de Chile, Chile), Jozef Gruska (Masaryk University, Czech Republic), Claudio Gutierrez (Universidad de Chile, Chile), Marcos Kiwi (Universidad de Chile, Chile), Nicola Santoro (Carleton University, Canada), and Mihalis Yannakakis (Columbia University, USA). The abstracts of those presentations are included in this volume. In addition, Jozef Gruska and Nicola Santoro accepted our invitation to write full papers related to their talks. Those two surveys are included in the present volume as well. TCS is a biannual conference. The first edition was held in Sendai (Japan, 2000), followed by Montreal (Canada, 2002) and Toulouse (France, 2004).

สารบัญ

Invited Talks.- Locality of Queries and Transformations.- From Informatics to Quantum Informatics.- RDF as a Data Model.- Adversarial Queueing Theory Revisited.- Distributed Algorithms for Autonomous Mobile Robots.- Recursion and Probability.- Invited Papers.- From Informatics to Quantum Informatics.- Distributed Algorithms for Autonomous Mobile Robots.- Contributed Papers.- The Unsplittable Stable Marriage Problem.- Variations on an Ordering Theme with Constraints.- Bu ST-Bundled Suffix Trees.- An O(1) Solution to the Prefix Sum Problem on a Specialized Memory Architecture.- An Algorithm to Reduce the Communication Traffic for Multi-Word Searches in a Distributed Hash Table.- Exploring an Unknown Graph to Locate a Black Hole Using Tokens.- Fast Cellular Automata with Restricted Inter-Cell Communication: Computational Capacity.- Asynchonous Distributed Components: Concurrency and Determinacy.- Decidable Properties for Regular Cellular Automata.- Symbolic Determinisation of Extended Automata.- Regular Hedge Model Checking.- Completing Categorical Algebras.- Reusing Optimal TSP Solutions for Locally Modified Input Instances.- Spectral Partitioning of Random Graphs with Given Expected Degrees.- A Connectivity Rating for Vertices in Networks.- On PTAS for Planar Graph Problems.