LEADER 02367nam 2200385 n 450 001 996391710003316 005 20200824121741.0 035 $a(CKB)4940000000108493 035 $a(EEBO)2248560821 035 $a(UnM)99863519e 035 $a(UnM)99863519 035 $a(EXLCZ)994940000000108493 100 $a19930511d1649 uy | 101 0 $aeng 135 $aurbn||||a|bb| 200 10$aRome ruin'd by VVhite Hall, or, The papall crown demolisht$b[electronic resource] $econtaining a confutation of the three degrees of popery, viz. papacy, prelacy, and presbitery; answerable to the triple crowne of the three-headed Cerberus the Pope, with his three fold hierarchies aforesaid. With a dispelling of all other dispersed clouds of errour, which doth interpose the clear sun-shine of the Gospel in our horrizon. Wherein the chiefe arguments each of them have, for the vindication of their erronious tenents are incerted, and refuted; with a description of such whem [sic] the true Church of Christ doth consist of: as also how, and by whom, they may be gathered, and governed, according to the will, and appointment of Jesus Christ, and his apostles, in the primative purity thereof. /$fBy Iohn Spittlehouse, assistant to the Marshall Generall of the Army, under the command of his Excellency, the Lord Generall Fairfax. Imprimated by Theod. Jennings, and entred in the Stationers Hall 210 $aPrinted at London $cby Thomas Paine, and are to be sold at his house in Goold [sic] Smiths Alley in Redcrosse Street$d1650. [i.e. 1649] 215 $a[34], 80, 73-360, [4] p., $cill 300 $aThe first leaf bears a verse explanation of the frontispiece. 300 $aReproduction of the original in the British Library. 300 $aAnnotation on Thomason copy: "Decemb. 31."; the 50 in imprint date has been altered to 49. 330 $aeebo-0018 606 $aPresbyterianism$vControversial literature$vEarly works to 1800 607 $aGreat Britain$xChurch history$y17th century$vEarly works to 1800 615 0$aPresbyterianism 700 $aSpittlehouse$b John$01005039 801 0$bCu-RivES 801 1$bCu-RivES 801 2$bUk-ES 801 2$bCStRLIN 801 2$bWaOLN 906 $aBOOK 912 $a996391710003316 996 $aRome ruin'd by VVhite Hall, or, The papall crown demolisht$92319653 997 $aUNISA LEADER 01141nam a2200301 i 4500 001 991000031219707536 005 20020509160918.0 008 940510s1986 fr ||| | fre 020 $a2865631540 035 $ab11297906-39ule_inst 035 $aPARLA200221$9ExL 040 $aDip.to Filol. Class. e Med.$bita 100 1 $aCalame, Claude$0144179 245 13$aLe récit en Grèce ancienne :$benonciations et représentations de poètes /$cClaude Calame ; préface de Jean-Claude Coquet 260 $aParis :$bMéridiens Klincksieck,$c1986 300 $aIV, 222 p. ;$c23 cm. 650 4$aEsiodo 650 4$aIconografia greca 650 4$aLetteratura greca$xPoesia lirica 650 4$aLetteratura greca$xPoesia epica 650 4$aTeatro greco 700 1 $aCoquet, Jean-Claude 907 $a.b11297906$b02-04-14$c01-07-02 912 $a991000031219707536 945 $aLE007 C Litt 850 Sala cons.$g1$i2007000001981$lle007$nSala consultazione$o-$pE0.00$q-$rl$s- $t0$u0$v0$w0$x0$y.i11464975$z01-07-02 996 $aRécit en Grèce ancienne$922292 997 $aUNISALENTO 998 $ale007$b01-01-94$cm$da $e-$ffre$gfr $h3$i1 LEADER 08897nam 22008535 450 001 9910484314703321 005 20251226195857.0 010 $a3-540-49696-3 024 7 $a10.1007/11940128 035 $a(CKB)1000000000283730 035 $a(SSID)ssj0000316180 035 $a(PQKBManifestationID)11273113 035 $a(PQKBTitleCode)TC0000316180 035 $a(PQKBWorkID)10263185 035 $a(PQKB)10696669 035 $a(DE-He213)978-3-540-49696-0 035 $a(MiAaPQ)EBC3068628 035 $a(PPN)123139813 035 $a(BIP)34164514 035 $a(BIP)13947253 035 $a(EXLCZ)991000000000283730 100 $a20100301d2006 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms and Computation $e17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings /$fedited by Tetsuo Asano 205 $a1st ed. 2006. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2006. 215 $a1 online resource (XX, 766 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4288 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-49694-7 320 $aIncludes bibliographical references and author index. 327 $aInvited Talks -- Stable Matching Problems -- Delaunay Meshing of Surfaces -- Best Paper 2006 -- Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner?s Contraction -- Best Student Paper 2006 -- Branching and Treewidth Based Exact Algorithms -- Session 1A: Algorithms and Data Structures -- Deterministic Splitter Finding in a Stream with Constant Storage and Guarantees -- Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules -- Flexible Word Design and Graph Labeling -- Session 1B: Online Algorithms -- Frequency Allocation Problems for Linear Cellular Networks -- Finite-State Online Algorithms and Their Automated Competitive Analysis -- Offline Sorting Buffers on Line -- Session 2A: Approximation Algorithms -- Approximating Tree Edit Distance Through String Edit Distance -- A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees -- Improved Approximation for Single-Sink Buy-at-Bulk -- Approximability of Partitioning Graphs with Supply and Demand -- Session 2B: Graphs -- Convex Grid Drawings of Plane Graphs with Rectangular Contours -- Algorithms on Graphs with Small Dominating Targets -- Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems -- On Estimating Path Aggregates over Streaming Graphs -- Session 3A: Computational Geometry -- Diamond Triangulations Contain Spanners of Bounded Degree -- Optimal Construction of the City Voronoi Diagram -- Relations Between Two Common Types of Rectangular Tilings -- Quality Tetrahedral Mesh Generation for Macromolecules -- On Approximating the TSP with Intersecting Neighborhoods -- Session 3B: Computational Complexity -- Negation-Limited Complexity of Parity and Inverters -- The Complexity of Quasigroup Isomorphism and the MinimumGenerating Set Problem -- Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete -- Parameterized Problems on Coincidence Graphs -- On 2-Query Codeword Testing with Near-Perfect Completeness -- Session 4A: Algorithms and Data Structures -- Poketree: A Dynamically Competitive Data Structure with Good Worst-Case Performance -- Efficient Algorithms for the Optimal-Ratio Region Detection Problems in Discrete Geometry with Applications -- On Locating Disjoint Segments with Maximum Sum of Densities -- Two-Tier Relaxed Heaps -- Session 4B: Games and Networks -- The Interval Liar Game -- How Much Independent Should Individual Contacts Be to Form a Small?World? -- Faster Centralized Communication in Radio Networks -- On the Runtime and Robustness of Randomized Broadcasting -- Session 5A: Combinatorial Optimization and Computational Biology -- Local Search in Evolutionary Algorithms: The Impact of the Local Search Frequency -- Non-cooperative Facility Location and Covering Games -- Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees -- Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications -- Algorithms for Computing Variants of the Longest Common Subsequence Problem -- Session 5B: Graphs -- Constructing Labeling Schemes Through Universal Matrices -- Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions -- Analyzing Disturbed Diffusion on Networks -- Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs -- On Isomorphism and Canonization of Tournaments and Hypertournaments -- Session 6A: Algorithms and Data Structures -- Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem -- Deterministic Random Walks on the Two-Dimensional Grid.-Improving Time and Space Complexity for Compressed Pattern Matching -- Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems -- Session 6B: Graphs -- A Simple Message Passing Algorithm for Graph Partitioning Problems -- Minimal Interval Completion Through Graph Exploration -- Balanced Cut Approximation in Random Geometric Graphs -- Improved Algorithms for the Minmax-Regret 1-Center Problem -- Session 7A: Approximation Algorithms -- On Approximating the Maximum Simple Sharing Problem -- Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures -- Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems -- Session 7B: Graphs -- Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii -- Efficient Prüfer-Like Coding and Counting Labelled Hypertrees -- Intuitive Algorithms and t-Vertex Cover -- Session 8A: Combinatorial Optimization and Quantum Computing -- Politician?s Firefighting -- Runtime Analysis of a Simple Ant Colony Optimization Algorithm -- Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems -- Resources Required for Preparing Graph States -- Session 8B: Online Algorithms -- Online Multi-path Routing in a Maze -- On the On-Line k-Truck Problem with Benefit Maximization -- Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels -- Online Packet Admission and Oblivious Routing in Sensor Networks -- Session 9A: Computational Geometry -- Field Splitting Problems in Intensity-Modulated Radiation Therapy -- Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy -- A New Approximation Algorithm for Multidimensional Rectangle Tiling -- Tessellation of Quadratic Elements -- Session9B: Distributed Computing and Cryptography -- Effective Elections for Anonymous Mobile Agents -- Gathering Asynchronous Oblivious Mobile Robots in a Ring -- Provably Secure Steganography and the Complexity of Sampling. 330 $aThis book constitutes the refereed proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC 2006, held in Kolkata, India, December 2006. The 73 revised full papers cover algorithms and data structures, online algorithms, approximation algorithm, computational geometry, computational complexity, optimization and biology, combinatorial optimization and quantum computing, as well as distributed computing and cryptography. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4288 606 $aComputer programming 606 $aAlgorithms 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aComputer networks 606 $aComputer graphics 606 $aProgramming Techniques 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aNumerical Analysis 606 $aComputer Communication Networks 606 $aComputer Graphics 615 0$aComputer programming. 615 0$aAlgorithms. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aNumerical analysis. 615 0$aComputer networks. 615 0$aComputer graphics. 615 14$aProgramming Techniques. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aNumerical Analysis. 615 24$aComputer Communication Networks. 615 24$aComputer Graphics. 676 $a005.1 701 $aAsano$b T$g(Tetsuo),$f1949-$01757721 712 12$aISAAC (Conference) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484314703321 996 $aAlgorithms and computation$94195666 997 $aUNINA