Titel: Automata, Languages and Programming
36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I.
Herausgegeben von Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias
24. Juni 2009 - kartoniert - 789 Seiten
ICALP 2009, the 36th edition of the International Colloquium on Automata, Languages and Programming, was held on the island of Rhodes, July 6 10, 2009. ICALP is a series of annual conferences of the European Association for Theoretical Computer Science (EATCS) which ?rst took place in 1972. This year, the ICALP program consisted of the established track A (focusing on algorithms, complexity and games) and track B (focusing on logic, automata, semantics and theory of programming), and of the recently introduced track C (in 2009 focusing on foundations of networked computation). In response to the call for papers, the Program Committee received 370 s- missions: 223 for track A, 84 for track B and 63 for track C. Out of these, 108 papers were selected for inclusion in the scienti?c program: 62 papers for track A, 24 for track B and 22 for track C. The selection was made by the Program Committees based on originality, quality, and relevance to theoretical computer science. The quality of the manuscripts was very high indeed, and many dese- ing papers could not be selected. ICALP 2009 consisted of ?ve invited lectures and the contributed papers. Thisvolumeoftheproceedingscontainsallcontributedpaperspresentedintrack AtogetherwiththepapersbytheinvitedspeakersKurtMehlhorn(Max-Planck- Institut fu r Informatik, Saarbru cken)and Christos Papadimitriou(University of California at Berkeley). A companion volume contains all contributed papers presented at the conference in track B and track C, together with the papers by the invited speakers Georg Gottlob (University of Oxford), Tom Henzinger (EcolePolytechniqueF ed eraledeLausanne),andNoamNisan(Google,TelAviv, and Hebrew University).
Invited Lectures.- Assigning Papers to Referees.- Algorithmic Game Theory: A Snapshot.- Contributed Papers.- SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs.- Correlation Clustering Revisited: The True Cost of Error Minimization Problems.- Sorting and Selection with Imprecise Comparisons.- Fast FAST.- Bounds on the Size of Small Depth Circuits for Approximating Majority.- Counting Subgraphs via Homomorphisms.- External Sampling.- Functional Monitoring without Monotonicity.- De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results.- Towards a Study of Low-Complexity Graphs.- Decidability of Conjugacy of Tree-Shifts of Finite Type.- Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule.- Competitive Analysis of Aggregate Max in Windowed Streaming.- Faster Regular Expression Matching.- A Fast and Simple Parallel Algorithm for the Monotone Duality Problem.- Unconditional Lower Bounds against Advice.- Approximating Decision Trees with Multiway Branches.- Annotations in Data Streams.- The Tile Complexity of Linear Assemblies.- A Graph Reduction Step Preserving Element-Connectivity and Applications.- Approximating Matches Made in Heaven.- Strong and Pareto Price of Anarchy in Congestion Games.- A Better Algorithm for Random k-SAT.- Exact and Approximate Bandwidth.- Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs.- Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs.- On Cartesian Trees and Range Minimum Queries.- Applications of a Splitting Trick.- Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness.- Incompressibility through Colors and IDs.- Partition Arguments in Multiparty Communication Complexity.- High Complexity Tilings with Sparse Errors.- Tight Bounds for the Cover Time of Multiple Random Walks.- Online Computation with Advice.- Dynamic Succinct Ordered Trees.- Universal Succinct Representations of Trees?.- Distortion Is Fixed Parameter Tractable.- Towards Optimal Range Medians.- B-Treaps: A Uniquely Represented Alternative to B-Trees.- Testing Fourier Dimensionality and Sparsity.- Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams.- Wireless Communication Is in APX.- The Ehrenfeucht-Silberger Problem.- Applications of Effective Probability Theory to Martin-Löf Randomness.- An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables.- Popular Mixed Matchings.- Factoring Groups Efficiently.- On Finding Dense Subgraphs.- Learning Halfspaces with Malicious Noise.- General Scheme for Perfect Quantum Network Coding with Free Classical Communication.- Greedy -Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost.- Limits and Applications of Group Algebras for Parameterized Problems.- Sleep with Guilt and Work Faster to Minimize Flow Plus Energy.- Improved Bounds for Flow Shop Scheduling.- A 3/2-Approximation Algorithm for General Stable Marriage.- Limiting Negations in Formulas.- Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems.- Superhighness and Strong Jump Traceability.- Amortized Communication Complexity of Distributions.- The Number of Symbol Comparisons in QuickSort and QuickSelect.- Computing the Girth of a Planar Graph in O(n logn) Time.- Elimination Graphs.