- 5 Ergebnisse
Kleinster Preis: € 85,59, größter Preis: € 96,29, Mittelwert: € 93,49
1
STACS 97 - Rüdiger Reischuk; Michel Morvan
Bestellen
bei Springer.com
€ 96,29
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link
Rüdiger Reischuk; Michel Morvan:

STACS 97 - neues Buch

ISBN: 9783540683421

This book constitutes the refereed proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science, STACS 97, held in Lübeck, Germany, in February/March 1997. The 46 … Mehr…

new in stock. Versandkosten:zzgl. Versandkosten. (EUR 0.00)
zuklappen (X)
2
STACS 97
Bestellen
bei Springer.com
€ 85,59
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link
STACS 97 - neues Buch

ISBN: 9783540683421

This book constitutes the refereed proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science, STACS 97, held in Lübeck, Germany, in February/March 1997. The 46 r… Mehr…

Nr. 978-3-540-68342-1. Versandkosten:Worldwide free shipping, , DE. (EUR 0.00)
zuklappen (X)
3
STACS 97 - Rüdiger Reischuk; Michel Morvan
Bestellen
bei Springer.com
€ 95,19
Bestellen
Details und Versand
gesponserter Link
Rüdiger Reischuk; Michel Morvan:
STACS 97 - neues Buch

ISBN: 9783540683421

Computer Science; Theory of Computation; Programming Techniques; Programming Languages, Compilers, Interpreters; Discrete Mathematics in Computer Science Automat, algorithm, algorithms, a… Mehr…

  - Versandkosten:zzgl. Versandkosten
zuklappen (X)
4
STACS 97 - Rüdiger Reischuk; Michel Morvan
Bestellen
bei Springer.com
€ 95,19
Bestellen
Details und Versand
gesponserter Link
Rüdiger Reischuk; Michel Morvan:
STACS 97 - neues Buch

ISBN: 9783540683421

Computer Science; Theory of Computation; Programming Techniques; Programming Languages, Compilers, Interpreters; Discrete Mathematics in Computer Science Automat, algorithm, algorithms, a… Mehr…

  - Versandkosten:zzgl. Versandkosten.
zuklappen (X)
5
STACS 97 - Rüdiger Reischuk; Michel Morvan
Bestellen
bei Springer.com
€ 95,19
Bestellen
Details und Versand
gesponserter Link
Rüdiger Reischuk; Michel Morvan:
STACS 97 - neues Buch

ISBN: 9783540683421

Computer Science; Theory of Computation; Programming Techniques; Programming Languages, Compilers, Interpreters; Discrete Mathematics in Computer Science Automat, algorithm, algorithms, a… Mehr…

  - Versandkosten:zzgl. Versandkosten.
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 97
Autor:
Titel:
ISBN-Nummer:

9783540683421

Detailangaben zum Buch - STACS 97


EAN (ISBN-13): 9783540683421
Herausgeber: Springer Science+Business Media

Buch in der Datenbank seit 2017-01-29T17:51:17+01:00 (Zurich)
Detailseite zuletzt geändert am 2024-03-31T10:32:44+02:00 (Zurich)
ISBN/EAN: 9783540683421

ISBN - alternative Schreibweisen:
978-3-540-68342-1
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: michel morvan

Daten vom Verlag:

Autor/in: Rüdiger Reischuk; Michel Morvan
Titel: Lecture Notes in Computer Science; STACS 97 - 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997 Proceedings
Verlag: Springer; Springer Berlin
621 Seiten
Erscheinungsjahr: 2005-11-19
Berlin; Heidelberg; DE
Sprache: Englisch
96,29 € (DE)
99,00 € (AT)
118,00 CHF (CH)
Available
XV, 621 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Automat; algorithm; algorithms; automata; complexity; computational geometry; computer science; data structure; data structures; distributed systems; formal language; formal languages; logic; semantics; verification; C; Theory of Computation; Programming Techniques; Compilers and Interpreters; Discrete Mathematics in Computer Science; Computer Science; Computerprogrammierung und Softwareentwicklung; Compiler und Übersetzer; Mathematik für Informatiker; Diskrete Mathematik; BC

Unifying models.- Predecessor queries in dynamic integer sets.- Semi-dynamic shortest paths and breadth-first search in digraphs.- Greibach normal form transformation, revisited.- Translating regular expressions into small ?-free nondeterministic finite automata.- Memory management for Union-Find algorithms.- Fast online multiplication of real numbers.- The operators min and max on the polynomial hierarchy.- Resource-bounded kolmogorov complexity revisited.- Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations.- Interactive proof systems with public coin: Lower space bounds and hierarchies of complexity classes.- MODp-tests, almost independence and small probability spaces.- Hybrid diagrams: A deductive-algorithmic approach to hybrid system verification.- Temporal logics for the specification of performance and reliability.- Efficient scaling-invariant checking of timed bisimulation.- Gossiping and broadcasting versus computing functions in networks.- On the descriptive and algorithmic power of parity ordered binary decision diagrams.- A reducibility concept for problems defined in terms of ordered binary decision diagrams.- On the classification of computable languages.- A conditional-logical approach to minimum cross-entropy.- Undecidability results on two-variable logics.- Methods and applications of (max,+) linear algebra.- Regular expressions and context-free grammars for picture languages.- Measuring nondeterminism in pushdown automata.- On polynomially D verbose sets.- A downward translation in the polynomial hierarchy.- Strict sequential P-completeness.- An unambiguous class possessing a complete set.- Deadlock-free interval routing schemes.- Power consumption in packet radio networks.- Thecomplexity of generating test instances.- Efficient constructions of Hitting Sets for systems of linear functions.- Protocols for collusion-secure asymmetric fingerprinting.- Minimal transition systems for history-preserving bisimulation.- On ergodic linear cellular automata over Zm.- Intrinsic universality of a 1-dimensional reversible Cellular Automaton.- The computational complexity of some problems of linear algebra.- Algebraic and logical characterizations of deterministic linear time classes.- Finding the k shortest paths in parallel.- Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs.- Distance approximating spanning trees.- A better upper bound on the bisection width of de Bruijn networks.- An information-theoretic treatment of random-self-reducibility.- Equivalence of measures of complexity classes.- Better algorithms for minimum weight vertex-connectivity problems.- RNC-approximation algorithms for the steiner problem.- Pattern matching in trace monoids.- Removing ?-transitions in timed automata.- Probabilistic proof systems — A survey.
< zum Archiv...