- 5 Ergebnisse
Kleinster Preis: € 80,98, größter Preis: € 123,35, Mittelwert: € 96,50
1
Automata, Languages, and Programming
Bestellen
bei Orellfuessli.ch
CHF 125,90
(ca. € 123,35)
Versand: € 17,631
Bestellen
Details beim Anbieter
gesponserter Link

Automata, Languages, and Programming - neues Buch

2015, ISBN: 9783662476666

The two-volume set LNCS 9134 and LNCS 9135 constitutes the refereed proceedings of the 42nd International Colloquium on Automata, Languages and Programming, ICALP 2015, held in Kyoto, Jap… Mehr…

Nr. A1038244171. Versandkosten:Lieferzeiten außerhalb der Schweiz 3 bis 21 Werktage, , Sofort per Download lieferbar, zzgl. Versandkosten. (EUR 17.63)
zuklappen (X)
2
Automata, Languages, and Programming - Magnús M. Halldórsson; Kazuo Iwama; Naoki Kobayashi; Bettina Speckmann
Bestellen
bei Springer.com
€ 85,59
Bestellen
Details und Versand
gesponserter Link

Magnús M. Halldórsson; Kazuo Iwama; Naoki Kobayashi; Bettina Speckmann:

Automata, Languages, and Programming - neues Buch

2015, ISBN: 9783662476666

The two-volume set LNCS 9134 and LNCS 9135 constitutes the refereed proceedings of the 42nd International Colloquium on Automata, Languages and Programming, ICALP 2015, held in Kyoto, Jap… Mehr…

new in stock. Versandkosten:zzgl. Versandkosten.
zuklappen (X)
3
Automata, Languages, and Programming - Springer
Bestellen
bei Thalia.de
€ 96,29
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link
Springer:
Automata, Languages, and Programming - neues Buch

2015

ISBN: 9783662476666

The two-volume set LNCS 9134 and LNCS 9135 constitutes the refereed proceedings of the 42nd International Colloquium on Automata, Languages and Programming, ICALP 2015, held in Kyoto, Jap… Mehr…

Nr. 44254621. Versandkosten:, Sofort per Download lieferbar, DE. (EUR 0.00)
zuklappen (X)
4
Automata, Languages, and Programming - Springer
Bestellen
bei Thalia.de
€ 96,29
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link
Springer:
Automata, Languages, and Programming - neues Buch

2015, ISBN: 9783662476666

The two-volume set LNCS 9134 and LNCS 9135 constitutes the refereed proceedings of the 42nd International Colloquium on Automata, Languages and Programming, ICALP 2015, held in Kyoto, Jap… Mehr…

Nr. 44254621. Versandkosten:, Sofort per Download lieferbar, DE. (EUR 0.00)
zuklappen (X)
5
Automata, Languages, and Programming : 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II - E. Maranha das Neves
Bestellen
bei hive.co.uk
£ 67,58
(ca. € 80,98)
Bestellen
Details und Versand
gesponserter Link
E. Maranha das Neves:
Automata, Languages, and Programming : 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II - neues Buch

2015, ISBN: 9783662476666

; PDF; Scientific, Technical and Medical > Mathematics > Discrete mathematics, Springer Netherlands

No. 9783662476666. Versandkosten:Instock, Despatched same working day before 3pm, plus shipping costs., 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
Automata, Languages, and Programming
Autor:
Titel:
ISBN-Nummer:

9783662476666

Detailangaben zum Buch - Automata, Languages, and Programming


EAN (ISBN-13): 9783662476666
Erscheinungsjahr: 2015
Herausgeber: Springer Berlin Heidelberg

Buch in der Datenbank seit 2015-12-17T10:23:53+01:00 (Vienna)
Detailseite zuletzt geändert am 2024-03-31T10:29:54+02:00 (Vienna)
ISBN/EAN: 9783662476666

ISBN - alternative Schreibweisen:
978-3-662-47666-6
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: halldorsson, halldórsson, speckmann, kazuo, kobayashi
Titel des Buches: kyoto japan, automata, colloquium international

Daten vom Verlag:

Autor/in: Magnús M. Halldórsson; Kazuo Iwama; Naoki Kobayashi; Bettina Speckmann
Titel: Theoretical Computer Science and General Issues; Lecture Notes in Computer Science; Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II
Verlag: Springer; Springer Berlin
717 Seiten
Erscheinungsjahr: 2015-06-19
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
XXXIX, 717 p. 65 illus.

EA; E107; eBook; Nonbooks, PBS / Mathematik/Wahrscheinlichkeitstheorie, Stochastik, Mathematische Statistik; Algorithmen und Datenstrukturen; Verstehen; algorithms; automata; categorical semantics; computational complexity; constraint satisfaction; convex optimization; directed algebraic topology; dynamic graph algorithms; foundations of networked computation; game theory; logics; parameterised complexity; probabilistic systems; signature schemes; social networks; streaming; theoretical computer science; theory of programming; transducer; universal algebra; C; Algorithms; Theory of Computation; Computer Communication Networks; Information Storage and Retrieval; Computer and Information Systems Applications; Discrete Mathematics in Computer Science; Computer Science; Theoretische Informatik; Netzwerk-Hardware; Informationsrückgewinnung, Information Retrieval; Data Warehousing; Angewandte Informatik; Mathematik für Informatiker; Diskrete Mathematik; BC

Towards the Graph Minor Theorems for Directed Graphs.- Automated Synthesis of Distributed Controllers.- Games for Dependent Types.- Short Proofs of the Kneser-Lovász Coloring Principle.- Provenance Circuits for Trees and Treelike Instances.- Language Emptiness of Continuous-Time Parametric Timed Automata.- Analysis of Probabilistic Systems via Generating Functions and Padé Approximation.- On Reducing Linearizability to State Reachability.- The Complexity of Synthesis from Probabilistic Components.- Edit Distance for Pushdown Automata.- Solution Sets for Equations over Free Groups Are EDT0L Languages.- Limited Set Quantifiers over Countable Linear Orderings.- Reachability Is in DynFO.- Natural Homology.- Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes.- Trading Bounds for Memory in Games with Counters.- Decision Problems of Tree Transducers with Origin.- Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words.- The Odds of Staying on Budget.- From Sequential Specifications to Eventual Consistency.- Fixed-Dimensional Energy Games Are in Pseudo-Polynomial Time.- An Algebraic Geometric Approach to Nivat’s Conjecture.- Nominal Kleene Coalgebra.- On Determinisation of Good-for-Games Automata.- Owicki-Gries Reasoning for Weak Memory Models.- On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension.- Compressed Tree Canonization.- Parsimonious Types and Non-uniform Computation.- Baire Category Quantifier in Monadic Second Order Logic.- Liveness of Parameterized Timed Networks.- Symmetric Strategy Improvement.- Effect Algebras, Presheaves, Non-locality and Contextuality.- On the Complexity of Intersecting Regular, Context-Free, and Tree Languages.- Containment of Monadic Datalog Programs via Bounded Clique-Width.- An Approach to Computing Downward Closures.- How Much Lookahead Is Needed to Win Infinite Games?.- Symmetric Graph Properties HaveIndependent Edges.- Polylogarithmic-Time Leader Election in Population Protocols.- Core Size and Densification in Preferential Attachment Networks.- Maintaining Near-Popular Matchings.- Ultra-Fast Load Balancing on Scale-Free Networks.- Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms.- The Range of Topological Effects on Communication.- Secretary Markets with Local Information.- A Simple and Optimal Ancestry Labeling Scheme for Trees.- Interactive Communication with Unknown Noise Rate.- Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs.- A Unified Framework for Strong Price of Anarchy in Clustering Games.- On the Diameter of Hyperbolic Random Graphs.- Tight Bounds for Cost-Sharing in Weighted Congestion Games.- Distributed Broadcast Revisited: Towards Universal Optimality.- Selling Two Goods Optimally.- Adaptively Secure Coin-Flipping, Revisited.- Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem.- Normalization Phenomena in Asynchronous Networks.- Broadcast from Minicast Secure Against General Adversaries.

Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:

Neuestes ähnliches Buch:
9780387088600 Automata, Languages and Programming: Fifth Colloquium, Udine, Italy, July 17-21, 1978 (G. Ausiello)

< zum Archiv...