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...

Full description

Saved in:
Bibliographic Details
Corporate Authors: IFIP International Conference on Theoretical Computer Science Santiago, Chile, SpringerLink (Online service), IFIP World Computer Congress
Other Authors: Navarro, Gonzalo, 1969-, Bertossi, Leopoldo, Kohayakawa, Yoshiharu
Format: Conference Proceeding eBook
Language:English
Published: New York : Springer, 2006.
New York : 2006.
Series:International Federation for Information Processing (Series) ; 209.
Physical Description:
1 online resource (xii, 313 pages) : illustrations.
Subjects:
Robots -- Programming.
RDF (Document markup language)
Queuing theory.
Recursion theory.
computertechnieken.
computer techniques.
computerwetenschappen.
computer sciences.
computational science.
Information and Communication Technology (General)
Informatie- en communicatietechnologie (algemeen)
Online Access:SpringerLink - Click here for access
Contents:
  • Locality of queries and transformations / Marcelo Arenas
  • From informatics to quantum informatics / Jozef Gruska
  • RDF as a data model / Claudio Gutiérrez
  • Adversarial queueing theory revisited / Marcos Kiwi
  • Distributed algorithms for autonomous mobile robots / Nicola Santoro
  • Recursion and probability / Mihalis Yannakakis
  • Distributed algorithms for autonomous mobile robots / Giuseppe Prencipe, Nicola Santoro
  • The unsplittable stable marriage problem / Brian C. Dean, Michel X. Goemans, Nicole Immorlica
  • Variations on an ordering theme with constraints / Walter Guttmann, Markus Maucher
  • BuST-bundled suffix trees / Luca Bartolussi, Francesco Fabris, Alberto Policriti
  • An O(1) solution to the prefix sum problem on a specialized memory architecture / Andrej Brodnik, Johan Karlsson, J. Ian Munro, Andreas Nilsson
  • An algorithm to reduce the communication traffic for multi-word searches in a distributed hash table / Yuchi Sei, Kazutaka Matsuzaki, Shinichi Honiden
  • Exploring an unknown graph to locate a black hole using tokens / Stefan Dobrev, Paola Flocchini, Ratislav Královič, Nicola Santoro
  • Fast cellular automata with restricted inter-cell communication / Martin Kutrib, Andreas Malcher
  • Asynchronous distributed components: concurrency and determinacy / Denis Caromel, Ludovic Henrio
  • Decidable properties for regular cellular automata / Pietro Di Lena
  • Symbolic determinisation of extended automata / Thierry Jéron, Hervé Marchand, Vlad Rusu
  • Regular hedge model checking / Julien d'Orso, Tayssir Touili
  • Completing categorical algebras / Stephen L. Bloom, Zoltán Ésik
  • Reusing optimal TSP solutions for locally modified input instances / Hans-Joachim Böckenhauer and others
  • Spectral partitioning of random graphs with given expected degrees / Amin Coja-Oghlan, Andreas Goerdt, André Lanka
  • A connectivity rating for vertices in networks / Marco Abraham and others
  • On PTAS for planar graph problems / Xiuchen Huang, Jianer Chen.

Similar Items