Automata, Languages and Programming: 30th International Colloquium, Icalp 2003, Eindhoven, the Netherlands, June 30 - July 4, 2003, Proceedings

by Baeten, J. C. M.; Baeten, J. C. M.; Lenstra, J. K.; Parrow, Joachim; Woeginger, Gerhard J.

• ISBN13: 9783540404934
• ISBN10: 3540404937
• eBook ISBN(s): 9783540450610
• Format: Paperback
• Copyright: 2003-08-01
• Publisher: Springer-Verlag New York Inc

Summary

This book constitutes 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.

Table of Contents

Polarized Process Algebra and Program Equivalence	p. 1
Problems on RNA Secondary Structure Prediction and Design	p. 22
Some Issues Regarding Search, Censorship, and Anonymity in Peer to Peer Networks	p. 33
The SPQR-Tree Data Structure in Graph Drawing	p. 34
Model Checking and Testing Combined	p. 47
Logic and Automata: A Match Made in Heaven	p. 64
Pushdown Automata and Multicounter Machines, a Comparison of Computation Modes	p. 66
Generalized Framework for Selectors with Applications in Optimal Group Testing	p. 81
Decoding of Interleaved Reed Solomon Codes over Noisy Data	p. 97
On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces	p. 109
Resource Access and Mobility Control with Dynamic Privileges Acquisition	p. 119
Replication vs. Recursive Definitions in Channel Based Calculi	p. 133
Improved Combinatorial Approximation Algorithms for the [kappa]-Level Facility Location Problem	p. 145
An Improved Approximation Algorithm for the Asymmetric TSP with Strengthened Triangle Inequality	p. 157
An Improved Approximation Algorithm for Vertex Cover with Hard Capacities	p. 164
Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problem	p. 176
Approximating Steiner [kappa]-Cuts	p. 189
MAX k-CUT and Approximating the Chromatic Number of Random Graphs	p. 200
Approximation Algorithm for Directed Telephone Multicast Problem	p. 212
Mixin Modules and Computational Effects	p. 224
Decision Problems for Language Equations with Boolean Operations	p. 239
Generalized Rewrite Theories	p. 252
Sophistication Revisited	p. 267
Scaled Dimension and Nonuniform Complexity	p. 278
Quantum Search on Bounded-Error Inputs	p. 291
A Direct Sum Theorem in Communication Complexity via Message Compression	p. 300
Optimal Cache-Oblivious Implicit Dictionaries	p. 316
The Cell Probe Complexity of Succinct Data Structures	p. 332
Succinct Representations of Permutations	p. 345
Succinct Dynamic Dictionaries and Trees	p. 357
Labeling Schemes for Weighted Dynamic Trees	p. 369
A Simple Linear Time Algorithm for Computing a (2k - 1)-Spanner of O(n[superscript 1+1/k]) Size in Weighted Graphs	p. 384
Multicommodity Flows over Time: Efficient Algorithms and Complexity	p. 397
Multicommodity Demand Flow in a Tree	p. 410
Skew and Infinitary Formal Power Series	p. 426
Nondeterminism versus Determinism for Two-Way Finite Automata: Generalizations of Sipser's Separation	p. 439
Residual Languages and Probabilistic Automata	p. 452
A Testing Scenario for Probabilistic Automata	p. 464
The Equivalence Problem for t-turn DPDA Is Co-NP	p. 478
Flip-Pushdown Automata: k + 1 Pushdown Reversals Are Better than k	p. 490
Convergence Time to Nash Equilibria	p. 502
Nashification and the Coordination Ratio for a Selfish Routing Game	p. 514
Stable Marriages with Multiple Partners: Efficient Search for an Optimal Solution	p. 527
An Intersection Inequality for Discrete Distributions and Related Generation Problems	p. 543
Higher Order Pushdown Automata, the Caucal Hierarchy of Graphs and Parity Games	p. 556
Undecidability of Weak Bisimulation Equivalence for 1-Counter Processes	p. 570
Bisimulation Proof Methods for Mobile Ambients	p. 584
On Equivalent Representations of Infinite Structures	p. 599
Adaptive Raising Strategies Optimizing Relative Efficiency	p. 611
A Competitive Algorithm for the General 2-Server Problem	p. 624
On the Competitive Ratio for Online Facility Location	p. 637
A Study of Integrated Document and Connection Caching	p. 653
A Solvable Class of Quadratic Diophantine Equations with Applications to Verification of Infinite-State Systems	p. 668
Monadic Second-Order Logics with Cardinalities	p. 681
[actual symbol not reproducible]	p. 697
Upper Bounds for a Theory of Queues	p. 714
Degree Distribution of the FKP Network Model	p. 725
Similarity Matrices for Pairs of Graphs	p. 739
Algorithmic Aspects of Bandwidth Trading	p. 751
CTL[superscript +] Is Complete for Double Exponential Time	p. 767
Hierarchical and Recursive State Machines with Context-Dependent Properties	p. 776
Oracle Circuits for Branching-Time Model Checking	p. 790
There Are Spanning Spiders in Dense Graphs (and We Know How to Find Them)	p. 802
The Computational Complexity of The Role Assignment Problem	p. 817
Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs	p. 829
Genus Characterizes the Complexity of Graph Problems: Some Tight Results	p. 845
The Definition of a Temporal Clock Operator	p. 857
Minimal Classical Logic and Control Operators	p. 871
Counterexample-Guided Control	p. 886
Axiomatic Criteria for Quotients and Subobjects for Higher-Order Data Types	p. 903
Efficient Pebbling for List Traversal Synopses	p. 918
Function Matching: Algorithms, Applications, and a Lower Bound	p. 929
Simple Linear Work Suffix Array Construction	p. 943
Expansion Postponement via Cut Elimination in Sequent Calculi for Pure Type Systems	p. 956
Secrecy in Untrusted Networks	p. 969
Locally Commutative Categories	p. 984
Semi-pullbacks and Bisimulations in Categories of Stochastic Relations	p. 996
Quantitative Analysis of Probabilistic Lossy Channel Systems	p. 1008
Discounting the Future in Systems Theory	p. 1022
Information Flow in Concurrent Games	p. 1038
Impact of Local Topological Information on Random Walks on Finite Graphs	p. 1054
Analysis of a Simple Evolutionary for Minimization in Euclidean Spaces	p. 1068
Optimal Coding and Sampling of Triangulations	p. 1080
Generating Labeled Planar Graphs Uniformly at Random	p. 1095
Online Load Balancing Made Simple: Greedy Strikes Back	p. 1108
Real-Time Scheduling with a Budget	p. 1123
Improved Approximation Algorithms for Minimum-Space Advertisement Scheduling	p. 1138
Anycasting in Adversarial Systems: Routing and Admission Control	p. 1153
Dynamic Algorithms for Approximating Interdistances	p. 1169
Solving the Robots Gathering Problem	p. 1181
Author Index	p. 1197
Table of Contents provided by Blackwell. All Rights Reserved.