• Produktbild: Fifth IFIP International Conference on Theoretical Computer Science - TCS 2008
  • Produktbild: Fifth IFIP International Conference on Theoretical Computer Science - TCS 2008
Band 273

Fifth IFIP International Conference on Theoretical Computer Science - TCS 2008 IFIP 20th World Computer Congress, TC 1, Foundations of Computer Science, September 7-10, 2008, Milano, Italy

144,99 €

inkl. gesetzl. MwSt., Versandkostenfrei


Beschreibung

Produktdetails

Einband

Gebundene Ausgabe

Erscheinungsdatum

17.07.2008

Herausgeber

Giorgio Ausiello + weitere

Verlag

Springer Us

Seitenzahl

554

Maße (L/B/H)

24,3/16,7/4,3 cm

Gewicht

971 g

Auflage

2008 edition

Sprache

Englisch

ISBN

978-0-387-09679-7

Beschreibung

Produktdetails

Einband

Gebundene Ausgabe

Erscheinungsdatum

17.07.2008

Herausgeber

Verlag

Springer Us

Seitenzahl

554

Maße (L/B/H)

24,3/16,7/4,3 cm

Gewicht

971 g

Auflage

2008 edition

Sprache

Englisch

ISBN

978-0-387-09679-7

Herstelleradresse

Libri GmbH
Europaallee 1
36244 Bad Hersfeld
DE

Email: gpsr@libri.de

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)

  • Produktbild: Fifth IFIP International Conference on Theoretical Computer Science - TCS 2008
  • Produktbild: Fifth IFIP International Conference on Theoretical Computer Science - TCS 2008
  • Track 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.