• 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 2001

      18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001. Proceedings

      AvAfonso Ferreira,Horst Reichel

      Häftad, Engelska, 2001

      Del i serien Lecture Notes in Computer Science

      566 kr

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

      Beskrivning

      The Symposium on Theoretical Aspects of Computer Science (STACS) is held annually, alternating between France and Germany. The STACS meetings are organized jointly by the Special Interest Group for Theoretical Computer S- ence of the Gesellschaft fu r Informatik (GI) in Germany and the Maison de l'Informatique et des Math ematiques Discr etes (MIMD) in France. STACS2001 was the 18th in this series, held in Dresden, February 15-17, 2001. PreviousSTACS symposia took placein Paris(1984),Saarbr. ucken(1985), Orsay(1986),Passau(1987),Bordeaux(1988),Paderborn(1989),Rouen(1990), Hamburg(1991),Cachan(1992),Wu rzburg(1993),Caen(1994),Mu nchen(1995), Grenoble (1996), Lub .. eck (1997), Paris (1998), Trier (1999), and Lille (2000). It may be worth noting that in 2001 the symposium was held in one of the new states of reunited Germany for the r st time. The proceedings of all of these symposia have been published in the Lecture Notes in Computer Science series of Springer{Verlag. STACS has become 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 foundations of computer science: algorithms and data structures, automata and formallanguages,computationaland structuralcomplexity, logic, veri cation, and current challenges. This year, 153 submissions were received, mostly in electronic form, from more than 30 countries, with a fair portion from non{European countries. We would like to thank Jochen Bern who designed the electronic submission procedure which performed marvelously and was of great help to the program committee.

      Produktinformation

      • Utgivningsdatum:2001-02-07
      • Mått:155 x 233 x 33 mm
      • Vikt:896 g
      • Format:Häftad
      • Språk:Engelska
      • Serie:Lecture Notes in Computer Science
      • Antal sidor:580
      • Upplaga:2001
      • Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
      • ISBN:9783540416951

      Utforska kategorier

      • Systemvetenskap och AI inom Data och IT
      • Databaser inom Data och IT
      • Programmeringsböcker inom Data och IT

      Innehållsförteckning

      • Invited Presentations.- Recurrence in Infinite Words.- Generalized Model-Checking Problems for First-Order Logic.- Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra.- Contributions.- 2-Nested Simulation Is Not Finitely Equationally Axiomatizable.- On the Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems.- Matching Polygonal Curves with Respect to the Fréchet Distance.- On the Class of Languages Recognizable by 1-Way Quantum Finite Automata.- Star-Free Open Languages and Aperiodic Loops.- A 5/2n 2-Lower Bound for the Multiplicative Complexity of n × n-Matrix Multiplication.- Evasiveness of Subgraph Containment and Related Properties.- On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs.- On Presburger Liveness of Discrete Timed Automata.- Residual Finite State Automata.- Deterministic Radio Broadcasting at Low Cost.- The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE—Complete.- Recursive Randomized Coloring Beats Fair Dice Random Colorings.- Randomness, Computability, and Density.- On Multipartition Communication Complexity.- Scalable Sparse Topologies with Small Spectrum.- Optimal Preemptive Scheduling on Uniform Processors with Non-decreasing Speed Ratios.- The UPS Problem.- Gathering of Asynchronous Oblivious Robots with Limited Visibility.- Generalized Langton’s Ant: Dynamical Behavior and Complexity.- Optimal and Approximate Station Placement in Networks.- Learning Expressions over Monoids.- Efficient Recognition of Random Unsatisfiable k-SAT Instances by Spectral Methods.- On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages.- Efficient Minimal Perfect Hashing in NearlyMinimal Space.- Small PCPs with Low Query Complexity.- Space Efficient Algorithms for Series-Parallel Graphs.- A Toolkit for First Order Extensions of Monadic Games.- Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs.- Refining the Hierarchy of Blind Multicounter Languages.- A Simple Undecidable Problem: The Inclusion Problem for Finite Substitutions on ab*c.- New Results on Alternating and Non-deterministic Two-Dimensional Finite-State Automata.- The Complexity of Minimal Satisfiability Problems.- On the Minimal Hardware Complexity of Pseudorandom Function Generators.- Approximation Algorithms for Minimum Size 2-Connectivity Problems.- A Model Theoretic Proof of Büchi-Type Theorems and First-Order Logic for N-Free Pomsets.- An Ehrenfeucht-Fraïssé Approach to Collapse Results for First-Order Queries over Embedded Databases.- A New Logical Characterization of Büchi Automata.- A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph.- The Complexity of Copy Constant Detection in Parallel Programs.- Approximation Algorithms for the Bottleneck Stretch Factor Problem.- Semantical Principles in the Modal Logic of Coalgebras.- The #a = #b Pictures Are Recognizable.- A Logical Approach to Decidability of Hierarchies of Regular Star—Free Languages.- Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables.- New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing.
      Hoppa över listan

      Du kanske också är intresserad av

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

      STACS 2001

      Horst Reichel, Afonso Ferreira

      E-bok
      2003

      732 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

      Hartmut Ehrig, Klaus P. Jantke, Fernando Orejas, Horst Reichel - Recent Trends in Data Type Specification, Häftad

      Recent Trends in Data Type Specification

      Hartmut Ehrig, Klaus P. Jantke, Fernando Orejas, Horst Reichel

      Häftad, 1991

      566 kr

      Horst Reichel - Informatik — Wirtschaft — Gesellschaft, Häftad

      Informatik — Wirtschaft — Gesellschaft

      Horst Reichel

      Häftad, 1993

      581 kr

      Horst Reichel - Fundamentals of Computation Theory, Häftad

      Fundamentals of Computation Theory

      Horst Reichel

      Häftad, 1995

      566 kr

      Horst Reichel - Initial Computability, Algebraic Specifications, and Partial Algebras, E-bok

      Initial Computability, Algebraic Specifications, and Partial Algebras

      Horst Reichel

      E-bok
      2022

      1 461 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

      Horst Reichel - Informatik — Wirtschaft — Gesellschaft, E-bok

      Informatik — Wirtschaft — Gesellschaft

      Horst Reichel

      E-bok
      2013

      603 kr

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

      STACS 2002

      Afonso Ferreira, Helmut Alt

      E-bok
      2003

      1 413 kr