SFr. 70.00
€ 75.60


bestellen

Artikel-Nr. 5038883


Diesen Artikel in meine
Wunschliste
Diesen Artikel
weiterempfehlen
Diesen Preis
beobachten

Weitersagen:


Herausgeber: 
  • Cosimo Laneve
  • Carlo Blundo
  • Theoretical Computer Science: 8th Italian Conference, ICTCS 2003, Bertinoro, Italy, October 13-15, 2003, Proceedings 
     

    (Buch)
    Dieser Artikel gilt, aufgrund seiner Grösse, beim Versand als 3 Artikel!


    Übersicht

    Auf mobile öffnen
     
    Lieferstatus:   Auf Bestellung (Lieferzeit unbekannt)
    Veröffentlichung:  September 2003  
    Genre:  EDV / Informatik 
     
    Algorithm Analysis and Problem Complexity / Algorithmen und Datenstrukturen / Algorithms / Algorithms & data structures / C / Computation by Abstract Devices / Computer architecture & logic design / Computer logic
    ISBN:  9783540202165 
    EAN-Code: 
    9783540202165 
    Verlag:  Springer EN 
    Einband:  Kartoniert  
    Sprache:  English  
    Serie:  #2841 - Lecture Notes in Computer Science  
    Dimensionen:  H 235 mm / B 155 mm / D  
    Gewicht:  1280 gr 
    Seiten:  400 
    Illustration:  XII, 400 p. 
    Zus. Info:  EUDR exemption - product or manufacturing materials placed on the market prior to 31.12.2025. 
    Bewertung: Titel bewerten / Meinung schreiben
    Inhalt:
    Invited Talks.- Extreme Nash Equilibria.- Certification of Memory Usage.- On Programming Models for Mobility.- Program Design, Models and Analysis.- On the Computational Complexity of Cut-Elimination in Linear Logic.- A Constructive Proof of the Soundness of the Encoding of Random Access Machines in a Linda Calculus with Ordered Semantics.- Finite Horizon Analysis of Stochastic Systems with the Mur? Verifier.- Towards Compact and Tractable Automaton-Based Representations of Time Granularities.- Lower Bounds on the Size of Quantum Automata Accepting Unary Languages.- Refined Effects for Unanticipated Object Re-classification: .- Algorithms and Complexity.- Cost Constrained Fixed Job Scheduling.- A Work-Optimal Coarse-Grained PRAM Algorithm for Lexicographically First Maximal Independent Set.- An Approximation Algorithm for the Minimum Weight Vertex-Connectivity Problem in Complete Graphs with Sharpened Triangle Inequality.- Channel Assignment in Honeycomb Networks.- Exact Solution of a Class of Frequency Assignment Problems in Cellular Networks.- The Complexity of Checking Consistency of Pedigree Information and Related Problems.- On Clausal Equivalence and Hull Inclusion.- Semantics and Formal Languages.- Logical Semantics for the First Order ?-Calculus.- On the Expressive Power of Light Affine Logic.- Reasoning about Self and Others: Communicating Agents in a Modal Action Logic.- Decidability Properties of Recursive Types.- Algebraic Theories for Contextual Pre-nets.- A Coalgebraic Description of Web Interactions.- A Calculus for Dynamic Linking.- Towards a Smart Compilation Manager for Java.- Security and Cryptography.- Anonymous Group Communication in Mobile Networks.- Aspects of Pseudorandomness in Nonlinear Generators of Binary Sequences.- AnInformation-Theoretic Approach to the Access Control Problem.- Security-Aware Program Transformations.- Information Flow Security and Recursive Systems.- Compositional Verification of Secure Streamed Data: A Case Study with EMSS.

      



    Wird aktuell angeschaut...
     

    Zurück zur letzten Ansicht


    AGB | Datenschutzerklärung | Mein Konto | Impressum | Partnerprogramm
    Newsletter | 1Advd.ch RSS News-Feed Newsfeed | 1Advd.ch Facebook-Page Facebook | 1Advd.ch Twitter-Page Twitter
    Forbidden Planet AG © 1999-2026
    Alle Angaben ohne Gewähr
     
    SUCHEN

     
     Kategorien
    Im Sortiment stöbern
    Genres
    Hörbücher
    Aktionen
     Infos
    Mein Konto
    Warenkorb
    Meine Wunschliste
     Kundenservice
    Recherchedienst
    Fragen / AGB / Kontakt
    Partnerprogramm
    Impressum
    © by Forbidden Planet AG 1999-2026