- 5 Ergebnisse
Kleinster Preis: € 85,59, größter Preis: € 101,14, Mittelwert: € 98,03
1
STACS 95 - Ernst W. Mayr; Claude Puech
Bestellen
bei Springer.com
€ 101,14
Bestellen
Details und Versand
gesponserter Link
Ernst W. Mayr; Claude Puech:

STACS 95 - neues Buch

ISBN: 9783540491750

This book presents the proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science (STACS 95), held in Munich, Germany in March 1995. Besides three invited talks, … Mehr…

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

ISBN: 9783540491750

This book presents the proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science (STACS 95), held in Munich, Germany in March 1995. Besides three invited talks, … Mehr…

Nr. 978-3-540-49175-0. Versandkosten:Worldwide free shipping, , DE. (EUR 0.00)
zuklappen (X)
3
STACS 95 - Ernst W. Mayr; Claude Puech
Bestellen
bei Springer.com
€ 101,14
Bestellen
Details und Versand
gesponserter Link
Ernst W. Mayr; Claude Puech:
STACS 95 - neues Buch

ISBN: 9783540491750

Computer Science; Theory of Computation; Computation by Abstract Devices; Algorithm Analysis and Problem Complexity; Logics and Meanings of Programs; Mathematical Logic and Formal Languag… Mehr…

  - Versandkosten:zzgl. Versandkosten
zuklappen (X)
4
STACS 95 - Ernst W. Mayr; Claude Puech
Bestellen
bei Springer.com
€ 101,14
Bestellen
Details und Versand
gesponserter Link
Ernst W. Mayr; Claude Puech:
STACS 95 - neues Buch

ISBN: 9783540491750

Computer Science; Theory of Computation; Computation by Abstract Devices; Algorithm Analysis and Problem Complexity; Logics and Meanings of Programs; Mathematical Logic and Formal Languag… Mehr…

  - Versandkosten:zzgl. Versandkosten.
zuklappen (X)
5
STACS 95 - Ernst W. Mayr; Claude Puech
Bestellen
bei Springer.com
€ 101,14
Bestellen
Details und Versand
gesponserter Link
Ernst W. Mayr; Claude Puech:
STACS 95 - neues Buch

ISBN: 9783540491750

Computer Science; Theory of Computation; Computation by Abstract Devices; Algorithm Analysis and Problem Complexity; Logics and Meanings of Programs; Mathematical Logic and Formal Languag… 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 95
Autor:
Titel:
ISBN-Nummer:

9783540491750

Detailangaben zum Buch - STACS 95


EAN (ISBN-13): 9783540491750
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: 9783540491750

ISBN - alternative Schreibweisen:
978-3-540-49175-0
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: mayr ernst, claude

Daten vom Verlag:

Autor/in: Ernst W. Mayr; Claude Puech
Titel: Lecture Notes in Computer Science; STACS 95 - 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995. Proceedings
Verlag: Springer; Springer Berlin
651 Seiten
Erscheinungsjahr: 2005-07-05
Berlin; Heidelberg; DE
Sprache: Englisch
96,29 € (DE)
99,00 € (AT)
118,00 CHF (CH)
Available
XXV, 651 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Algorithms; Automat; algorithm; automata; automata theory; complexity; complexity theory; computational geometry; computer; computer science; database; logic; algorithm analysis and problem complexity; C; Theory of Computation; Algorithms; Computer Science Logic and Foundations of Programming; Formal Languages and Automata Theory; Programming Techniques; Computer Science; Algorithmen und Datenstrukturen; Computerprogrammierung und Softwareentwicklung; BC

On the synthesis of strategies in infinite games.- Finding the maximum with linear error probabilities: a sequential analysis approach.- Completeness and weak completeness under polynomial-size circuits.- Communication complexity of key agreement on small ranges.- Pseudorandom generators and the frequency of simplicity.- Classes of bounded counting type and their inclusion relations.- Lower bounds for depth-three circuits with equals and mod-gates.- On realizing iterated multiplication by small depth threshold circuits.- A random NP-complete problem for inversion of 2D cellular automata.- On the subword equivalence problem for infinite words.- On the separators on an infinite word generated by a morphism.- Systolic tree ?-languages.- Structural complexity of ?-automata.- Algorithms explained by symmetries.- Generalized scans and tri-diagonal systems.- Two-dimensional pattern matching in linear time and small space.- On-line and dynamic algorithms for shortest path problems.- On compact representations of propositional circumscription.- A set-theoretic translation method for (poly)modal logics.- On the synthesis of discrete controllers for timed systems.- A fully abstract semantics for causality in the ?-calculus.- On the sizes of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks.- Exploiting storage redundancy to speed up randomized shared memory simulations.- Interval routing schemes.- A packet routing protocol for arbitrary networks.- A family of tag systems for paperfolding sequences.- Growing context-sensitive languages and Church-Rosser languages.- Deterministic generalized automata.- Optimal simulation of automata by neural nets.- Concurrent process equivalences: Some decision problems.- Optimallower bounds on the multiparty communication complexity.- Simultaneous messages vs. communication.- Coding and strong coding in trace monoids.- On codings of traces.- Finding largest common embeddable subtrees.- The ?t-coloring problem.- Expander properties in random regular graphs with edge faults.- Dynamic analysis of the sizes of relations.- On slender context-free languages.- Partial derivatives of regular expressions and finite automata constructions.- Dependence orders for computations of concurrent automata.- On the undecidability of deadlock detection in families of nets.- On the average running time of odd-even merge sort.- Optimal average case sorting on arrays.- Normal numbers and sources for BPP.- Lower bounds on learning decision lists and trees.- Line segmentation of digital curves in parallel.- Computability of convex sets.- Enumerating extreme points in higher dimensions.- The number of views of piecewise-smooth algebraic objects.- On the structure of log-space probabilistic complexity classes.- Resource-bounded instance complexity.- On the sparse set conjecture for sets with low density.- Beyond PNP=NEXP.- Malign distributions for average case circuit complexity.- A possible code in the genetic code.
< zum Archiv...