9783540734192 - Automata, Languages and Programming: 34th International Colloquium, Icalp 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings Lecture Notes in Computer Science, 459... (8 results)

Condition: New. In.

Taschenbuch. Condition: Neu. Automata, Languages and Programming | 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings | Lars Arge (u. a.) | Taschenbuch | xvii | Englisch | 2007 | Springer | EAN 9783540734192 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Paperback. Condition: Brand New. 1st edition. 953 pages. 9.25x6.25x1.50 inches. In Stock.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 are presented, together with four invited lectures. The papers are grouped into three major tracks covering algorithms, automata, complexity, and games; logic, semantics, and theory of programming; and security and cryptography foundations.

Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 are presented, together with four invited lectures. The papers are grouped into three major tracks covering algorithms, automata, complexity, and games; logic, semantics, and theory of programming; and security and cryptography foundations. 976 pp. Englisch.

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Features the refereed proceedings from the 34th International Colloquium on Automata, Languages and ProgrammingIncludes 76 full papers and 4 invited papersCovers algorithms, automata, complexity, and games logic, semantics, and theory of p.

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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-OnceMemories.- 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 RandoSpringer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 976 pp. Englisch.