Automata, languages and programming : 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009 : proceedings
著者
書誌事項
Automata, languages and programming : 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009 : proceedings
（Lecture notes in computer science, 5555-5556 . Advanced research in computing and software science）
Springer, c2009
- pt. 1
- pt. 2
- タイトル別名
-
ICALP 2009
大学図書館所蔵 全11件
注記
Other editors: Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris Nikoletseas, Wolfgang Thomas
Includes bibliographies and index
内容説明・目次
- 巻冊次
-
pt. 1 ISBN 9783642029264
内容説明
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-Loef 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 Moebius 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.
- 巻冊次
-
pt. 2 ISBN 9783642029295
内容説明
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.
目次
Track B: Invited Lectures.- A Survey of Stochastic Games with Limsup and Liminf Objectives.- Tractable Optimization Problems through Hypergraph-Based Structural Restrictions.- Track B: Contributed Papers.- Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural Types.- When Are Timed Automata Determinizable?.- Faithful Loops for Aperiodic E-Ordered Monoids.- Boundedness of Monadic Second-Order Formulae over Finite Words.- Semilinear Program Feasibility.- Floats and Ropes: A Case Study for Formal Numerical Program Verification.- Reachability in Stochastic Timed Games.- Equations Defining the Polynomial Closure of a Lattice of Regular Languages.- Approximating Markov Processes by Averaging.- The Theory of Stabilisation Monoids and Regular Cost Functions.- A Tight Lower Bound for Determinization of Transition Labeled Buchi Automata.- On Constructor Rewrite Systems and the Lambda-Calculus.- On Regular Temporal Logics with Past,.- Forward Analysis for WSTS, Part II: Complete WSTS.- Qualitative Concurrent Stochastic Games with Imperfect Information.- Diagrammatic Confluence and Completion.- Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus.- LTL Path Checking Is Efficiently Parallelizable.- An Explicit Formula for the Free Exponential Modality of Linear Logic.- Decidability of the Guarded Fragment with the Transitive Closure.- Weak Alternating Timed Automata.- A Decidable Characterization of Locally Testable Tree Languages.- The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games.- Track C: Invited Lecture.- Google's Auction for TV Ads.- Track C: Contributed Papers.- Graph Sparsification in the Semi-streaming Model.- Sort Me If You Can: How to Sort Dynamic Data.- Maximum Bipartite Flow in Networks with Adaptive Channel Width.- Mediated Population Protocols.- Rumor Spreading in Social Networks.- MANETS: High Mobility Can Make Up for Low Transmission Power.- Multiple Random Walks and Interacting Particle Systems.- Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies.- On a Network Generalization of the Minmax Theorem.- Rate-Based Transition Systems for Stochastic Process Calculi.- Improved Algorithms for Latency Minimization in Wireless Networks.- Efficient Methods for Selfish Network Design.- Smoothed Analysis of Balancing Networks.- Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures.- Multi-armed Bandits with Metric Switching Costs.- Algorithms for Secretary Problems on Graphs and Hypergraphs.- Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps.- Secure Function Collection with Sublinear Storage.- Worst-Case Efficiency Analysis of Queueing Disciplines.- On Observing Dynamic Prioritised Actions in SOC.- A Distributed and Oblivious Heap.- Proportional Response Dynamics in the Fisher Market.
「Nielsen BookData」 より