UID:
almahu_9947364279702882
Format:
XXII, 789 p.
,
online resource.
ISBN:
9783642029271
Series Statement:
Lecture Notes in Computer Science, 5555
Content:
The two-volume set LNCS 5555 and LNCS 5556 constitutes the refereed proceedings of the 36th International Colloquium on Automata, Languages and Programming, ICALP 2009, held in Rhodes, Greece, in July 2009. The 126 revised full papers (62 papers for track A, 24 for track B, and 22 for track C) presented were carefully reviewed and selected from a total of 370 submissions. The papers are grouped in three major tracks on algorithms, automata, complexity and games; on logic, semantics, theory of programming; as well as on foundations of networked computation: models, algorithms and information management. LNCS 5555 contains 62 contributions of track A selected from 223 submissions as well as 2 invited lectures. This two-volume set lauches the new subline of Lecture Notes in Computer Science, entitled LNCS Advanced Research in Computing and Software Science (ARCoSS).
Note:
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.
In:
Springer eBooks
Additional Edition:
Printed edition: ISBN 9783642029264
Language:
English
DOI:
10.1007/978-3-642-02927-1
URL:
http://dx.doi.org/10.1007/978-3-642-02927-1
