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… More...
Orellfuessli.ch Nr. A1000380053. Shipping costs:Lieferzeiten außerhalb der Schweiz 3 bis 21 Werktage, , Versandfertig innert 4 - 7 Werktagen, zzgl. Versandkosten. (EUR 18.75) Details... |
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… More...
Orellfuessli.ch Nr. A1000380053. Shipping costs:Lieferzeiten außerhalb der Schweiz 3 bis 21 Werktage, , Versandfertig innert 4 - 7 Werktagen, zzgl. Versandkosten. (EUR 18.64) Details... |
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… More...
ZVAB.com getbooks GmbH, Bad Camberg, HE, Germany [55883480] [Rating: 5 (von 5)] NOT NEW BOOK. Shipping costs: EUR 3.50 Details... |
STACS 2000: 17th Annual Symposium on Theoretical Aspects of Computer Science Lille, France, February 17-19, 2000 Proceedings (Lecture Notes in Computer Science) - Paperback
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… More...
Biblio.co.uk |
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
lehmanns.de Shipping costs:Versand in 10-14 Tagen. (EUR 0.00) Details... |
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… More...
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… More...
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… More...
STACS 2000: 17th Annual Symposium on Theoretical Aspects of Computer Science Lille, France, February 17-19, 2000 Proceedings (Lecture Notes in Computer Science) - Paperback
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… More...
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
Bibliographic data of the best matching book
Author: | |
Title: | |
ISBN: |
Details of the book - STACS 2000
EAN (ISBN-13): 9783540671411
ISBN (ISBN-10): 3540671412
Paperback
Publishing year: 2000
Publisher: Springer Berlin
684 Pages
Weight: 1,017 kg
Language: eng/Englisch
Book in our database since 2008-03-24T08:07:39+00:00 (London)
Detail page last modified on 2023-09-29T13:00:43+01:00 (London)
ISBN/EAN: 9783540671411
ISBN - alternate spelling:
3-540-67141-2, 978-3-540-67141-1
Alternate spelling and related search-keywords:
Book author: reichel, lill, tison, tiso, büch horst
Book title: lille, aspects france, annual symposium theoretical aspects computer science, lecture notes computer science, 2000, february, proceedings, therapieren
Information from Publisher
Author: Horst Reichel; Sophie Tison
Title: Lecture Notes in Computer Science; STACS 2000 - 17th Annual Symposium on Theoretical Aspects of Computer Science Lille, France, February 17-19, 2000 Proceedings
Publisher: Springer; Springer Berlin
670 Pages
Publishing year: 2000-02-09
Berlin; Heidelberg; DE
Language: English
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
More/other books that might be very similar to this book
Latest similar book:
9783540465416 STACS 2000 (Horst Reichel; Sophie Tison)
- 9783540465416 STACS 2000 (Horst Reichel; Sophie Tison)
- 9780387537092 Stacs, 91: 8th Annual Symposium on Theoretical Aspects of Computer Science Hamburg, Germany, February 14-16, 1991 (Lecture Notes in Computer Science) (C. Choffrut, M. Jantzen)
- 9780387552101 Stacs 92: 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992 : Proceedings (Lecture Notes in Computer Science) (Finkel, A)
- 9780387522821 Language Policy and Modernity in Southeast Asia (Lecture Notes in Computer Science) (Antonio L. Rappa, Lionel Wee Hock An)
- [(STACS 2003: v. 2607: 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003. Proceedings)] [by: Helmut Alt] (Helmut Alt)
< to archive...