000 04233nam a22003975i 4500
001 277569
003 MX-SnUAN
005 20160429153824.0
007 cr nn 008mamaa
008 150903s2006 xxu| o |||| 0|eng d
020 _a9780387347356
_99780387347356
024 7 _a10.1007/9780387347356
_2doi
035 _avtls000331202
039 9 _a201509030229
_bVLOAD
_c201404121759
_dVLOAD
_c201404091534
_dVLOAD
_c201401311406
_dstaff
_y201401301204
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA75.5-76.95
100 1 _aNavarro, Gonzalo.
_eeditor.
_9300447
245 1 0 _aFourth IFIP International Conference on Theoretical Computer Science- TCS 2006 :
_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áginas,
_brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
490 0 _aIFIP International Federation for Information Processing,
_x1571-5736 ;
_v209
500 _aSpringer eBooks
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.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700 1 _aBertossi, Leopoldo.
_eeditor.
_9300448
700 1 _aKohayakawa, Yoshiharu.
_eeditor.
_9300449
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9780387346335
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-0-387-34735-6
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c277569
_d277569