|Aangeboden in rubriek:
Hebt u iets om te verkopen?

STACS 2002: 19th Annual Symposium on Theoretical Aspects of Computer Science, An

Objectstaat:
Nieuw
7 beschikbaar
Prijs:
US $126,99
OngeveerEUR 117,80
Verzendkosten:
Gratis Economy Shipping. Details bekijkenvoor verzending
Bevindt zich in: Fairfield, Ohio, Verenigde Staten
Levering:
Geschatte levering tussen wo, 22 mei en ma, 3 jun tot 43230
Bij geschatte leveringsdatums - nieuw venster of tabblad wordt rekening gehouden met de verwerkingstijd van de verkoper, de postcode van de verzendlocatie, de postcode van de bestemming, en het moment van aanvaarding. Geschatte leveringsdatums zijn ook afhankelijk van de geselecteerde verzendservice en de ontvangst van de betalingbetaling ontvangen - nieuw venster of tabblad. De leveringstermijnen kunnen variëren, vooral gedurende piekperiodes.
Retourbeleid:
30 dagen om te retourneren. Koper betaalt voor retourzending. Details bekijken- voor meer informatie over retourzendingen
Betalingen:
     

Winkel met vertrouwen

Topverkoper
Betrouwbare verkoper, snelle verzending en eenvoudige retourzending. 
Geld-terug-garantie van eBay
Ontvang het object dat u hebt besteld of krijg uw geld terug. 

Verkopergegevens

Ingeschreven als zakelijke verkoper
De verkoper neemt de volledige verantwoordelijkheid voor deze aanbieding.
eBay-objectnummer:386700061969
Laatst bijgewerkt op 01 apr 2024 15:16:24 CESTAlle herzieningen bekijkenAlle herzieningen bekijken

Specificaties

Objectstaat
Nieuw: Een nieuw, ongelezen en ongebruikt boek in perfecte staat waarin geen bladzijden ontbreken of ...
ISBN-13
9783540432838
Book Title
STACS 2002
ISBN
9783540432838
Series
Lecture Notes in Computer Science Ser.
Publication Year
2002
Type
Textbook
Format
Trade Paperback
Language
English
Publication Name
STACS 2002 : 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan Ies Pins, France, March 2002 Proceedings
Author
Afonso Ferreira
Item Length
9.3in
Publisher
Springer Berlin / Heidelberg
Item Width
6.1in
Item Weight
73 Oz
Number of Pages
Xiv, 660 Pages

Over dit product

Product Information

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.

Product Identifiers

Publisher
Springer Berlin / Heidelberg
ISBN-10
3540432833
ISBN-13
9783540432838
eBay Product ID (ePID)
2305174

Product Key Features

Author
Afonso Ferreira
Publication Name
STACS 2002 : 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan Ies Pins, France, March 2002 Proceedings
Format
Trade Paperback
Language
English
Series
Lecture Notes in Computer Science Ser.
Publication Year
2002
Type
Textbook
Number of Pages
Xiv, 660 Pages

Dimensions

Item Length
9.3in
Item Width
6.1in
Item Weight
73 Oz

Additional Product Features

Series Volume Number
2285
Number of Volumes
1 Vol.
Lc Classification Number
Qa75.5-76.95
Table of Content
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.
Copyright Date
2002
Topic
Information Theory, Computer Science, Databases / General
Lccn
2002-022193
Dewey Decimal
004
Intended Audience
Scholarly & Professional
Dewey Edition
21
Illustrated
Yes
Genre
Computers

Objectbeschrijving van de verkoper

Informatie van zakelijke verkoper

Premier Books LLC
David Taylor
26C Trolley Sq
19806-3356 Wilmington, DE
United States
Contactgegevens weergeven
:liam-Emoc.liaterelgaednarg@yabe
Ik verklaar dat al mijn verkoopactiviteiten zullen voldoen aan alle wet- en regelgeving van de EU.
grandeagleretail

grandeagleretail

98,2% positieve feedback
2,7M objecten verkocht
Reageert meestal binnen 24 uur

Gedetailleerde verkopersbeoordelingen

Gemiddelde van de afgelopen 12 maanden

Nauwkeurige beschrijving
4.9
Redelijke verzendkosten
5.0
Verzendtijd
4.9
Communicatie
4.9
Ingeschreven als zakelijke verkoper

Feedback verkoper (1.022.237)

i***i (128)- Feedback gegeven door koper.
Afgelopen maand
Geverifieerde aankoop
Great price and customer service. Book arrived in perfect condition. Shipping was very fast.
c***c (1698)- Feedback gegeven door koper.
Afgelopen maand
Geverifieerde aankoop
Perfect item and another great transaction with this vendor. Very much appreciated and I recommend them to all. Wrapped well, arrived in perfect shape. Seller is a great communicator, too. Thank you!
r***o (864)- Feedback gegeven door koper.
Afgelopen maand
Geverifieerde aankoop
Great book, pretty easy to read.