LEADER 06844nam 2200661 a 450 001 9910484310003321 005 20200520144314.0 010 $a1-280-38772-6 010 $a9786613565648 010 $a3-642-14165-X 024 7 $a10.1007/978-3-642-14165-2 035 $a(CKB)2670000000028924 035 $a(SSID)ssj0000446321 035 $a(PQKBManifestationID)11281707 035 $a(PQKBTitleCode)TC0000446321 035 $a(PQKBWorkID)10491751 035 $a(PQKB)11234749 035 $a(DE-He213)978-3-642-14165-2 035 $a(MiAaPQ)EBC3065500 035 $a(PPN)149072864 035 $a(EXLCZ)992670000000028924 100 $a20100526d2010 uy 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAutomata, languages and programming $e37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010 : proceedings. Part I /$fSamson Abramsky ... [et al.], (eds.) 205 $a1st ed. 210 $aBerlin $cSpringer$d2010 215 $a1 online resource (XXIII, 754 p. 42 illus.) 225 1 $aLecture notes in computer science,$x0302-9743 ;$v6198 225 1 $aLNCS sublibrary. SL 1, Theoretical computer science and general issues 225 1 $aAdvanced research in computing and software science 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-14164-1 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- Local Search: Simple, Successful, But Sometimes Sluggish -- When Conflicting Constraints Can Be Resolved ? The Lovász Local Lemma and Satisfiability -- Session 1-Track A. Combinatorial Optimization -- Plane Spanners of Maximum Degree Six -- The Positive Semidefinite Grothendieck Problem with Rank Constraint -- Cycle Detection and Correction -- Decomposition Width of Matroids -- Session 2-Track A1. Game Theory -- The Cooperative Game Theory Foundations of Network Bargaining Games -- On the Existence of Pure Nash Equilibria in Weighted Congestion Games -- On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions -- Mean-Payoff Games and Propositional Proofs -- Session 2-Track A2. Security -- Online Network Design with Outliers -- Efficient Completely Non-malleable Public Key Encryption -- Polynomial-Space Approximation of No-Signaling Provers -- From Secrecy to Soundness: Efficient Verification via Secure Computation -- Session 3-Track A1. Data Structures -- Mergeable Dictionaries -- Faster Algorithms for Semi-matching Problems (Extended Abstract) -- Clustering with Diversity -- New Data Structures for Subgraph Connectivity -- Session 3-Track A2. Sorting & Hashing -- Tight Thresholds for Cuckoo Hashing via XORSAT -- Resource Oblivious Sorting on Multicores -- Interval Sorting -- Session 4-Track A. Graphs, Nets and Optimization -- Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems -- Thresholded Covering Algorithms for Robust and Max-min Optimization -- Graph Homomorphisms with Complex Values: A Dichotomy Theorem -- Metrical Task Systems and the k-Server Problem on HSTs -- Session 5-Track A1. Scheduling -- Scheduling Periodic Tasks in a Hard Real-Time Environment -- Scalably Scheduling Power-Heterogeneous Processors -- Better Scalable Algorithms for Broadcast Scheduling -- Max-min Online Allocations with a Reordering Buffer -- Session 5-Track A2. Graphs & Hypergraphs -- Orientability of Random Hypergraphs and the Power of Multiple Choices -- On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs -- Dynamic Programming for Graphs on Surfaces -- Interval Graphs: Canonical Representation in Logspace -- Session 6-Track A. Best Paper Award -- Approximating the Partition Function of the Ferromagnetic Potts Model -- Session 7-Track A. Algebraic Problems -- On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors -- On Sums of Roots of Unity -- Exponential Time Complexity of the Permanent and the Tutte Polynomial -- On Approximate Horn Formula Minimization -- Session 8-Track A. Networks & Communication Complexity -- Choosing, Agreeing, and Eliminating in Communication Complexity -- Additive Spanners in Nearly Quadratic Time -- Composition Theorems in Communication Complexity -- Network Design via Core Detouring for Problems without a Core -- Session 9-Track A1. Complexity & Automata -- Weak Completeness Notions for Exponential Time -- Efficient Evaluation of Nondeterministic Automata Using Factorization Forests -- On the Complexity of Searching in Trees: Average-Case Minimization -- Session 9-Track A2. Finding & Testing -- Finding Is as Easy as Detecting for Quantum Walks -- Improved Constructions for Non-adaptive Threshold Group Testing -- Testing Non-uniform k-Wise Independent Distributions over Product Spaces -- Session 10-Track A1. Approximations -- A Sublogarithmic Approximation for Highway and Tollbooth Pricing -- Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm -- Cell Probe Lower Bounds and Approximations for Range Mode -- SDP Gaps for 2-to-1 and Other Label-Cover Variants -- Session 10-Track A2. Streaming & Preprocessing -- Data Stream Algorithms for Codeword Testing -- Streaming Algorithms for Independent Sets -- Preprocessing of Min Ones Problems: A Dichotomy -- Holographic Reduction: A Domain Changed Application and Its Partial Converse Theorems -- Session 11-Track A1. Adaptive, Knowledge & Optimality -- Optimal Trade-Offs for Succinct String Indexes -- Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems -- Concurrent Knowledge Extraction in the Public-Key Model -- Session 11-Track A2. Covering, Graphs & Independence -- On the k-Independence Required by Linear Probing and Minwise Independence -- Covering and Packing in Linear Space -- Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs. 410 0$aLecture notes in computer science.$pAdvanced research in computing and software science. 410 0$aLecture notes in computer science ;$v6198. 410 0$aLNCS sublibrary.$nSL 1,$pTheoretical computer science and general issues. 606 $aMachine theory$vCongresses 606 $aComputer programming$vCongresses 606 $aRobots$xProgramming$vCongresses 606 $aFormal languages$vCongresses 615 0$aMachine theory 615 0$aComputer programming 615 0$aRobots$xProgramming 615 0$aFormal languages 676 $a005.1 701 $aAbramsky$b Samson$0732262 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484310003321 996 $aAutomata, languages and programming$94189694 997 $aUNINA