- 5 Results
Lowest price: € 30.77, highest price: € 116.89, average price: € 86.77
1
STACS 97 : 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997 Proceedings - Michel Morvan
Order
at ZVAB.com
€ 116.89
Shipment: € 0.001
OrderSponsored link
Michel Morvan:

STACS 97 : 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997 Proceedings - Paperback

1997, ISBN: 3540626166

[EAN: 9783540626169], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], ALGORITHMUS; AUTOMAT; ALGORITHM; ALGORITHMS; AUTOMATA; COMPLEXITY; COMPUTATIONALGEOMETRY; COMPUTERSCIENCE; DATA… More...

NEW BOOK. Shipping costs:Versandkostenfrei. (EUR 0.00) AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)]
2
STACS 97: 14th Annual Symposium on Theoretical Aspects of Computer Science, L??beck, Germany, February 27 - March 1, 1997 Proceedings: 14th Annual . (Lecture Notes in Computer Science) - Morvan, Michel and R??diger Reischuk
Order
at ZVAB.com
€ 30.77
Shipment: € 3.501
OrderSponsored link

Morvan, Michel and R??diger Reischuk:

STACS 97: 14th Annual Symposium on Theoretical Aspects of Computer Science, L??beck, Germany, February 27 - March 1, 1997 Proceedings: 14th Annual . (Lecture Notes in Computer Science) - Paperback

2008, ISBN: 3540626166

[EAN: 9783540626169], Gebraucht, sehr guter Zustand, [SC: 3.5], [PU: Springer], IT-AUSBILDUNG & -BERUFE / COMPUTER INTERNET NATURWISSENSCHAFTEN TECHNIK PROGRAMMIEREN, 636 Seiten Gepflegte… More...

NOT NEW BOOK. Shipping costs: EUR 3.50 getbooks GmbH, Bad Camberg, HE, Germany [55883480] [Rating: 5 (von 5)]
3
STACS 97
Order
at Springer.com
€ 106.99
Shipment: € 0.001
OrderSponsored link
STACS 97 - new book

ISBN: 9783540626169

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… More...

Nr. 978-3-540-62616-9. Shipping costs:Worldwide free shipping, , DE. (EUR 0.00)
4
STACS 97: 14th Annual Symposium on Theoretical Aspects of Computer Science, L??beck, Germany, February 27 - March 1, 1997 Proceedings: 14th Annual ... (Lecture Notes in Computer Science) - Morvan, Michel and R??diger Reischuk
Order
at booklooker.de
€ 72.20
Shipment: € 3.001
OrderSponsored link
Morvan, Michel and R??diger Reischuk:
STACS 97: 14th Annual Symposium on Theoretical Aspects of Computer Science, L??beck, Germany, February 27 - March 1, 1997 Proceedings: 14th Annual ... (Lecture Notes in Computer Science) - Paperback

2008, ISBN: 9783540626169

[PU: Springer], 636 Seiten Taschenbuch Gepflegtes ehemaliges Bibliotheksexemplar mit den üblichen Kennzeichnungen (z.B. Barcode und Inventarisierungsnummer); in der Regel foliiert (Umschl… More...

Shipping costs:Versand nach Deutschland. (EUR 3.00) getbooks GmbH
5
STACS 97 - Rüdiger Reischuck/ Michel Morvan
Order
at Hugendubel.de
€ 106.99
Shipment: € 0.001
OrderSponsored link
Rüdiger Reischuck/ Michel Morvan:
STACS 97 - Paperback

ISBN: 9783540626169

*STACS 97* - 14th Annual Symposium on Theoretical Aspects of Computer Science Lübeck Germany February 27 - March 1 1997 Proceedings. Auflage 1997 / Taschenbuch für 106.99 € / Aus dem Bere… More...

Shipping costs:Shipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., DE. (EUR 0.00)

1As some platforms do not transmit shipping conditions to us and these may depend on the country of delivery, the purchase price, the weight and size of the item, a possible membership of the platform, a direct delivery by the platform or via a third-party provider (Marketplace), etc., it is possible that the shipping costs indicated by euro-book.co.uk / euro-book.co.uk do not correspond to those of the offering platform.

Bibliographic data of the best matching book

Details of the book
STACS 97

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 revised full papers included were carefully selected from a total of 139 submissions; also included are three invited full papers. The papers presented span the whole scope of theoretical computer science. Among the topics covered are, in particular, algorithms and data structures, computational complexity, automata and formal languages, structural complexity, parallel and distributed systems, parallel algorithms, semantics, specification and verification, logic, computational geometry, cryptography, learning and inductive inference.

Details of the book - STACS 97


EAN (ISBN-13): 9783540626169
ISBN (ISBN-10): 3540626166
Paperback
Publishing year: 1997
Publisher: Springer Berlin Heidelberg
636 Pages
Weight: 0,947 kg
Language: eng/Englisch

Book in our database since 2007-02-18T18:12:12+00:00 (London)
Detail page last modified on 2024-02-19T08:57:49+00:00 (London)
ISBN/EAN: 3540626166

ISBN - alternate spelling:
3-540-62616-6, 978-3-540-62616-9
Alternate spelling and related search-keywords:
Book author: ger, diger, morvan, reischuk rüdiger, michel rudi, reisch
Book title: lübeck, berlin, annual symposium theoretical aspects computer science, lecture notes computer science, beck, germany, ufo symposium, von der march


Information from Publisher

Author: Rüdiger Reischuk; Michel Morvan
Title: 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
Publisher: Springer; Springer Berlin
621 Pages
Publishing year: 1997-02-21
Berlin; Heidelberg; DE
Printed / Made in
Weight: 1,940 kg
Language: English
106,99 € (DE)
109,99 € (AT)
118,00 CHF (CH)
POD
XV, 621 p.

BC; Theory of Computation; Hardcover, Softcover / 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; Programming Techniques; Programming Languages, Compilers, Interpreters; Discrete Mathematics in Computer Science; Theory of Computation; Programming Techniques; Compilers and Interpreters; Discrete Mathematics in Computer Science; Computerprogrammierung und Softwareentwicklung; Compiler und Übersetzer; Mathematik für Informatiker; Diskrete Mathematik; EA

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.- The complexity 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.

< to archive...