LEADER 06107nam 22007815 450 001 996465408103316 005 20200701081919.0 010 $a3-540-45253-2 024 7 $a10.1007/3-540-45253-2 035 $a(CKB)1000000000211290 035 $a(SSID)ssj0000321189 035 $a(PQKBManifestationID)11256250 035 $a(PQKBTitleCode)TC0000321189 035 $a(PQKBWorkID)10263098 035 $a(PQKB)10172761 035 $a(DE-He213)978-3-540-45253-9 035 $a(MiAaPQ)EBC3071876 035 $a(PPN)155188607 035 $a(EXLCZ)991000000000211290 100 $a20121227d2000 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms - ESA 2000$b[electronic resource] $e8th Annual European Symposium Saarbrücken, Germany, September 5-8, 2000 Proceedings /$fedited by Mike Paterson 205 $a1st ed. 2000. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2000. 215 $a1 online resource (X, 450 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1879 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-41004-X 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Papers -- Web Information Retrieval - an Algorithmic Perspective -- Computational Biology ? Algorithms and More -- Contributed Papers -- Polygon Decomposition for Efficient Construction of Minkowski Sums -- An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts -- Offline List Update is NP-hard -- Computing Largest Common Point Sets under Approximate Congruence -- Online Algorithms for Caching Multimedia Streams -- On Recognizing Cayley Graphs -- Fast Algorithms for Even/Odd Minimum Cuts and Generalizations -- Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs -- Exact Point Pattern Matching and the Number of Congruent Triangles in a Three-Dimensional Pointset -- Range Searching over Tree Cross Products -- A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem -- The Minimum Range Assignment Problem on Linear Radio Networks -- Property Testing in Computational Geometry -- On R-Trees with Low Stabbing Number -- K-D Trees Are Better when Cut on the Longest Side -- On Multicriteria Online Problems -- Online Scheduling Revisited -- Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem -- I/O-Efficient Well-Separated Pair Decomposition and Its Applications -- Higher Order Delaunay Triangulations -- On Representations of Algebraic-Geometric Codes for List Decoding -- Minimizing a Convex Cost Closure Set -- Preemptive Scheduling with Rejection -- Simpler and Faster Vertex-Connectivity Augmentation Algorithms -- Scheduling Broadcasts in Wireless Networks -- Jitter Regulation in an Internet Router with Delay Consideration -- Approximation of Curvature-Constrained Shortest Paths through a Sequence of Points -- Resource Constrained Shortest Paths -- On the Competitiveness of Linear Search -- Maintaining a Minimum Spanning Tree under Transient Node Failures -- Minimum Depth Graph Embedding -- New Algorithms for Two-Label Point Labeling -- Analysing the Cache Behaviour of Non-uniform Distribution Sorting Algorithms -- How Helpers Hasten h-Relations -- Computing Optimal Linear Layouts of Trees in Linear Time -- Coloring Sparse Random Graphs in Polynomial Average Time -- Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine -- Collision Detection Using Bounding Boxes: Convexity Helps. 330 $aThis book constitutes the refereed proceedings of the 8th Annual European Symposium on Algorithms, ESA 2000, held in Saarbrücken, Germany in September 2000. The 39 revised full papers presented together with two invited papers were carefully reviewed and selected for inclusion in the book. Among the topics addressed are parallelism, distributed systems, approximation, combinatorial optimization, computational biology, computational geometry, external-memory algorithms, graph algorithms, network algorithms, online algorithms, data compression, symbolic computation, pattern matching, and randomized algorithms. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1879 606 $aComputer programming 606 $aData structures (Computer science) 606 $aApplication software 606 $aAlgorithms 606 $aComputer graphics 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aData Structures and Information Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/I15009 606 $aComputer Applications$3https://scigraph.springernature.com/ontologies/product-market-codes/I23001 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 606 $aComputer Graphics$3https://scigraph.springernature.com/ontologies/product-market-codes/I22013 615 0$aComputer programming. 615 0$aData structures (Computer science). 615 0$aApplication software. 615 0$aAlgorithms. 615 0$aComputer graphics. 615 14$aProgramming Techniques. 615 24$aData Structures and Information Theory. 615 24$aComputer Applications. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aData Structures. 615 24$aComputer Graphics. 676 $a004.015118 702 $aPaterson$b Mike$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aESA 2000 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465408103316 996 $aAlgorithms - ESA 2000$91980334 997 $aUNISA LEADER 01369nam 2200313 n 450 001 996392055103316 005 20200824132405.0 035 $a(CKB)1000000000668900 035 $a(EEBO)2248513836 035 $a(UnM)99871637e 035 $a(UnM)99871637 035 $a(EXLCZ)991000000000668900 100 $a19851017d1642 uy | 101 0 $aeng 135 $aurbn||||a|bb| 200 04$aThe copie of a letter from Paris, the 24. Jun. 4. Jul. 1642$b[electronic resource] $eVpon the subject of the conspiracie: for the which the Marquesse of Sainct Mars, great esquire of France, Monsieur de Thou, councellour of state, and Monsieur de Chauagnac, are kept in prison. VVith another copie of a letter from Narbon, serving to the clearing of the businesse: wherein may be seen the marvellous deliverance of France, and her confederates or friends, but especially of England, involved in that plot 210 $aPrinted at London $cfor J. B.$d1642 215 $a[2], 5, [1] p 300 $aReproduction of original in Thomason Collection, British Library. 330 $aeebo-0018 607 $aEurope$xHistory$y1517-1648 801 0$bCu-RivES 801 1$bCu-RivES 801 2$bCStRLIN 801 2$bWaOLN 906 $aBOOK 912 $a996392055103316 996 $aThe copie of a letter from Paris, the 24. Jun. 4. Jul. 1642$92330642 997 $aUNISA LEADER 00937nam a22002411i 4500 001 991000335869707536 005 20030114165211.0 008 021002s1968 uik|||||||||||||||||eng 035 $ab11990855-39ule_inst 035 $aARCHE-008065$9ExL 040 $aDip.to Filologia Ling. e Lett.$bita$cA.t.i. Arché s.c.r.l. Pandora Sicilia s.r.l. 082 04$a821.9108 245 04$aThe Chatto book of modern poetry, 1915-1955 /$cedited by C. Day Lewis & John Lehmann 260 $aLondon :$bChatto & Windus,$c1968 300 $aVIII, 286 p. ;$c21 cm 700 1 $aLehmann, John 700 1 $aDay Lewis, Cecil 907 $a.b11990855$b02-04-14$c01-04-03 912 $a991000335869707536 945 $aLE008 FL.M. (IN) E 4$g1$i2008000185640$lle008$o-$pE0.00$q-$rl$s- $t0$u0$v0$w0$x0$y.i12274331$z01-04-03 996 $aChatto book of modern poetry, 1915-1955$9131577 997 $aUNISALENTO 998 $ale008$b01-04-03$cm$da $e-$feng$guik$h4$i1