Automata, Languages and Programming

Jos C. M. Baeten

ISBN 10: 3540404937 / ISBN 13: 9783540404934

Published by Springer, Springer Jun 2003, 2003

About this Item

This item is printed on demand - Print on Demand Titel. Neuware -Invited Lectures.- Polarized Process Algebra and Program Equivalence.- Problems on RNA Secondary Structure Prediction and Design.- Some Issues Regarding Search, Censorship, and Anonymity in Peer to Peer Networks.- The SPQR-Tree Data Structure in Graph Drawing.- Model Checking and Testing Combined.- Logic and Automata: A Match Made in Heaven.- Algorithms.- Pushdown Automata and Multicounter Machines, a Comparison of Computation Modes.- Generalized Framework for Selectors with Applications in Optimal Group Testing.- Decoding of Interleaved Reed Solomon Codes over Noisy Data.- Process Algebra.- On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces.- Resource Access and Mobility Control with Dynamic Privileges Acquisition.- Replication vs. Recursive Definitions in Channel Based Calculi.- Approximation Algorithms.- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem.- An Improved Approximation Algorithm for the Asymmetric TSP with Strengthened Triangle Inequality.- An Improved Approximation Algorithm for Vertex Cover with Hard Capacities.- Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problem.- Approximating Steiner k-Cuts.- MAX k-CUT and Approximating the Chromatic Number of Random Graphs.- Approximation Algorithm for Directed Telephone Multicast Problem.- Languages and Programming.- Mixin Modules and Computational Effects.- Decision Problems for Language Equations with Boolean Operations.- Generalized Rewrite Theories.- Complexity.- Sophistication Revisited.- Scaled Dimension and Nonuniform Complexity.- Quantum Search on Bounded-Error Inputs.- A Direct Sum Theorem in Communication Complexity via Message Compression.- Data Structures.- Optimal Cache-Oblivious Implicit Dictionaries.- TheCell Probe Complexity of Succinct Data Structures.- Succinct Representations of Permutations.- Succinct Dynamic Dictionaries and Trees.- Graph Algorithms.- Labeling Schemes for Weighted Dynamic Trees.- A Simple Linear Time Algorithm for Computing a (2k - 1)-Spanner of O(n 1+1/k ) Size in Weighted Graphs.- Multicommodity Flows over Time: Efficient Algorithms and Complexity.- Multicommodity Demand Flow in a Tree.- Automata.- Skew and Infinitary Formal Power Series.- Nondeterminism versus Determinism for Two-Way Finite Automata: Generalizations of Sipser's Separation.- Residual Languages and Probabilistic Automata.- A Testing Scenario for Probabilistic Automata.- The Equivalence Problem for t-Turn DPDA Is Co-NP.- Flip-Pushdown Automata: k + 1 Pushdown Reversals Are Better than k.- Optimization and Games.- Convergence Time to Nash Equilibria.- Nashification and the Coordination Ratio for a Selfish Routing Game.- Stable Marriages with Multiple Partners: Efficient Search for an Optimal Solution.- An Intersection Inequality for Discrete Distributions and Related Generation Problems.- Graphs and Bisimulation.- Higher Order Pushdown Automata, the Caucal Hierarchy of Graphs and Parity Games.- Undecidability of Weak Bisimulation Equivalence for 1-Counter Processes.- Bisimulation Proof Methods for Mobile Ambients.- On Equivalent Representations of Infinite Structures.- Online Problems.- Adaptive Raising Strategies Optimizing Relative Efficiency.- A Competitive Algorithm for the General 2-Server Problem.- On the Competitive Ratio for Online Facility Location.- A Study of Integrated Document and Connection Caching.- Verification.- A Solvable Class of Quadratic Diophantine Equations with Applications to Verification of Infinite-State Systems.- Monadic Second-Order Logics withCardinalities.- 2 2 AFMC.- Upper Bounds for a Theory of Queues.- Around the Internet.- Degree Distribution of the FKP Network Model.- Similarity Matrices for Pairs of Graphs.- Algorithmic Aspects of Bandwidth Trading.- Temporal Logic and Model Checking.- CTL+ Is Complete for Double Exponential Time.- Hierarchical and Recursive State Machines w.

Seller Inventory # 9783540404934

Bibliographic Details

• Title: Automata, Languages and Programming
• Publisher: Springer, Springer Jun 2003
• Publication Date: 2003
• Language: English
• ISBN 10: 3540404937
• ISBN 13: 9783540404934
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 229W x 152H x 67D millimeters 229 millimeters width by 152 millimeters height by 67 millimeters depth
• Weight: 1769 grams

About this title

Synopsis

The refereed proceedings of the 30th International Colloquium on Automata, Languages and Programming, ICALP 2003, held in Eindhoven, The Netherlands in June/July 2003.

The 84 revised full papers presented together with six invited papers were carefully reviewed and selected from 212 submissions. The papers are organized in topical sections on algorithms, process algebra, approximation algorithms, languages and programming, complexity, data structures, graph algorithms, automata, optimization and games, graphs and bisimulation, online problems, verification, the Internet, temporal logic and model checking, graph problems, logic and lambda-calculus, data structures and algorithms, types and categories, probabilistic systems, sampling and randomness, scheduling, and geometric problems.