LEADER 01123nam a2200289 i 4500 001 991002462339707536 008 070523s2007 enk b 001 0 eng d 020 $a1860946666 024 3 $a9781860946660 035 $ab13530811-39ule_inst 040 $aDip.to Matematica$beng 082 0 $a515.7$222 084 $aAMS 46E35 084 $aLC QA320.T56 100 1 $aTintarev, Kyril$0502345 245 10$aConcentration compactness :$bfunctional-analytic grounds and applications /$cKyril Tintarev, Karl-Heinz Fieseler 260 $aLondon :$bImperial College Press,$cc2007 300 $axii, 264 p. ;$c23 cm 504 $aIncludes bibliographical references and index 650 0$aFunctional analysis 700 1 $aFieseler, Karl-Heinz$eauthor$4http://id.loc.gov/vocabulary/relators/aut$0502346 907 $a.b13530811$b28-01-14$c23-05-07 912 $a991002462339707536 945 $aLE013 46E TIN11 (2007)$g1$i2013000205809$lle013$op$pE53.20$q-$rl$s- $t0$u0$v0$w0$x0$y.i14501156$z02-07-07 996 $aConcentration compactness$9733674 997 $aUNISALENTO 998 $ale013$b23-05-07$cm$da $e-$feng$genk$h0$i0 LEADER 05050nam 22007695 450 001 9910483626003321 005 20251226203738.0 024 7 $a10.1007/11534273 035 $a(CKB)1000000000213160 035 $a(SSID)ssj0000316181 035 $a(PQKBManifestationID)11285823 035 $a(PQKBTitleCode)TC0000316181 035 $a(PQKBWorkID)10262920 035 $a(PQKB)11248830 035 $a(DE-He213)978-3-540-31711-1 035 $a(MiAaPQ)EBC3068012 035 $a(PPN)123096502 035 $a(EXLCZ)991000000000213160 100 $a20100312d2005 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms and Data Structures $e9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings /$fedited by Frank Dehne, Alejandro López-Ortiz, Jörg-Rüdiger Sack 205 $a1st ed. 2005. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2005. 215 $a1 online resource (XIV, 446 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3608 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-31711-2 311 08$a3-540-28101-0 320 $aIncludes bibliographical references and index. 327 $aSession 1 -- Towards a Theory of Algorithms -- Session 2A -- k-Restricted Rotation with an Application to Search Tree Rebalancing -- Heap Building Bounds -- Session 2B -- The Multi-radius Cover Problem -- Parameterized Complexity of Generalized Vertex Cover Problems -- The Complexity of Implicit and Space Efficient Priority Queues -- Analysis of a Class of Tries with Adaptive Multi-digit Branching -- Balanced Aspect Ratio Trees Revisited -- Session 3B -- Improved Combinatorial Group Testing for Real-World Problem Sizes -- Parameterized Counting Algorithms for General Graph Covering Problems -- Approximating the Online Set Multicover Problems via Randomized Winnowing -- Session 4A -- Max-stretch Reduction for Tree Spanners -- Succinct Representation of Triangulations with a Boundary -- Line-Segment Intersection Made In-Place -- Session 4B -- Improved Fixed-Parameter Algorithms for Two Feedback Set Problems -- Communication-Aware Processor Allocation for Supercomputers -- Dynamic Hotlinks -- Session 6A -- The Minimum-Area Spanning Tree Problem -- Hinged Dissection of Polypolyhedra -- Session 6B -- Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms -- Linear Time Algorithms for Generalized Edge Dominating Set Problems -- Session 7A -- On Geometric Dilation and Halving Chords -- Orthogonal Subdivisions with Low Stabbing Numbers -- Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes -- Session 7B -- Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length -- A Dynamic Implicit Adjacency Labelling Scheme for Line Graphs -- The On-line Asymmetric Traveling Salesman Problem -- Session 8A -- All-Pairs Shortest Paths with Real Weights in O(n 3/log n) Time -- k-Link Shortest Paths in Weighted Subdivisions -- Power-SavingScheduling for Weakly Dynamic Voltage Scaling Devices -- Session 8B -- Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems -- On the Vehicle Routing Problem -- Session 9A -- The Structure of Optimal Prefix-Free Codes in Restricted Languages: The Uniform Probability Case -- Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms -- Derandomization of Dimensionality Reduction and SDP Based Algorithms -- Session 9B -- Subquadratic Algorithms for 3SUM -- Near-Optimal Pricing in Near-Linear Time -- Improved Approximation Bounds for Planar Point Pattern Matching. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3608 606 $aAlgorithms 606 $aArtificial intelligence$xData processing 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aComputer graphics 606 $aNumerical analysis 606 $aAlgorithms 606 $aData Science 606 $aDiscrete Mathematics in Computer Science 606 $aComputer Graphics 606 $aNumerical Analysis 615 0$aAlgorithms. 615 0$aArtificial intelligence$xData processing. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aComputer graphics. 615 0$aNumerical analysis. 615 14$aAlgorithms. 615 24$aData Science. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Graphics. 615 24$aNumerical Analysis. 676 $a005.7/3 701 $aDehne$b F$g(Frank),$f1960-$01759177 701 $aLo?pez-Ortiz$b Alejandro$00 701 $aSack$b J.-R$g(Jo?rg-Ru?diger),$f1954-$01708135 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483626003321 997 $aUNINA