000 05037nam a22004935i 4500
001 978-0-387-09680-3
003 DE-He213
005 20250710083924.0
007 cr nn 008mamaa
008 100301s2008 xxu| s |||| 0|eng d
020 _a9780387096803
_a99780387096803
024 7 _a10.1007/978-0-387-09680-3
_2doi
082 0 4 _a004.0151
_223
100 1 _aAusiello, Giorgio.
_eeditor.
245 1 0 _aFifth Ifip International Conference On Theoretical Computer Science - Tcs 2008
_h[recurso electrónico] /
_cedited by Giorgio Ausiello, Juhani Karhumäki, Giancarlo Mauri, Luke Ong.
264 1 _aBoston, MA :
_bSpringer US,
_c2008.
300 _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 ;
_v273
505 0 _aTrack A -- Ambiguity and Complementation in Recognizable Two-dimensional Languages -- Algorithmic Game Theory: Some Greatest Hits and Future Directions -- Synchronizing Road Coloring -- Leader Election in Anonymous Rings: Franklin Goes Probabilistic -- Inverse Problems Have Inverse Complexity -- Literal Shuffle of Compressed Words -- Reconstructing words from a fixed palindromic length sequence -- The mv-decomposition: definition and application to the distance-2 broadcast problem in multi-hops radio networks -- Partitioning Random Graphs with General Degree Distributions -- On the Longest Common Factor Problem -- Stable Dynamics of Sand Automata -- On tractability of Cops and Robbers game -- Computability of Tilings -- A Classification of Degenerate Loop Agreement -- On the expressive power of univariate equations over sets of natural numbers -- Collisions and their Catenations: Ultimately Periodic Tilings of the Plane -- Cache-sensitive Memory Layout for Binary Trees -- Track B -- From Processes to ODEs by Chemistry -- Differential Linear Logic and Processes -- Solving Monotone Polynomial Equations -- Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras -- Finite Equational Bases for Fragments of CCS with Restriction and Relabelling -- ?-calculus Pushdown Module Checking with Imperfect State Information -- From Formal Proofs to Mathematical Proofs: A Safe, Incremental Way for Building in First-order Decision Procedures -- On Traits and Types in a Java-like Setting -- Canonical Sequent Proofs via Multi-Focusing -- Universal Coinductive Characterisations of Process Semantics -- Static and dynamic typing for the termination of mobile processes -- Regular n-ary Queries in Trees and Variable Independence -- Hamiltonicity of automatic graphs -- Marking the chops: an unambiguous temporal logic -- On Boundedness in Depth in the ?-Calculus -- A Unified View of Tree Automata and Term Schematisations -- Deconstructing behavioural theories of mobility -- Adequacy of Compositional Translations for Observational Semantics -- The Surprising Robustness of (Closed) Timed Automata against Clock-Drift.
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 refereed 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 0 _aCOMPUTER INDUSTRY.
650 1 4 _aCOMPUTER SCIENCE.
650 2 4 _aTHEORY OF COMPUTATION.
650 2 4 _aTHE COMPUTER INDUSTRY.
650 2 4 _aTHE COMPUTING PROFESSION.
650 2 4 _aHISTORY OF COMPUTING.
700 1 _aKarhumäki, Juhani.
_eeditor.
700 1 _aMauri, Giancarlo.
_eeditor.
700 1 _aOng, Luke.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9780387096797
830 0 _aIFIP International Federation for Information Processing,
_x1571-5736 ;
_v273
856 4 0 _uhttp://dx.doi.org/10.1007/978-0-387-09680-3
_zVer el texto completo en las instalaciones del CICY
912 _aZDB-2-SCS
942 _2ddc
_cER
999 _c56022
_d56022