STACS 2002 : 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings - Taschenbuch
2002, ISBN: 3540432833
[EAN: 9783540432838], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], INFORMATIK; AUTOMAT; ALGORITHMS; AUTOMATA; COMPLEXITY; COMPUTERSCIENCE; FORMALLANGUAGE; FORMALLANGUAGES; LOGIC;… Mehr…
ZVAB.com AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)] NEW BOOK. Versandkosten:Versandkostenfrei. (EUR 0.00) Details... |
2002, ISBN: 9783540432838
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… Mehr…
BarnesandNoble.com new in stock. Versandkosten:zzgl. Versandkosten. Details... |
2027, ISBN: 9783540432838
[ED: Taschenbuch], [PU: Springer Berlin Heidelberg], Neuware - The Symposium on Theoretical Aspects of Computer Science (STACS) has - come one of the most important annual meetings in Eur… Mehr…
booklooker.de BuchWeltWeit Inh. Ludwig Meier e.K. Versandkosten:Versandkostenfrei, Versand nach Deutschland. (EUR 0.00) Details... |
2002, ISBN: 9783540432838
Taschenbuch
[ED: Kartoniert / Broschiert], [PU: Springer Berlin Heidelberg], Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Invited Papers.- Hyper-En… Mehr…
booklooker.de |
2002, ISBN: 3540432833
Médias > Livres > Sciences Springer GF, [PU: Springer, Berlin/Heidelberg]
Livrenpoche.com |
STACS 2002 : 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings - Taschenbuch
2002, ISBN: 3540432833
[EAN: 9783540432838], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], INFORMATIK; AUTOMAT; ALGORITHMS; AUTOMATA; COMPLEXITY; COMPUTERSCIENCE; FORMALLANGUAGE; FORMALLANGUAGES; LOGIC;… Mehr…
2002, ISBN: 9783540432838
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… Mehr…
2027
ISBN: 9783540432838
[ED: Taschenbuch], [PU: Springer Berlin Heidelberg], Neuware - The Symposium on Theoretical Aspects of Computer Science (STACS) has - come one of the most important annual meetings in Eur… Mehr…
2002, ISBN: 9783540432838
Taschenbuch
[ED: Kartoniert / Broschiert], [PU: Springer Berlin Heidelberg], Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Invited Papers.- Hyper-En… Mehr…
2002, ISBN: 3540432833
Médias > Livres > Sciences Springer GF, [PU: Springer, Berlin/Heidelberg]
Bibliographische Daten des bestpassenden Buches
Autor: | |
Titel: | |
ISBN-Nummer: |
Detailangaben zum Buch - STACS 2002: 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings Helmut A
EAN (ISBN-13): 9783540432838
ISBN (ISBN-10): 3540432833
Taschenbuch
Erscheinungsjahr: 2002
Herausgeber: Springer Berlin Heidelberg Core >1
680 Seiten
Gewicht: 1,011 kg
Sprache: eng/Englisch
Buch in der Datenbank seit 2007-03-06T03:04:38+01:00 (Zurich)
Detailseite zuletzt geändert am 2024-04-15T11:26:29+02:00 (Zurich)
ISBN/EAN: 9783540432838
ISBN - alternative Schreibweisen:
3-540-43283-3, 978-3-540-43283-8
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: alt helmut, ferreira, afonso, tolkien, bäumner, neuhaus
Titel des Buches: aspects france, juan les pins, antibes, annual symposium theoretical aspects computer science, 19th annual lecture, stacs, muslim societies africa, herr der ringe, world jazz and blues, lecture notes computer science, 2002, grenzgang, proceedings, ewiger
Daten vom Verlag:
Autor/in: Helmut Alt; Afonso Ferreira
Titel: Lecture Notes in Computer Science; STACS 2002 - 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings
Verlag: Springer; Springer Berlin
660 Seiten
Erscheinungsjahr: 2002-02-27
Berlin; Heidelberg; DE
Sprache: Englisch
106,99 € (DE)
109,99 € (AT)
118,00 CHF (CH)
Available
XIV, 660 p.
BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Automat; algorithms; automata; complexity; computer; computer science; formal language; formal languages; logic; data structures; Theory of Computation; Data Structures and Information Theory; Computer and Information Systems Applications; Data Science; Computer Graphics; Discrete Mathematics in Computer Science; Algorithmen und Datenstrukturen; Informationstheorie; Angewandte Informatik; Datenbanken; Grafikprogrammierung; Mathematik für Informatiker; Diskrete Mathematik; EA
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.Includes supplementary material: sn.pub/extras
Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
Neuestes ähnliches Buch:
9783540458418 STACS 2002 (Helmut Alt; Afonso Ferreira)
- 9783540458418 STACS 2002 (Helmut Alt; Afonso Ferreira)
- 9780387172194 Stacs 87: 4th Annual Symposium on Theoretical Aspects of Computer Science Passau, Federal Republic of Germany, February 19-21, 1987 Proceedings (Lecture Notes in Computer Science) (Wirsing, M., Franz J. Brandenburg and G. Vidal-Naquet)
< zum Archiv...