- 5 Ergebnisse
Kleinster Preis: € 33,92, größter Preis: € 109,99, Mittelwert: € 90,57
1
STACS 2003 - Michel Habib
Bestellen
bei AbeBooks.de
€ 106,99
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link
Michel Habib:

STACS 2003 - Taschenbuch

2003, ISBN: 3540006230

[EAN: 9783540006237], Neubuch, [PU: Springer Berlin Heidelberg Feb 2003], EDV / THEORIE ALLGEMEINES; AUTOMAT; ALGORITHMS; AUTOMATA; COMPLEXITY; COMPLEXITYTHEORY; COMPUTERSCIENCE; DATASTRU… Mehr…

NEW BOOK. Versandkosten:Versandkostenfrei. (EUR 0.00) BuchWeltWeit Inh. Ludwig Meier e.K., Bergisch Gladbach, Germany [57449362] [Rating: 5 (von 5)]
zuklappen (X)
2
STACS 2003: 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003. Proceedings Helmut Alt Edi
Bestellen
bei BarnesandNoble.com
€ 109,99
Bestellen
Details und Versand
gesponserter Link
STACS 2003: 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003. Proceedings Helmut Alt Edi - neues Buch

2003, ISBN: 9783540006237

The Symposium on Theoretical Aspects of Computer Science (STACS) is - ternately held in France and Germany. The latest conference, February 27 to March 1, 2003 at the Institute of Compute… Mehr…

new in stock. Versandkosten:zzgl. Versandkosten.
zuklappen (X)
3
STACS 2003: 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003. Proceedings Helmut Alt Edi
Bestellen
bei BarnesandNoble.com
€ 109,99
Bestellen
Details und Versand
gesponserter Link
STACS 2003: 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003. Proceedings Helmut Alt Edi - neues Buch

2003

ISBN: 9783540006237

This book constitutes the refereed proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2003, held in Berlin, Germany in February/March 2003. The 58 … Mehr…

new in stock. Versandkosten:zzgl. Versandkosten.
zuklappen (X)
4
STACS 2003: 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003. Proceedings. - Helmut and Michel Habib Alt
Bestellen
bei ZVAB.com
€ 33,92
Versand: € 4,001
Bestellen
Details beim Anbieter
gesponserter Link
Helmut and Michel Habib Alt:
STACS 2003: 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003. Proceedings. - Taschenbuch

2003, ISBN: 3540006230

[EAN: 9783540006237], [SC: 4.0], [PU: Germany Springer Verlag Berlin], ALGORITHMS; DISTRIBUTED SYSTEMS; PARALLEL COMPUTING; COMPLEXITY THEORY; FORMAL METHODS; LANGUAGES; COMPUTER SCIENCE … Mehr…

Versandkosten: EUR 4.00 CSG Onlinebuch GMBH, Darmstadt, Germany [85260580] [Rating: 5 (von 5)]
zuklappen (X)
5
STACS 2003 - Alt, Helmut Habib, Michel
Bestellen
bei booklooker.de
€ 91,95
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link
Alt, Helmut Habib, Michel:
STACS 2003 - Erstausgabe

2003, ISBN: 9783540006237

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.- Logic as… Mehr…

Versandkosten:Versandkostenfrei, Versand nach Deutschland. (EUR 0.00) Moluna GmbH
zuklappen (X)
1Da einige Plattformen keine Versandkonditionen übermitteln und diese vom Lieferland, dem Einkaufspreis, dem Gewicht und der Größe des Artikels, einer möglichen Mitgliedschaft der Plattform, einer direkten Lieferung durch die Plattform oder über einen Drittanbieter (Marketplace), etc. abhängig sein können, ist es möglich, dass die von eurobuch angegebenen Versandkosten nicht mit denen der anbietenden Plattform übereinstimmen.

Bibliographische Daten des bestpassenden Buches

Details zum Buch
STACS 2003: 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003. Proceedings Helmut Alt Edi
Autor:
Titel:
ISBN-Nummer:

9783540006237


This book constitutes the refereed proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2003, held in Berlin, Germany in February/March 2003.The 58 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 253 submissions. The papers address the whole range of theoretical computer science including algorithms and data structures, automata and formal languages, complexity theory, semantics, logic in computer science, as well as current challenges like biological computing, quantum computing, and mobile and net computing.

Detailangaben zum Buch - STACS 2003: 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003. Proceedings Helmut Alt Edi


EAN (ISBN-13): 9783540006237
ISBN (ISBN-10): 3540006230
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2003
Herausgeber: Springer Berlin Heidelberg Core >1
724 Seiten
Gewicht: 1,075 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2007-05-30T23:54:05+02:00 (Zurich)
Detailseite zuletzt geändert am 2024-03-31T10:32:40+02:00 (Zurich)
ISBN/EAN: 9783540006237

ISBN - alternative Schreibweisen:
3-540-00623-0, 978-3-540-00623-7
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: alt helmut, habib, springer, kiki smiths, kiki smith, perrin daniel, curcio, michel, paris
Titel des Buches: march, 2003 band, 20th, annual symposium theoretical aspects computer science, prints books things, zauberpflanzen hexenkräuter, schreiben, chinesische astrologie, notes berlin, february

Daten vom Verlag:

Autor/in: Helmut Alt; Michel Habib
Titel: Lecture Notes in Computer Science; STACS 2003 - 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003. Proceedings
Verlag: Springer; Springer Berlin
706 Seiten
Erscheinungsjahr: 2003-02-21
Berlin; Heidelberg; DE
Sprache: Englisch
106,99 € (DE)
109,99 € (AT)
118,00 CHF (CH)
Available
XVIII, 706 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Automat; algorithms; automata; complexity; complexity theory; computer; computer science; data structures; formal language; formal languages; logic; theoretical computer science; Theory of Computation; Computer Science; Data Science; Discrete Mathematics in Computer Science; Informatik; Datenbanken; Mathematik für Informatiker; Diskrete Mathematik; EA

Invited Papers.- Logic as a Query Language: From Frege to XML.- How Does Computer Science Change Molecular Biology?.- Contributed Papers.- Improved Compact Visibility Representation of Planar Graph via Schnyder’s Realizer.- Rectangle Visibility Graphs: Characterization, Construction, and Compaction.- Approximating Geometric Bottleneck Shortest Paths.- Optimization in Arrangements.- Complete Classifications for the Communication Complexity of Regular Languages.- The Commutation with Codes and Ternary Sets of Words.- On the Confluence of Linear Shallow Term Rewrite Systems.- Wadge Degrees of ?-Languages of Deterministic Turing Machines.- Faster Deterministic Broadcasting in Ad Hoc Radio Networks.- Private Computations in Networks: Topology versus Randomness.- On Shortest-Path All-Optical Networks without Wavelength Conversion Requirements.- Lattice Reduction by Random Sampling and Birthday Methods.- On the Ultimate Complexity of Factorials.- On the Effective Jordan Decomposability.- Fast Algorithms for Extended Regular Expression Matching and Searching.- Algorithms for Transposition Invariant String Matching (Extended Abstract).- On the Complexity of Finding a Local Maximum of Functions on Discrete Planar Subsets.- Some Results on Derandomization.- On the Representation of Boolean Predicates of the Diffie-Hellman Function.- Quantum Circuits with Unbounded Fan-out.- Analysis of the Harmonic Algorithm for Three Servers.- Non-clairvoyant Scheduling for Minimizing Mean Slowdown.- Space Efficient Hash Tables with Worst Case Constant Access Time.- Randomized Jumplists: A Jump-and-Walk Dictionary Data Structure.- Complexity Theoretical Results on Nondeterministic Graph-Driven Read-Once Branching Programs.- Randomness versus Nondeterminism for Read-Once and Read-k BranchingPrograms.- Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids.- Algebraic Characterizations of Small Classes of Boolean Functions.- On the Difficulty of Some Shortest Path Problems.- Representing Graph Metrics with Fewest Edges.- Computing Shortest Paths with Uncertainty.- Solving Order Constraints in Logarithmic Space.- The Inversion Problem for Computable Linear Operators.- Algebras of Minimal Rank over Arbitrary Fields.- Evolutionary Algorithms and the Maximum Matching Problem.- Alternative Algorithms for Counting All Matchings in Graphs.- Strong Stability in the Hospitals/Residents Problem.- The Inference Problem for Propositional Circumscription of Afine Formulas Is coNP-Complete.- Decidable Theories of Cayley-Graphs.- The Complexity of Resolution with Generalized Symmetry Rules.- Colouring Random Graphs in Expected Polynomial Time.- An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation.- Finding Large Independent Sets in Polynomial Expected Time.- Distributed Soft Path Coloring.- Competing Provers Yield Improved Karp-Lipton Collapse Results.- One Bit of Advice.- Strong Reductions and Immunity for Exponential Time.- The Complexity of Membership Problems for Circuits over Sets of Natural Numbers.- Performance Ratios for the Differencing Method Applied to the Balanced Number Partitioning Problem.- Cake-Cutting Is Not a Piece of Cake.- The Price of Truth: Frugality in Truthful Mechanisms.- Untameable Timed Automata!.- The Intrinsic Universality Problem of One-Dimensional Cellular Automata.- On Sand Automata.- Adaptive Sorting and the Information Theoretic Lower Bound.- A Discrete Subexponential Algorithm for Parity Games.- Cryptographically Sound and Machine-Assisted Verification of Security Protocols.- Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic.
Includes supplementary material: sn.pub/extras
< zum Archiv...