STACS 97 : 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997 Proceedings - Pasta blanda
1997, ISBN: 3540626166
[EAN: 9783540626169], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], ALGORITHMUS; AUTOMAT; ALGORITHM; ALGORITHMS; AUTOMATA; COMPLEXITY; COMPUTATIONALGEOMETRY; COMPUTERSCIENCE; DATA… Más…
ZVAB.com AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)] NEW BOOK. Gastos de envío:Versandkostenfrei. (EUR 0.00) Details... |
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) - Pasta blanda
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… Más…
ZVAB.com getbooks GmbH, Bad Camberg, HE, Germany [55883480] [Rating: 5 (von 5)] NOT NEW BOOK. Gastos de envío: EUR 3.50 Details... |
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… Más…
Springer.com Nr. 978-3-540-62616-9. Gastos de envío:Worldwide free shipping, , DE. (EUR 0.00) Details... |
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) - Pasta blanda
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… Más…
booklooker.de |
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… Más…
Hugendubel.de Gastos de envío:Shipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., DE. (EUR 0.00) Details... |
STACS 97 : 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997 Proceedings - Pasta blanda
1997, ISBN: 3540626166
[EAN: 9783540626169], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], ALGORITHMUS; AUTOMAT; ALGORITHM; ALGORITHMS; AUTOMATA; COMPLEXITY; COMPUTATIONALGEOMETRY; COMPUTERSCIENCE; DATA… Más…
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) - Pasta blanda2008, ISBN: 3540626166
[EAN: 9783540626169], Gebraucht, sehr guter Zustand, [SC: 3.5], [PU: Springer], IT-AUSBILDUNG & -BERUFE / COMPUTER INTERNET NATURWISSENSCHAFTEN TECHNIK PROGRAMMIEREN, 636 Seiten Gepflegte… Más…
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… Más…
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) - Pasta blanda
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… Más…
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… Más…
Datos bibliográficos del mejor libro coincidente
Autor: | |
Título: | |
ISBN: |
Detalles del libro - STACS 97
EAN (ISBN-13): 9783540626169
ISBN (ISBN-10): 3540626166
Tapa blanda
Año de publicación: 1997
Editorial: Springer Berlin Heidelberg
636 Páginas
Peso: 0,947 kg
Idioma: eng/Englisch
Libro en la base de datos desde 2007-02-18T12:12:12-06:00 (Mexico City)
Página de detalles modificada por última vez el 2024-02-19T02:57:49-06:00 (Mexico City)
ISBN/EAN: 3540626166
ISBN - escritura alterna:
3-540-62616-6, 978-3-540-62616-9
Mode alterno de escritura y términos de búsqueda relacionados:
Autor del libro: ger, diger, morvan, reischuk rüdiger, michel rudi, reisch
Título del libro: lübeck, berlin, annual symposium theoretical aspects computer science, lecture notes computer science, beck, germany, ufo symposium, von der march
Datos del la editorial
Autor: Rüdiger Reischuk; Michel Morvan
Título: 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
Editorial: Springer; Springer Berlin
621 Páginas
Año de publicación: 1997-02-21
Berlin; Heidelberg; DE
Impreso en
Peso: 1,940 kg
Idioma: Inglés
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.Más, otros libros, que pueden ser muy parecidos a este:
Último libro similar:
9783540683421 STACS 97 (Rüdiger Reischuk; Michel Morvan)
- 9783540683421 STACS 97 (Rüdiger Reischuk; Michel Morvan)
- 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)
< para archivar...