000 04141nam a22004335i 4500
001 978-0-387-34735-6
003 DE-He213
005 20250710083954.0
007 cr nn 008mamaa
008 100301s2006 xxu| s |||| 0|eng d
020 _a9780387347356
_a99780387347356
024 7 _a10.1007/978-0-387-34735-6
_2doi
082 0 4 _a004.0151
_223
100 1 _aNavarro, Gonzalo.
_eeditor.
245 1 0 _aFourth IFIP International Conference on Theoretical Computer Science- TCS 2006
_h[recurso electrónico] :
_bIFIP 19th Worm Computer Congress, TC-1, Foundations of Computer Science, August 23-24, 2006, Santiago, Chile /
_cedited by Gonzalo Navarro, Leopoldo Bertossi, Yoshiharu Kohayakawa.
264 1 _aBoston, MA :
_bSpringer US,
_c2006.
300 _aXII, 315 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aIFIP International Federation for Information Processing,
_x1571-5736 ;
_v209
505 0 _aInvited 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.
520 _aInternational 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 in technology; communication systems; systems modeling and optimization; information systems; computers and society; computer systems technology; security and protection in information processing systems; artificial intelligence; and human-computer interaction. Proceedings and post-proceedings of referred international conferences in computer science and interdisciplinary fields are featured. These results often precede journal publication and represent the most current research. The principal aim of the IFIP series is to encourage education and the dissemination and exchange of information about all aspects of computing. For more information about the 300 other books in the IFIP series, please visit www.springer.com. For more information about IFIP, please visit www.ifip.org.
650 0 _aCOMPUTER SCIENCE.
650 0 _aINFORMATION THEORY.
650 1 4 _aCOMPUTER SCIENCE.
650 2 4 _aTHEORY OF COMPUTATION.
700 1 _aBertossi, Leopoldo.
_eeditor.
700 1 _aKohayakawa, Yoshiharu.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9780387346335
830 0 _aIFIP International Federation for Information Processing,
_x1571-5736 ;
_v209
856 4 0 _uhttp://dx.doi.org/10.1007/978-0-387-34735-6
_zVer el texto completo en las instalaciones del CICY
912 _aZDB-2-SCS
942 _2ddc
_cER
999 _c57409
_d57409