• 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

Upp till 20% på populära nyheter →

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 @ 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 2004

      21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings

      AvVolker Diekert,Michel Habib

      Häftad, Engelska, 2004

      Del i serien Lecture Notes in Computer Science

      1 155 kr

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

      Beskrivning

      The Symposium on Theoretical Aspects of Computer Science (STACS) is alt- nately held in France and in Germany. The conference of March 25-27, 2004 at the Corum, Montpellier was the twenty-?rst in this series. Previous meetings 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), Dresden (2001), Antibes (2002), and Berlin (2003). The symposium looks back at a remarkable tradition of over 20 years. The interest in STACS has been increasing continuously during recent years and has turned it into one of the most signi?cant conferences in theoretical computer science. The STACS 2004 call for papers led to more than 200 submissions from all over the world. Thereviewingprocesswasextremelyhard:morethan800reviewsweredone. We would like to thank the program committee and all external referees for the valuable work they put into the reviewing process of this conference. We had a two-day meeting for the program committee in Montpellier during November 21-22, 2003.Just 54 papers (i.e., 27% of the submissions) could be accepted, as we wanted to keep the conference in its standard format with only two parallel sessions. This strict selection guaranteed the very high scienti?c quality of the conference.

      Produktinformation

      • Utgivningsdatum:2004-03-18
      • 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:2004
      • Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
      • ISBN:9783540212362

      Utforska kategorier

      • Systemvetenskap och AI inom Data och IT

      Innehållsförteckning

      • Invited Lectures.- Approximation Schemes for Metric Clustering Problems.- Positional Determinacy of Infinite Games.- Structural Complexity (I).- Individual Communication Complexity.- The Complexity of Satisfiability Problems over Finite Lattices.- Constant Width Planar Computation Characterizes ACC0.- Graph Algorithms (I).- A Simple and Fast Approach for Solving Problems on Planar Graphs.- Sum-Multicoloring on Paths.- Matching Algorithms Are Fast in Sparse Random Graphs.- Quantum Computations.- Algebraic Results on Quantum Automata.- Quantum Identification of Boolean Oracles.- Pattern Inference and Statistics.- Local Limit Distributions in Pattern Statistics: Beyond the Markovian Models.- A Discontinuity in Pattern Inference.- Satisfiability – Constraint Satisfaction Problem.- Algorithms for SAT Based on Search in Hamming Balls.- Identifying Efficiently Solvable Cases of Max CSP.- The Complexity of Boolean Constraint Isomorphism.- Scheduling (I).- On Minimizing the Total Weighted Tardiness on a Single Machine.- Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs.- Optimal and Online Preemptive Scheduling on Uniformly Related Machines.- Algorithms.- Parallel Prefetching and Caching Is Hard.- Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem.- Approximation Algorithms for Minimizing Average Distortion.- Networks (I).- Digraphs Exploration with Little Memory.- Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical Networks.- An Algorithmic View on OVSF Code Assignment.- Automata Theory and Words.- The Syntactic Graph of a Sofic Shift.- Periodicity and Unbordered Words.- Desert Automata and the Finite Substitution Problem.- Structural Complexity (II).- Satisfiability ProblemsComplete for Deterministic Logarithmic Space.- A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number.- The Minimal Logically-Defined NP-Complete Problem.- Path Algorithms.- Solving the 2-Disjoint Paths Problem in Nearly Linear Time.- Simpler Computation of Single-Source Shortest Paths in Linear Average Time.- Cryptography.- Lattices with Many Cycles Are Dense.- Automata-Based Analysis of Recursive Cryptographic Protocols.- Networks (II).- On Minimum Circular Arrangement.- Integral Symmetric 2-Commodity Flows.- Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks.- Logic and Formal Languages.- On the Expressiveness of Deterministic Transducers over Infinite Trees.- Definability and Regularity in Automatic Structures.- Active Context-Free Games.- Graphs Algorithms (II).- Worst Case Performance of an Approximation Algorithm for Asymmetric TSP.- On Visibility Representation of Plane Graphs.- Topology Matters: Smoothed Competitiveness of Metrical Task Systems.- Game Theory and Complexity.- A Randomized Competitive Algorithm for Evaluating Priced AND/OR Trees.- The Plurality Problem with Three Colors.- A Measured Collapse of the Modal ?-Calculus Alternation Hierarchy.- Networks (III).- An Information Theoretic Lower Bound for Broadcasting in Radio Networks.- A New Model for Selfish Routing.- Broadcast in the Rendezvous Model.- Structural Complexity (III).- Time-Space Tradeoff in Derandomizing Probabilistic Logspace.- What Can be Efficiently Reduced to the K-Random Strings?.- Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints between Regular Open Terms.- Scheduling (II).- Deterministic Truthful Approximation Mechanisms for Scheduling RelatedMachines.- The Expected Competitive Ratio for Weighted Completion Time Scheduling.- Algorithmic Information.- Effective Strong Dimension in Algorithmic Information and Computational Complexity.- A Lower Bound on the Competitive Ratio of Truthful Auctions.- Errata to STACS 2003.- Errata to Analysis of the Harmonic Algorithm for Three Servers.
      Hoppa över listan

      Du kanske också är intresserad av

      Michel Habib, Volker Diekert - STACS 2004, E-bok

      STACS 2004

      Michel Habib, Volker Diekert

      E-bok
      2004

      1 470 kr

      Helmut Alt, Michel Habib - STACS 2003, Häftad

      STACS 2003

      Helmut Alt, Michel Habib

      Häftad, 2003

      1 155 kr

      Bruce Reed, Jorge Ramirez-Alfonsin, Colin McDiarmid, Michel Habib - Probabilistic Methods for Algorithmic Discrete Mathematics, E-bok

      Probabilistic Methods for Algorithmic Discrete Mathematics

      Bruce Reed, Jorge Ramirez-Alfonsin, Colin McDiarmid, Michel Habib

      E-bok
      2013

      1 427 kr

      Michel Habib, Christophe Paul - Graph-Theoretic Concepts in Computer Science, E-bok

      Graph-Theoretic Concepts in Computer Science

      Michel Habib, Christophe Paul

      E-bok
      2009

      718 kr

      Andrei Voronkov, Mikhail Volkov, Volker Diekert - Computer Science - Theory and Applications, E-bok

      Computer Science - Theory and Applications

      Andrei Voronkov, Mikhail Volkov, Volker Diekert

      E-bok
      2007

      718 kr

      Michel Habib, Colin McDiarmid, Jorge Ramirez-Alfonsin, Bruce Reed - Probabilistic Methods for Algorithmic Discrete Mathematics, Inbunden
      Del 16

      Probabilistic Methods for Algorithmic Discrete Mathematics

      Michel Habib, Colin McDiarmid, Jorge Ramirez-Alfonsin, Bruce Reed

      Inbunden, 1998

      1 122 kr

      Michel Habib, Colin McDiarmid, Jorge Ramirez-Alfonsin, Bruce Reed - Probabilistic Methods for Algorithmic Discrete Mathematics, Häftad
      Del 16

      Probabilistic Methods for Algorithmic Discrete Mathematics

      Michel Habib, Colin McDiarmid, Jorge Ramirez-Alfonsin, Bruce Reed

      Häftad, 2010

      1 122 kr

      Ulrich Hertrampf, Gerhard Rosenberger, Manfred Kufleitner, Volker Diekert - Elements of Discrete Mathematics, E-bok

      Elements of Discrete Mathematics

      Ulrich Hertrampf, Gerhard Rosenberger, Manfred Kufleitner, Volker Diekert

      E-bok
      2023

      858 kr

      Christophe Paul, Michel Habib - Graph-Theoretic Concepts in Computer Science, Häftad

      Graph-Theoretic Concepts in Computer Science

      Christophe Paul, Michel Habib

      Häftad, 2010

      564 kr

      Michel Habib, Helmut Alt - STACS 2003, E-bok

      STACS 2003

      Michel Habib, Helmut Alt

      E-bok
      2003

      1 413 kr