- 5 Ergebnisse
Kleinster Preis: € 91,95, größter Preis: € 135,70, Mittelwert: € 110,57
1
Automata, Languages and Programming
Bestellen
bei Springer.com
€ 106,99
Versand: € 0,001
Bestellengesponserter Link

Automata, Languages and Programming - neues Buch

2005, ISBN: 9783540275800

The 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005) was held in Lisbon, Portugal from July 11 to July 15, 2005. These proceedings contain all contributed… Mehr…

Nr. 978-3-540-27580-0. Versandkosten:Worldwide free shipping, , DE. (EUR 0.00)
2
Automata, Languages and Programming 32nd International Colloquim, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings - Caires, Luis (Herausgeber); Italiano, Guiseppe F. (Herausgeber); Yung, Moti (Herausgeber); Palamidessi, Catuscia (Herausgeber); Monteiro, Luis (Herausgeber)
Bestellen
bei Achtung-Buecher.de
€ 111,22
Versand: € 0,001
Bestellengesponserter Link

Caires, Luis (Herausgeber); Italiano, Guiseppe F. (Herausgeber); Yung, Moti (Herausgeber); Palamidessi, Catuscia (Herausgeber); Monteiro, Luis (Herausgeber):

Automata, Languages and Programming 32nd International Colloquim, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings - neues Buch

2005, ISBN: 3540275800

2005 Kartoniert / Broschiert Algorithmus, Diskret (mathematisch), Kryptologie, Informationstheorie, Mathematische Grundlagen, Algorithmen und Datenstrukturen, Software Engineering, Date… Mehr…

Versandkosten:Versandkostenfrei innerhalb der BRD. (EUR 0.00) MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien
3
Automata, Languages and Programming 32nd International Colloquim, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings - Caires, Luis (Herausgeber); Italiano, Guiseppe F. (Herausgeber); Yung, Moti (Herausgeber); Palamidessi, Catuscia (Herausgeber); Monteiro, Luis (Herausgeber)
Bestellen
bei Achtung-Buecher.de
€ 135,70
Versand: € 0,001
Bestellengesponserter Link
Caires, Luis (Herausgeber); Italiano, Guiseppe F. (Herausgeber); Yung, Moti (Herausgeber); Palamidessi, Catuscia (Herausgeber); Monteiro, Luis (Herausgeber):
Automata, Languages and Programming 32nd International Colloquim, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings - neues Buch

2005

ISBN: 3540275800

2005 Kartoniert / Broschiert Algorithmus, Diskret (mathematisch), Kryptologie, Informationstheorie, Mathematische Grundlagen, Algorithmen und Datenstrukturen, Software Engineering, Date… Mehr…

Versandkosten:Versandkostenfrei innerhalb der BRD. (EUR 0.00) MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien
4
Automata, Languages and Programming - Caires, Luis Italiano, Guiseppe F. Monteiro, Luis Palamidessi, Catuscia Yung, Moti
Bestellen
bei booklooker.de
€ 91,95
Versand: € 0,001
Bestellengesponserter Link
Caires, Luis Italiano, Guiseppe F. Monteiro, Luis Palamidessi, Catuscia Yung, Moti:
Automata, Languages and Programming - Erstausgabe

2005, ISBN: 9783540275800

Taschenbuch

[ED: Kartoniert / Broschiert], [PU: Springer Berlin Heidelberg], Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. The 32nd International Co… Mehr…

Versandkosten:Versandkostenfrei, Versand nach Deutschland. (EUR 0.00) Moluna GmbH
5
Automata Languages and Programming
Bestellen
bei Hugendubel.de
€ 106,99
Versand: € 0,001
Bestellengesponserter Link
Automata Languages and Programming - Taschenbuch

2005, ISBN: 9783540275800

*Automata Languages and Programming* - 32nd International Colloquim ICALP 2005 Lisbon Portugal July 11-15 2005 Proceedings. Auflage 2005 / Taschenbuch für 106.99 € / Aus dem Bereich: Büch… Mehr…

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

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

This book constitutes the refereed proceedings of the 32nd International Colloquium on Automata, Languages and Programming, ICALP 2005, held in Lisbon, Portugal in July 2005. The 113 revised full papers presented together with abstracts of 5 invited talks were carefully reviewed and selected from 407 submissions. The papers address all current issues in theoretical computer science and are organized in topical sections on data structures, cryptography and complexity, cryptography and distributed systems, graph algorithms, security mechanisms, automata and formal languages, signature and message authentication, algorithmic game theory, automata and logic, computational algebra, cache-oblivious algorithms and algorithmic engineering, on-line algorithms, security protocols logic, random graphs, concurrency, encryption and related primitives, approximation algorithms, games, lower bounds, probability, algebraic computation and communication complexity, string matching and computational biology, quantum complexity, analysis and verification, geometry and load balancing, concrete complexity and codes, and model theory and model checking.

Detailangaben zum Buch - Automata Languages and Programming


EAN (ISBN-13): 9783540275800
ISBN (ISBN-10): 3540275800
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2005
Herausgeber: Springer Berlin Heidelberg
1502 Seiten
Gewicht: 1,669 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2007-05-22T01:01:18+02:00 (Vienna)
Detailseite zuletzt geändert am 2024-02-23T20:56:39+01:00 (Vienna)
ISBN/EAN: 9783540275800

ISBN - alternative Schreibweisen:
3-540-27580-0, 978-3-540-27580-0
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: caire, guise, monte young, caires luis editor italiano guiseppe editor monteiro luis editor palamidessi catuscia editor yung moti, lui, weizmann, john mitchell
Titel des Buches: automata languages and programming, july, lisbon, portugal, lecture notes computer science automata, auto, jul


Daten vom Verlag:

Autor/in: Luis Caires; Guiseppe F. Italiano; Luis Monteiro; Catuscia Palamidessi; Moti Yung
Titel: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; Automata, Languages and Programming - 32nd International Colloquim, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings
Verlag: Springer; Springer Berlin
1482 Seiten
Erscheinungsjahr: 2005-06-24
Berlin; Heidelberg; DE
Gewicht: 2,315 kg
Sprache: Englisch
106,99 € (DE)
109,99 € (AT)
118,00 CHF (CH)
POD
L, 1482 p. In 2 volumes, not available separately.

SA; BC; Computer Science, general; Hardcover, Softcover / Informatik, EDV/Allgemeines, Lexika; Informatik; Verstehen; Informatik; Automat; algorithms; automata; complexity; computer science; data structures; distributed systems; formal language; formal languages; game theory; logic; model checking; programming; verification; Mathematical Logic and Foundations; Theory of Computation; Software Engineering/Programming and Operating Systems; Data Structures and Information Theory; Data Structures; Computer Science; Mathematical Logic and Foundations; Theory of Computation; Software Engineering; Data Structures and Information Theory; Data Science; Mathematik: Logik; Mathematische Grundlagen; Theoretische Informatik; Software Engineering; Algorithmen und Datenstrukturen; Informationstheorie; Datenbanken; EA

Invited Lectures.- Holographic Circuits.- Probabilistic Polynomial-Time Semantics for a Protocol Security Logic.- A Gentle Introduction to Semantic Subtyping.- Logics for Unranked Trees: An Overview.- Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture.- Data Structures I.- The Tree Inclusion Problem: In Optimal Space and Faster.- Union-Find with Constant Time Deletions.- Optimal In-place Sorting of Vectors and Records.- Towards Optimal Multiple Selection.- Cryptography and Complexity.- Simple Extractors via Constructions of Cryptographic Pseudo-random Generators.- Bounds on the Efficiency of “Black-Box” Commitment Schemes.- On Round-Efficient Argument Systems.- Computational Bounds on Hierarchical Data Processing with Applications to Information Security.- Data Structures II.- Balanced Allocation and Dictionaries with Tightly Packed Constant Size Bins.- Worst Case Optimal Union-Intersection Expression Evaluation.- Measure and Conquer: Domination – A Case Study.- Cryptography and Distributed Systems.- Optimistic Asynchronous Atomic Broadcast.- Asynchronous Perfectly Secure Communication over One-Time Pads.- Single-Prover Concurrent Zero Knowledge in Almost Constant Rounds.- Graph Algorithms I.- LCA Queries in Directed Acyclic Graphs.- Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs.- Deterministic Constructions of Approximate Distance Oracles and Spanners.- An Õ(m 2 n) Randomized Algorithm to Compute a Minimum Cycle Basis of a Directed Graph.- Security Mechanisms.- Basing Cryptographic Protocols on Tamper-Evident Seals.- Hybrid Trapdoor Commitments and Their Applications.- On Steganographic Chosen Covertext Security.- Classification of Boolean Functions of 6 Variables or Less with Respect to Some Cryptographic Properties.- Graph Algorithms II.- Label-Guided Graph Exploration by a Finite Automaton.- On the Wake-Up Problem in Radio Networks.- Distance Constrained Labelings of Graphs of Bounded Treewidth.- Optimal Branch-Decomposition of Planar Graphs in O(n 3) Time.- Automata and Formal Languages I.- NFAs With and Without ?-Transitions.- On the Equivalence of -Automata.- A Tight Linear Bound on the Neighborhood of Inverse Cellular Automata.- Groupoids That Recognize Only Regular Languages.- Signature and Message Authentication.- Append-Only Signatures.- Hierarchical Group Signatures.- Designated Verifier Signature Schemes: Attacks, New Security Notions and a New Construction.- Single-Key AIL-MACs from Any FIL-MAC.- Algorithmic Game Theory.- The Efficiency and Fairness of a Fixed Budget Resource Allocation Game.- Braess’s Paradox, Fibonacci Numbers, and Exponential Inapproximability.- Automata and Logic.- Weighted Automata and Weighted Logics.- Restricted Two-Variable FO + MOD Sentences, Circuits and Communication Complexity.- Computational Algebra.- Suitable Curves for Genus-4 HCC over Prime Fields: Point Counting Formulae for Hyperelliptic Curves of Type y 2=x +ax.- Solvability of a System of Bivariate Polynomial Equations over a Finite Field.- Cache-Oblivious Algorithms and Algorithmic Engineering.- Cache-Oblivious Planar Shortest Paths.- Cache-Aware and Cache-Oblivious Adaptive Sorting.- Simulated Annealing Beats Metropolis in Combinatorial Optimization.- On-line Algorithms.- Online Interval Coloring and Variants.- Dynamic Bin Packing of Unit Fractions Items.- Reordering Buffer Management for Non-uniform Cost Models.- Security Protocols Logic.- Combining Intruder Theories.- Computationally Sound Implementations of Equational Theories Against Passive Adversaries.- Password-Based Encryption Analyzed.- Random Graphs.- On the Cover Time of Random Geometric Graphs.- On the Existence of Hamiltonian Cycles in Random Intersection Graphs.- Optimal Cover Time for a Graph-Based Coupon Collector Process.- Stability and Similarity of Link Analysis Ranking Algorithms.- Concurrency I.- Up-to Techniques for Weak Bisimulation.- Petri Algebras.- A Finite Basis for Failure Semantics.- Spatial Logics for Bigraphs.- Encryption and related Primitives.- Completely Non-malleable Schemes.- Boneh-Franklin Identity Based Encryption Revisited.- Single-Database Private Information Retrieval with Constant Communication Rate.- Concurrent Zero Knowledge in the Public-Key Model.- Approximation Algorithms I.- A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines.- Polynomial Time Preemptive Sum-Multicoloring on Paths.- The Generalized Deadlock Resolution Problem.- Facility Location in Sublinear Time.- Games.- The Complexity of Stochastic Rabin and Streett Games.- Recursive Markov Decision Processes and Recursive Stochastic Games.- Decidability in Syntactic Control of Interference.- Idealized Algol with Ground Recursion, and DPDA Equivalence.- Approximation Algorithms II.- From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem.- How Well Can Primal-Dual and Local-Ratio Algorithms Perform?.- Approximating Max kCSP – Outperforming a Random Assignment with Almost a Linear Factor.- Lower Bounds.- On Dynamic Bit-Probe Complexity.- Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines.- Lower Bounds for Circuits with Few Modular and Symmetric Gates.- Probability.- Discrete Random Variables over Domains.- An Accessible Approach to Behavioural Pseudometrics.- Noisy Turing Machines.- Approximation Algorithms III.- A Better Approximation Ratio for the Vertex Cover Problem.- Stochastic Steiner Trees Without a Root.- Approximation Algorithms for the Max-coloring Problem.- Automata and Formal Languages II.- Tight Lower Bounds for Query Processing on Streaming and External Memory Data.- Decidability and Complexity Results for Timed Automata via Channel Machines.- Congruences for Visibly Pushdown Languages.- Approximation Algorithms IV.- Approximation Algorithms for Euclidean Group TSP.- Influential Nodes in a Diffusion Model for Social Networks.- An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks.- New Approaches for Virtual Private Network Design.- Algebraic Computation and Communication Complexity.- Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity.- Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity.- On the l-Ary GCD-Algorithm in Rings of Integers.- Concurrency II.- A Fully Abstract Encoding of the ?-Calculus with Data Terms.- Orthogonal Extensions in Structural Operational Semantics.- Basic Observables for a Calculus for Global Computing.- Compositional Verification of Asynchronous Processes via Constraint Solving.- String Matching and Computational Biology.- Optimal Spaced Seeds for Faster Approximate String Matching.- Fast Neighbor Joining.- Randomized Fast Design of Short DNA Words.- Quantum Complexity.- A Quantum Lower Bound for the Query Complexity of Simon’s Problem.- All Quantum Adversary Methods Are Equivalent.- Quantum Complexity of Testing Group Commutativity.- Analysis and Verification.- Semantic-Based Code Obfuscation by Abstract Interpretation.- About Hoare Logics for Higher-Order Store.- The Polyranking Principle.- Geometry and Load Balancing.- Approximate Guarding of Monotone and Rectilinear Polygons.- Linear Time Algorithms for Clustering Problems in Any Dimensions.- Dynamic Diffusion Load Balancing.- Concrete Complexity and Codes.- On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group.- On the Hardness of Embeddings Between Two Finite Metrics.- Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval.- Model Theory and Model Checking.- Preservation Under Extensions on Well-Behaved Finite Structures.- Unsafe Grammars and Panic Automata.- Signaling P Systems and Verification Problems.

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