• Fri frakt över 249 kr
  • •
  • Snabba leveranser
  • •
  • Billiga böcker
Kundservice

Du är på sajten för privatpersoner.

Företag, bibliotek eller offentlig verksamhet?

Du handlar på classic.bokus.com, där alla dina funktioner finns intakta.
Till classic.bokus.com
Bokus logotyp. Gå till startsidan.
  • Erbjudanden
  • Nyheter
  • Student
  • Topplistor
  • Barn & ungdom
  • Bokus Play
  • E-böcker
  • Pocketböcker
  • Spel & pussel

10% studentrabatt med kod TERM26

Sidfot

Mina sidor

    Hjälp

    • Kundservice
    • Vanliga frågor och svar
    • Frakt och leverans
    • Retur vid ångerrätt
    • Reklamera vara
    • Betalning
    • Köpvillkor
    • Allmänna villkor
    • Information om webbplatsens tillgänglighet

    Om Bokus

    • Om oss
    • Pressrum
    • För studenter
    • För företag
    • För bibliotek och offentlig verksamhet
    • För leverantörer
    • Hållbarhet

    Populärt

    • Aktuella erbjudanden
    • Presentkort
    • Studentlitteratur
    • Nya böcker
    • Topplistor
    • Signerade böcker
    • Engelska böcker

    Inspiration

    • Boktips
    • BookTok
    • Populära bokserier
    • Barnbokskaraktärer
    • Populära författare

    Mina sidor

      Hjälp

      • Kundservice
      • Vanliga frågor och svar
      • Frakt och leverans
      • Retur vid ångerrätt
      • Reklamera vara
      • Betalning
      • Köpvillkor
      • Allmänna villkor
      • Information om webbplatsens tillgänglighet

      Om Bokus

      • Om oss
      • Pressrum
      • För studenter
      • För företag
      • För bibliotek och offentlig verksamhet
      • För leverantörer
      • Hållbarhet

      Populärt

      • Aktuella erbjudanden
      • Presentkort
      • Studentlitteratur
      • Nya böcker
      • Topplistor
      • Signerade böcker
      • Engelska böcker

      Inspiration

      • Boktips
      • BookTok
      • Populära bokserier
      • Barnbokskaraktärer
      • Populära författare
      Logotyp för Bokus
      Följ oss på Facebook (extern länk)Följ oss på Instagram (extern länk)Följ oss på YouTube (extern länk)Följ oss på TikTok (extern länk)
      bokus @ CookiesAnpassa cookiesIntegritetspolicyKöpvillkor
      Till Citymail hemsida (extern länk)Till Budbee hemsida (extern länk)Till Postnord hemsida (extern länk)Till Schenker hemsida (extern länk)Till Early Bird hemsida (extern länk)Till Walleys hemsida (extern länk)
      1. Data och IT
      2. Systemvetenskap och AI

      STACS 2002

      19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings

      AvHelmut Alt,Afonso Ferreira

      Häftad, Engelska, 2002

      Del i serien Lecture Notes in Computer Science

      1 124 kr

      Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

      Beskrivning

      The Symposium on Theoretical Aspects of Computer Science (STACS) has - come one of the most important annual meetings in Europe for the theoretical computer science community. It covers a wide range of topics in the area of - undationsofcomputerscience:algorithmsanddatastructures,automataand formal languages, computational and structural complexity, logic, veri?cation, and current challenges. STACS 2002, the 19th in this series, was held in Antibes - Juan les Pins, on the French Riviera, March 14-16, 2002. Previous STACS symposia took place in Paris (1984), Saarbruc .. ken (1985), Orsay (1986), Passau (1987), Bordeaux (1988), Paderborn (1989), Rouen (1990), Hamburg (1991), Cachan (1992), Wurzburg .. (1993), Caen (1994), Munc .. hen (1995), Grenoble (1996), Lub .. eck (1997), Paris, (1998), Trier (1999), Lille (2000), and Dresden (2001). The proceedings of all these symposia have been published in the Lecture Notes in Computer Science series of Springer-Verlag. STACS 2002 received 209 submissions from 30 countries, one of the highest numbers of submissions ever, for a European conference on theoretical computer science.They were dispatched to the Program Committee members, and - derwent a thorough review process, where more than 900 reports were written. These reports then served as guidance to the Program Committee, which met on November 16-17, 2001, at the INRIA Sophia Antipolis (near Antibes), France, in order to select the conference program.

      Produktinformation

      • Utgivningsdatum:2002-02-27
      • Mått:155 x 235 x 37 mm
      • Vikt:1 013 g
      • Format:Häftad
      • Språk:Engelska
      • Serie:Lecture Notes in Computer Science
      • Antal sidor:660
      • Upplaga:2002
      • Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
      • ISBN:9783540432838

      Utforska kategorier

      • Systemvetenskap och AI inom Data och IT
      • Databaser inom Data och IT
      • Grafik och bildbehandling inom Data och IT

      Innehållsförteckning

      • Invited Papers.- Hyper-Encryption and Everlasting Security.- Models and Techniques for Communication in Dynamic Networks.- What Is a Theory?.- Algorithms.- A Space Lower Bound for Routing in Trees.- Labeling Schemes for Dynamic Tree Networks.- Tight Bounds for the Performance of Longest-in-System on DAGs.- Approximate Strong Separation with Application in Fractional Graph Coloring and Preemptive Scheduling.- Balanced Coloring: Equally Easy for All Numbers of Colors?.- The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3.- On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets.- On Dualization in Products of Forests.- An Asymptotic (ln ?/ ln ln ?)-Approximation Algorithm for the Scheduling Problem with Duplication on Large Communication Delay Graphs.- Scheduling at Twilight the EasyWay.- Complexity of Multi-dimensional Loop Alignment.- A Probabilistic 3—SAT Algorithm Further Improved.- The Secret of Selective Game Tree Search, When Using Random-Error Evaluations.- Randomized Acceleration of Fundamental Matrix Computations.- Approximations for ATSP with Parametrized Triangle Inequality.- A New Diagram from Disks in the Plane.- Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles.- Current Challenges.- On the Parameterized Intractability of Closest Substring and Related Problems.- On the Complexity of Protein Similarity Search under mRNA Structure Constraints.- Pure Dominance Constraints.- Improved Quantum Communication Complexity Bounds for Disjointness and Equality.- On Quantum Computation with Some Restricted Amplitudes.- A Quantum Goldreich-Levin Theorem with Cryptographic Applications.- On Quantum and Approximate Privacy.- On Quantum Versions of the Yao Principle.-Computational and Structural Complexity.- Describing Parameterized Complexity Classes.- On the Computational Power of Boolean Decision Lists.- How Many Missing Answers Can Be Tolerated by Query Learners?.- Games with a Uniqueness Property.- Bi-Immunity Separates Strong NP-Completeness Notions.- Complexity of Semi-algebraic Proofs.- A Lower Bound Technique for Restricted Branching Programs and Applications.- The Complexity of Constraints on Intervals and Lengths.- Automata and Formal Languages.- Nesting Until and Since in Linear Temporal Logic.- Comparing Verboseness for Finite Automata and Turing Machines.- On the Average Parallelism in Trace Monoids.- A Further Step towards a Theory of Regular MSC Languages.- Existential and Positive Theories of Equations in Graph Products.- The Membership Problem for Regular Expressions with Intersection Is Complete in LOGCFL.- Recognizable Sets of Message Sequence Charts.- Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard.- On the Enumerative Sequences of Regular Languages on k Symbols.- Logic in Computer Science.- Ground Tree Rewriting Graphs of Bounded Tree Width.- Timed Control Synthesis for External Specifications.- Axiomatizing GSOS with Termination.- Axiomatising Tree-Interpretable Structures.- EXPSPACE-Complete Variant of Guarded Fragment with Transitivity.- A Parametric Analysis of the State Explosion Problem in Model Checking.- Generalized Model-Checking over Locally Tree-Decomposable Classes.- Learnability and Definability in Trees and Similar Structures.
      Hoppa över listan

      Du kanske också är intresserad av

      Afonso Ferreira, Helmut Alt - STACS 2002, E-bok

      STACS 2002

      Afonso Ferreira, Helmut Alt

      E-bok
      2003

      1 413 kr

      Afonso Ferreira, Jose Rolim - Parallel Algorithms for Irregularly Structured Problems, Häftad

      Parallel Algorithms for Irregularly Structured Problems

      Afonso Ferreira, Jose Rolim

      Häftad, 1995

      566 kr

      Michel Cosnard, Afonso Ferreira, Joseph Peters - Parallel and Distributed Computing: Theory and Practice, Häftad

      Parallel and Distributed Computing: Theory and Practice

      Michel Cosnard, Afonso Ferreira, Joseph Peters

      Häftad, 1994

      566 kr

      Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner - Algorithms Unplugged, Häftad

      Algorithms Unplugged

      Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner

      Häftad, 2016

      1 200 kr

      Helmut Alt - Computational Discrete Mathematics, E-bok

      Computational Discrete Mathematics

      Helmut Alt

      E-bok
      2003

      712 kr

      Afonso Ferreira, Jose Rolim, Horst Simon, Shang-Hua Teng - Solving Irregularly Structured Problems in Parallel, Häftad

      Solving Irregularly Structured Problems in Parallel

      Afonso Ferreira, Jose Rolim, Horst Simon, Shang-Hua Teng

      Häftad, 1998

      566 kr

      Afonso Ferreira, Alfonso Ferreira, José Rolim - Parallel Algorithms for Irregular Problems: State of the Art, Inbunden

      Parallel Algorithms for Irregular Problems: State of the Art

      Afonso Ferreira, Alfonso Ferreira, José Rolim

      Inbunden, 1995

      1 634 kr

      Horst Reichel, Afonso Ferreira - STACS 2001, E-bok

      STACS 2001

      Horst Reichel, Afonso Ferreira

      E-bok
      2003

      732 kr

      Gianfranco Bilardi, Afonso Ferreira, Reinhard Lüling, Jose Rolim - Solving Irregularly Structured Problems in Parallel, Häftad

      Solving Irregularly Structured Problems in Parallel

      Gianfranco Bilardi, Afonso Ferreira, Reinhard Lüling, Jose Rolim

      Häftad, 1997

      566 kr

      Afonso Ferreira, Horst Reichel - STACS 2001, Häftad

      STACS 2001

      Afonso Ferreira, Horst Reichel

      Häftad, 2001

      566 kr