- 5 Résultats
prix le plus bas: € 2,49, prix le plus élevé: € 128,39, prix moyen: € 75,90
1
Stacs 2000 - Horst Reichel & Sophie Tison
Commander
sur Orellfuessli.ch
CHF 117,00
(environ € 121,85)
Envoi: € 18,751
Commander
Détails du fournisseur
Lien sponsorisé
Horst Reichel & Sophie Tison:

Stacs 2000 - Livres de poche

2000, ISBN: 9783540671411

STACS,the SymposiumonTheoreticalAspects ofComputerScience,isheld- nually, alternating between France and Germany. STACS is organizedjointly by the Special Interest Group for Theoretical C… Plus…

Nr. A1000380053. Frais d'envoiLieferzeiten außerhalb der Schweiz 3 bis 21 Werktage, , Versandfertig innert 4 - 7 Werktagen, zzgl. Versandkosten. (EUR 18.75)
fermer(X)
2
Stacs 2000
Commander
sur Orellfuessli.ch
CHF 117,00
(environ € 121,14)
Envoi: € 18,641
Commander
Détails du fournisseur
Lien sponsorisé
Stacs 2000 - nouveau livre

2000, ISBN: 9783540671411

STACS,the SymposiumonTheoreticalAspects ofComputerScience,isheld- nually, alternating between France and Germany. STACS is organizedjointly by the Special Interest Group for Theoretical C… Plus…

Nr. A1000380053. Frais d'envoiLieferzeiten außerhalb der Schweiz 3 bis 21 Werktage, , Versandfertig innert 4 - 7 Werktagen, zzgl. Versandkosten. (EUR 18.64)
fermer(X)
3
STACS 2000: 17th Annual Symposium on Theoretical Aspects of Computer Science Lille, France, February 17-19, 2000 Proceedings (Lecture Notes in Computer Science)
Commander
sur ZVAB.com
€ 2,49
Envoi: € 3,501
Commander
Détails du fournisseur
Lien sponsorisé
STACS 2000: 17th Annual Symposium on Theoretical Aspects of Computer Science Lille, France, February 17-19, 2000 Proceedings (Lecture Notes in Computer Science) - Livres de poche

2008

ISBN: 3540671412

[EAN: 9783540671411], Gebraucht, sehr guter Zustand, [SC: 3.5], [PU: Springer Berlin Heidelberg], SICHERHEIT / GRAFIK & MULTIMEDIA IT-AUSBILDUNG -BERUFE INFORMATIK NATURWISSENSCHAFTEN TEC… Plus…

NOT NEW BOOK. Frais d'envoi EUR 3.50 getbooks GmbH, Bad Camberg, HE, Germany [55883480] [Rating: 5 (von 5)]
fermer(X)
4
Commander
sur Biblio.co.uk
$ 6,09
(environ € 5,65)
Envoi: € 20,421
Commander
Détails du fournisseur
Lien sponsorisé
Horst Reichel, Sophie Tison:
STACS 2000: 17th Annual Symposium on Theoretical Aspects of Computer Science Lille, France, February 17-19, 2000 Proceedings (Lecture Notes in Computer Science) - Livres de poche

2000, ISBN: 9783540671411

Springer, 2000. 662 pp., Paperback, ex library, else text clean and binding tight. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once… Plus…

Frais d'envoi EUR 20.42 Zubal Books
fermer(X)
5
STACS 2000 - Horst Reichel; Sophie Tison
Commander
sur lehmanns.de
€ 128,39
Envoi: € 0,001
Commander
Détails du fournisseur
Lien sponsorisé
Horst Reichel; Sophie Tison:
STACS 2000 - Livres de poche

2000, ISBN: 9783540671411

17th Annual Symposium on Theoretical Aspects of Computer Science Lille, France, February 17-19, 2000 Proceedings, Buch, Softcover, [PU: Springer Berlin], Springer Berlin, 2000

Frais d'envoiVersand in 10-14 Tagen. (EUR 0.00)
fermer(X)
1Comme certaines plateformes ne transmettent pas les conditions d'expédition et que celles-ci peuvent dépendre du pays de livraison, du prix d'achat, du poids et de la taille de l'article, d'une éventuelle adhésion de la plateforme, d'une livraison directe par la plateforme ou via un prestataire tiers (Marketplace), etc. il est possible que les frais de livraison indiqués par eurolivre ne correspondent pas à ceux de la plateforme qui propose l'article.

Données bibliographiques du meilleur livre correspondant

Détails sur le livre
STACS 2000
Auteur:
Titre:
ISBN:

3540671412


This book constitutes the refereed proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000, held in Lille, France in February 2000.The 51 revised full papers presented together with the three invited papers were carefully reviewed and selected from a total of 146 submissions on the basis of some 700 reviewers' reports. The papers address fundamental issues from all current areas of theoretical computer science including algorithms, data structures, automata, formal languages, complexity, verification, logic, cryptography, graph theory, optimization, etc.

Informations détaillées sur le livre - STACS 2000


EAN (ISBN-13): 9783540671411
ISBN (ISBN-10): 3540671412
Livre de poche
Date de parution: 2000
Editeur: Springer Berlin
684 Pages
Poids: 1,017 kg
Langue: eng/Englisch

Livre dans la base de données depuis 2008-03-24T09:07:39+01:00 (Paris)
Page de détail modifiée en dernier sur 2023-09-29T14:00:43+02:00 (Paris)
ISBN/EAN: 3540671412

ISBN - Autres types d'écriture:
3-540-67141-2, 978-3-540-67141-1
Autres types d'écriture et termes associés:
Auteur du livre: reichel, lill, tison, tiso, büch horst
Titre du livre: lille, aspects france, annual symposium theoretical aspects computer science, lecture notes computer science, 2000, february, proceedings, therapieren

Données de l'éditeur

Auteur: Horst Reichel; Sophie Tison
Titre: Lecture Notes in Computer Science; STACS 2000 - 17th Annual Symposium on Theoretical Aspects of Computer Science Lille, France, February 17-19, 2000 Proceedings
Editeur: Springer; Springer Berlin
670 Pages
Date de parution: 2000-02-09
Berlin; Heidelberg; DE
Langue: Anglais
106,99 € (DE)
109,99 € (AT)
118,00 CHF (CH)
Available
XIV, 670 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Algorithmen und Datenstrukturen; Verstehen; Automat; algorithms; automata; complexity; computer; computer science; data structures; formal language; formal languages; logic; optimization; verification; Data Structures and Information Theory; Software Engineering; Theory of Computation; Computer Graphics; Mathematics of Computing; Informationstheorie; Software Engineering; Theoretische Informatik; Grafikprogrammierung; Mathematik für Informatiker; EA

Codes and Graphs.- A Classification of Symbolic Transition Systems.- Circuits versus Trees in Algebraic Complexity.- On the Many Faces of Block Codes.- A New Algorithm for MAX-2-SAT.- Bias Invariance of Small Upper Spans.- The Complexity of Planarity Testing.- About Cube-Free Morphisms.- Linear Cellular Automata with Multiple State Variables.- Two-Variable Word Equations.- Average-Case Quantum Query Complexity.- Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs.- The Boolean Hierarchy of NP-Partitions.- Binary Exponential Backoff Is Stable for High Arrival Rates.- The Data Broadcast Problem with Preemption.- An Approximate L p-Difference Algorithm for Massive Data Streams.- Succinct Representations of Model Based Belief Revision.- Logics Capturing Local Properties.- The Complexity of Poor Man’s Logic.- Fast Integer Sorting in Linear Space.- On the Performance of WEAK-HEAPSORT.- On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers.- Real-Time Automata and the Kleene Algebra of Sets of Real Numbers.- Small Progress Measures for Solving Parity Games.- Multi-linearity Self-Testing with Relative Error.- Nondeterministic Instance Complexity and Hard-to-Prove Tautologies.- Hard Instances of Hard Problems.- Simulation and Bisimulation over One-Counter Processes.- Decidability of Reachability Problems for Classes of Two Counters Automata.- Hereditary History Preserving Bisimilarity Is Undecidable.- The Hardness of Approximating Spanner Problems.- An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality.- ?-Coloring of Graphs.- Optimal Proof Systems and Sparse Sets.- Almost Complete Sets.- GraphIsomorphism Is Low for ZPP(NP) and Other Lowness Results.- An Approximation Algorithm for the Precedence Constrained Scheduling Problem with Hierarchical Communications.- Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem.- Controlled Conspiracy-2 Search.- The Stability of Saturated Linear Dynamical Systems Is Undecidable.- Tilings: Recursivity and Regularity.- Listing All Potential Maximal Cliques of a Graph.- Distance Labeling Schemes for Well-Separated Graph Classes.- Pruning Graphs with Digital Search Trees. Application to Distance Hereditary Graphs.- Characterizing and Deciding MSO-Definability of Macro Tree Transductions.- Languages of Dot-Depth 3/2.- Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures.- The CNN Problem and Other k-Server Variants.- The Weighted 2-Server Problem.- On the Competitive Ratio of the Work Function Algorithm for the k-Server Problem.- Spectral Bounds on General Hard Core Predicates.- Randomness in Visual Cryptography.- Online Dial-a-Ride Problems: Minimizing the Completion Time.- The Power Range Assignment Problem in Radio Networks on the Plane.
Includes supplementary material: sn.pub/extras
< pour archiver...