LEADER 07357nam 22008895 450 001 9910483530303321 005 20230320203046.0 010 $a1-282-33209-0 010 $a9786612332098 010 $a3-642-02927-2 024 7 $a10.1007/978-3-642-02927-1 035 $a(CKB)1000000000761217 035 $a(EBL)450388 035 $a(OCoLC)437345739 035 $a(SSID)ssj0000289522 035 $a(PQKBManifestationID)11222690 035 $a(PQKBTitleCode)TC0000289522 035 $a(PQKBWorkID)10404637 035 $a(PQKB)10358125 035 $a(SSID)ssj0000289521 035 $a(PQKBManifestationID)11238108 035 $a(PQKBTitleCode)TC0000289521 035 $a(PQKBWorkID)10404636 035 $a(PQKB)11558234 035 $a(DE-He213)978-3-642-02927-1 035 $a(MiAaPQ)EBC450388 035 $a(MiAaPQ)EBC6511709 035 $a(Au-PeEL)EBL6511709 035 $a(PPN)13631063X 035 $a(EXLCZ)991000000000761217 100 $a20100301d2009 u| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aAutomata, Languages and Programming $e36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I /$fedited by Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris Nikoletseas, Wolfgang Thomas 205 $a1st ed. 2009. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009. 215 $a1 online resource (807 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5555 300 $aDescription based upon print version of record. 311 $a3-642-02926-4 320 $aIncludes bibliographical references and index. 327 $aInvited 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. 330 $aThe 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). 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5555 606 $aSoftware engineering 606 $aComputer science 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aSoftware Engineering 606 $aTheory of Computation 606 $aDiscrete Mathematics in Computer Science 606 $aMathematics of Computing 606 $aAlgorithms 615 0$aSoftware engineering. 615 0$aComputer science. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aAlgorithms. 615 14$aSoftware Engineering. 615 24$aTheory of Computation. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aMathematics of Computing. 615 24$aAlgorithms. 676 $a005.131 702 $aAlbers$b Susanne 712 12$aInternational Colloquium on Automata, Languages, and Programming 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483530303321 996 $aAutomata, languages and programming$9339738 997 $aUNINA