LEADER 07558nam 22008175 450 001 996465839903316 005 20230221150325.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 $a20100705d2010 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAutomata, Languages and Programming$b[electronic resource] $e37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I /$fedited by Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul Spirakis 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (XXIII, 754 p. 42 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6198 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$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6198 606 $aSoftware engineering 606 $aComputer programming 606 $aComputer networks 606 $aAlgorithms 606 $aArtificial intelligence 606 $aComputer science 606 $aSoftware Engineering 606 $aProgramming Techniques 606 $aComputer Communication Networks 606 $aAlgorithms 606 $aArtificial Intelligence 606 $aTheory of Computation 615 0$aSoftware engineering. 615 0$aComputer programming. 615 0$aComputer networks. 615 0$aAlgorithms. 615 0$aArtificial intelligence. 615 0$aComputer science. 615 14$aSoftware Engineering. 615 24$aProgramming Techniques. 615 24$aComputer Communication Networks. 615 24$aAlgorithms. 615 24$aArtificial Intelligence. 615 24$aTheory of Computation. 676 $a005.1 702 $aAbramsky$b Samson$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aGavoille$b Cyril$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKirchner$b Claude$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMeyer auf der Heide$b Friedhelm$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSpirakis$b Paul$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465839903316 996 $aAutomata, languages and programming$9339738 997 $aUNISA