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 /
International Federation for Information Processing The IFIP series publishes state-of-the-art results in the sciences and technologies of information and communication. The scope of the series includes: foundations of computer science; software theory and practice; education; computer applications...
Clasificación: | Libro Electrónico |
---|---|
Autor Corporativo: | |
Otros Autores: | , , |
Formato: | Electrónico eBook |
Idioma: | Inglés |
Publicado: |
New York, NY :
Springer US : Imprint: Springer,
2006.
|
Edición: | 1st ed. 2006. |
Colección: | IFIP Advances in Information and Communication Technology,
209 |
Temas: | |
Acceso en línea: | Texto Completo |
Tabla de Contenidos:
- 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
- BuST-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.