- 5 Résultats
prix le plus bas: € 65,00, prix le plus élevé: € 171,93, prix moyen: € 138,71
1
Commander
sur Indigo.ca
C$ 235,95
(environ € 171,93)
CommanderLien sponsorisé

Automata, Languages and Programming: 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings - nouveau livre

2007, ISBN: 9783540734192

This volume features the refereed proceedings from the 34th International Colloquium on Automata, Languages and Programming, held in Wroclaw, Poland in July 2007. Seventy-six full papers … Plus…

new in stock. Frais d'envoiplus shipping costs., Livraison non-comprise
2
Automata, Languages and Programming
Commander
sur Orellfuessli.ch
CHF 140,00
(environ € 135,66)
Envoi: € 17,441
CommanderLien sponsorisé
Automata, Languages and Programming - nouveau livre

2007, ISBN: 9783540734192

This volume features the refereed proceedings from the 34th International Colloquium on Automata, Languages and Programming, held in Wroclaw, Poland in July 2007. Seventy-six full papers … Plus…

Nr. A1000961914. Frais d'envoiLieferzeiten außerhalb der Schweiz 3 bis 21 Werktage, , Versandfertig innert 4 - 7 Werktagen, zzgl. Versandkosten. (EUR 17.44)
3
Automata Languages and Programming
Commander
sur Hugendubel.de
€ 160,49
Envoi: € 0,001
CommanderLien sponsorisé
Automata Languages and Programming - Livres de poche

2007

ISBN: 3540734198

Automata Languages and Programming ab 160.49 € als Taschenbuch: 34th International Colloquium ICALP 2007 Wroclaw Poland July 9-13 2007 Proceedings. Auflage 2007. Aus dem Bereich: Bücher, … Plus…

Nr. 6734423. Frais d'envoi, , DE. (EUR 0.00)
4
Commander
sur Antikbuch24.de
€ 65,00
Envoi: € 12,001
CommanderLien sponsorisé
Arge, Lars, Christian Cachin and Tomasz Jurdzinski:
Automata, Languages and Programming. 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 2007, Proceedings. [Lecture Notes in Computer Science, Vol. 4596]. - Livres de poche

2007, ISBN: 9783540734192

975 p. Softcover/Paperback, [PU: Springer, Berlin/Heidelberg]

Frais d'envoi EUR 12.00 Antiquariat Thomas Haker GmbH & Co. KG
5
Automata, Languages and Programming - Lars Arge; Christian Cachin; Tomasz Jurdzinski
Commander
sur lehmanns.de
€ 160,49
Envoi: € 0,001
CommanderLien sponsorisé
Lars Arge; Christian Cachin; Tomasz Jurdzinski:
Automata, Languages and Programming - Livres de poche

2007, ISBN: 9783540734192

34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings, Buch, Softcover, [PU: Springer Berlin], Springer Berlin, 2007

Frais d'envoiVersand in 10-14 Tagen. (EUR 0.00)

1Comme certaines plateformes ne transmettent pas les conditions d'expédition et que celles-ci peuvent dépendre du pays de livraison, du prix d'achat, du poids et de la taille de l'article, d'une éventuelle adhésion de la plateforme, d'une livraison directe par la plateforme ou via un prestataire tiers (Marketplace), etc. il est possible que les frais de livraison indiqués par eurolivre ne correspondent pas à ceux de la plateforme qui propose l'article.

Données bibliographiques du meilleur livre correspondant

Détails sur le livre
Automata, Languages and Programming: 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings

This book constitutes the refereed proceedings of the 34th International Colloquium on Automata, Languages and Programming, ICALP 2007, held in Wroclaw, Poland in July 2007. The 76 revised full papers presented together with 4 invited lectures were carefully reviewed and selected from 242 submissions. The papers are grouped in three major tracks on algorithms, automata, complexity and games, on logic, semantics, and theory of programming, and on security and cryptography foundations.

Informations détaillées sur le livre - Automata, Languages and Programming: 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings


EAN (ISBN-13): 9783540734192
ISBN (ISBN-10): 3540734198
Version reliée
Livre de poche
Date de parution: 2007
Editeur: Springer Berlin
953 Pages
Poids: 1,087 kg
Langue: eng/Englisch

Livre dans la base de données depuis 2007-10-22T16:54:42+02:00 (Zurich)
Page de détail modifiée en dernier sur 2023-07-30T22:58:18+02:00 (Zurich)
ISBN/EAN: 9783540734192

ISBN - Autres types d'écriture:
3-540-73419-8, 978-3-540-73419-2
Autres types d'écriture et termes associés:
Auteur du livre: automata, programming language, cach, lars, jurdzinski, andrzej
Titre du livre: poland, wroclaw, july, proceedings the international colloquium language, automata languages and programming, seven languages, lecture notes computer science automata


Données de l'éditeur

Auteur: Lars Arge; Christian Cachin; Tomasz Jurdzinski
Titre: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; Automata, Languages and Programming - 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings
Editeur: Springer; Springer Berlin
958 Pages
Date de parution: 2007-06-29
Berlin; Heidelberg; DE
Poids: 1,466 kg
Langue: Anglais
106,99 € (DE)
109,99 € (AT)
118,00 CHF (CH)
POD
XVII, 958 p.

BC; Software Engineering/Programming and Operating Systems; Hardcover, Softcover / Informatik, EDV/Informatik; Software Engineering; Verstehen; Informatik; Automat; algorithms; automata; complexity; logic; programming; security; data structures; Theory of Computation; Discrete Mathematics in Computer Science; Numeric Computing; Data Structures; Data Structures and Information Theory; Software Engineering; Theory of Computation; Discrete Mathematics in Computer Science; Numerical Analysis; Data Science; Data Structures and Information Theory; Theoretische Informatik; Mathematik für Informatiker; Diskrete Mathematik; Numerische Mathematik; Datenbanken; Algorithmen und Datenstrukturen; Informationstheorie; EA

Invited Lectures.- Ushering in a New Era of Algorithm Design.- A “proof-reading” of Some Issues in Cryptography.- Credentials-Based Authorization: Evaluation and Implementation.- Subexponential Parameterized Algorithms.- Session A1.- Competitive Algorithms for Due Date Scheduling.- Mechanism Design for Fractional Scheduling on Unrelated Machines.- Session A2.- Estimating Sum by Weighted Sampling.- Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima.- Session A3.- Low Distortion Spanners.- Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs.- Labeling Schemes for Vertex Connectivity.- Session A4.- Unbounded-Error One-Way Classical and Quantum Communication Complexity.- A Lower Bound on Entanglement-Assisted Quantum Communication Complexity.- Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity.- Session A5.- An Optimal Decomposition Algorithm for Tree Edit Distance.- On Commutativity Based Edge Lean Search.- Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems.- Session A6.- On the Complexity of Hard-Core Set Constructions.- Approximation by DNF: Examples and Counterexamples.- Exotic Quantifiers, Complexity Classes, and Complete Problems.- Session A7.- Online Conflict-Free Colorings for Hypergraphs.- Distributed Computing with Advice: Information Sensitivity of Graph Coloring.- Session C1.- Private Multiparty Sampling and Approximation of Vector Combinations.- Constant-Round Private Database Queries.- Session A8.- Universal Algebra and Hardness Results for Constraint Satisfaction Problems.- On the Power of k-Consistency.- Complexity of Propositional Proofs Under a Promise.- Session C2.- Deterministic History-Independent Strategies for Storing Information on Write-Once Memories.- Trading Static for Adaptive Security in Universally Composable Zero-Knowledge.- A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC).- Session A9.- Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs.- Parameterized Algorithms for Directed Maximum Leaf Problems.- Parameterized Approximability of the Disjoint Cycle Problem.- Linear Problem Kernels for NP-Hard Problems on Planar Graphs.- Session C3.- Private Locally Decodable Codes.- Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms.- Unrestricted Aggregate Signatures.- Ring Signatures of Sub-linear Size Without Random Oracles.- Session A10.- Balanced Families of Perfect Hash Functions and Their Applications.- An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks.- Session B1.- Modular Algorithms for Heterogeneous Modal Logics.- Co-Logic Programming: Extending Logic Programming with Coinduction.- Session C4.- Offline/Online Mixing.- Fully Collusion Resistant Black-Box Traitor Revocable Broadcast Encryption with Short Private Keys.- Session A11.- Succinct Ordinal Trees Based on Tree Covering.- A Framework for Dynamizing Succinct Data Structures.- In-Place Suffix Sorting.- Session B2.- Maximal Infinite-Valued Constraint Languages.- Affine Systems of Equations and Counting Infinitary Logic.- Boundedness of Monadic FO over Acyclic Structures.- Session A12.- Strong Price of Anarchy for Machine Load Balancing.- Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games.- Session B3.- Equational Systems and Free Constructions (Extended Abstract).- Categorical Views on Computations on Trees (Extended Abstract).- Session A13.- Holographic Algorithms: The Power of Dimensionality Resolved.- Reconciling Data Compression and Kolmogorov Complexity.- Size Competitive Meshing Without Large Angles.- Session B4.- A Fully Abstract Trace Semantics for General References.- Aliased Register Allocation for Straight-Line Programs Is NP-Complete.- Conservative Ambiguity Detection in Context-Free Grammars.- Session A14.- Lower Bounds for Quantile Estimation in Random-Order and Multi-pass Streaming.- Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining Sparse Spanners.- Checking and Spot-Checking the Correctness of Priority Queues.- Session B5.- Undecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the ?-Calculus.- Ready Simulation for Concurrency: It’s Logical!.- Continuous Capacities on Continuous State Spaces.- Session A15.- On the Chromatic Number of Random Graphs.- Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions.- Complexity of the Cover Polynomial.- Session B6.- A Generalization of Cobham’s Theorem to Automata over Real Numbers.- Minimum-Time Reachability in Timed Games.- Reachability-Time Games on Timed Automata.- Perfect Information Stochastic Priority Games.- Session B7.- Bounded Depth Data Trees.- Unranked Tree Automata with Sibling Equalities and Disequalities.- Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization.- A Combinatorial Theorem for Trees.- Session B8.- Model Theory Makes Formulas Large.- Decision Problems for Lower/Upper Bound Parametric Timed Automata.- On the Complexity of Ltl Model-Checking of Recursive State Machines.- Paper Retraction.- Paper Retraction: On the Hardness of Embeddings Between Two Finite Metrics.

< pour archiver...