02625cam0-22004211i-450 99000981603040332120190410125844.0ella 7622 s-o: laAn (3) 1590 (R)feiIT-NA0105000981603FED01000981603(Aleph)000981603FED0100098160320140128d1590----km-y0itay50------baitaITa-----------------bb0-------Aggiunta al vago, e diletteuole giardino del R. padre Luigi Contarini crucifero, dall'istesso auttore nouamente composta, nella quale si leggono, Il computo de gli anni del mondo. Gli essempi di virtù, & vitij de gli huomini. Alcuni prencipi, i quali amarono molto i virtuosi ...In Vicenzaper gli heredi di Perin Libraro1590[12], 123, [1] c.4°Marca (Z55) sul front.Segn.: πA⁴ 2✝⁸ A-P⁸ Q⁴. - C. B4 erroneamente segnata C4. - C. 67 erroneamente numerata 57 e la c. 69 erroneamente numerata 36Mutilo del fasc. 2✝⁸, erroneamente rilegato dopo il fasc. ✝⁶ de: Il vago, e diletteuole giardino, oue si leggono gli infelici fini de molti huomini illustri. I varij, & mirabili essempi di virtù, & vitij degli huomini. I fatti, & la morte de' profeti. ... Raccolto dal padre Luigi Contarino cruciferoIT-NA0105: SG 850/B 108 (2)Piatto anteriore staccatoIT-NA0105: SG 850/B 108 (2)Legato con: Il vago, e dilettevole giardino, ove si leggono gli infelici fini de molti huomini illustri. I varij, & mirabili essempi di virtù, & vitij degli huomini. I fatti, & la morte de' profeti. ... Raccolto dal padre Luigi Contarino cruciferoIT-NA0105: SG 850/B 108 (2)EDIT16,CNCE 13148001990005005140403321Italia.Vicenza85822itaContarini,Luigi494834Perineredi650ITUNINARICAUNIMARCVisualizza la versione elettronica in SBNWebhttps://books.google.it/books?id=3m1X12IOu8gC&printsec=frontcover&hl=it&source=gbs_ge_summary_r&cad=0#v=onepage&q&f=false20190410AQ990009816030403321SG 850/B 108 (2)Bib. 43.412FLFBCFLFBCAggiunta al vago, e diletteuole giardino del R. padre Luigi Contarini crucifero, dall'istesso auttore nouamente composta, nella quale si leggono, Il computo de gli anni del mondo. Gli essempi di virtù, & vitij de gli huomini. Alcuni prencipi, i quali amarono molto i virtuosi ..835241UNINA02292nam 2200517Ia 450 991044998670332120210425131047.01-280-46394-597866104639471-4175-6172-690-474-0111-5(CKB)1000000000032950(EBL)253472(OCoLC)171583065(MiAaPQ)EBC253472(Au-PeEL)EBL253472(CaPaEBR)ebr10090587(CaONFJC)MIL46394(EXLCZ)99100000000003295019970207d1997 uy 0engur|n|---|||||A grammar of the Ugaritic language[electronic resource] /by Daniel SivanLeiden ;New York Brill19971 online resource (353 p.)Handbook of oriental studies. The Near and Middle East =Handbuch der Orientalistik. Erste Abteilung, Der Nahe und Mittlere Osten,0169-9423 ;28. BdDescription based upon print version of record.90-04-12293-1 Includes bibliographical references (p. [227]-238) and indexes.Contents; Foreword; Abbreviations; Introduction; I. Orthography; II. Phonology; III Pronouns; IV. The noun; V. Numerals and numeric terms; VI. The verb; VII. Adverbial and adverbs suffixes; VIII. Several syntactical points; Bibliography; Appendix: Text selections; Indices; Corrections to the first editionUgaritic, discovered in 1929, is a North-West Semitic language, documented on clay tablets (about 1250 texts) and dated from the period between the 14th and the 12th centuries BCE. This text deals with the phonology, morphology and syntax of Ugaritic.Handbuch der Orientalistik.Erste Abteilung,Nahe und der Mittlere Osten ;28. Bd.Ugaritic languageGrammarSemitic languages, NorthwestElectronic books.Ugaritic languageGrammar.Semitic languages, Northwest.492/.6782421Sivan Daniel647241MiAaPQMiAaPQMiAaPQBOOK9910449986703321Grammar of the ugaritic language1146913UNINA05295nam 22007815 450 991076757790332120251116234218.03-540-45477-210.1007/3-540-45477-2(CKB)1000000000211601(SSID)ssj0000323619(PQKBManifestationID)11247885(PQKBTitleCode)TC0000323619(PQKBWorkID)10299477(PQKB)10660899(DE-He213)978-3-540-45477-9(MiAaPQ)EBC3072825(PPN)155186248(EXLCZ)99100000000021160120121227d2001 u| 0engurnn|008mamaatxtccrGraph-Theoretic Concepts in Computer Science 27th International Workshop, WG 2001 Boltenhagen, Germany, June 14-16, 2001 Proceedings /edited by Andreas Brandstädt, Van Bang Le1st ed. 2001.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2001.1 online resource (X, 334 p.) Lecture Notes in Computer Science,0302-9743 ;2204Bibliographic Level Mode of Issuance: Monograph3-540-42707-4 Includes bibliographical references at the end of each chapters and index.Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces -- Data Management in Networks -- Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs -- Approximate Constrained Bipartite Edge Coloring -- Maximum Clique Transversals -- On the Tree-Degree of Graphs -- On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms -- (k+) -Disatance- Herediatry Graphs -- On the Relationship between Clique-Width and Treewidth -- Planarity of the 2-Level Cactus Model -- Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach -- How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time -- (g, f)-Factorizations Orthogonal to k Subgraphs -- On Star Coloring of Graphs -- Graph Subcolorings: Complexity and Algorithms -- Approximation of Pathwidth of Outerplanar Graphs -- On the Monotonicity of Games Generated by Symmetric Submodular Functions -- Multiple Hotlink Assignment -- Small k-Dominating Sets in Planar Graphs with Applications -- Lower Bounds for Algorithms for the Steiner Tree Problem -- log n-Approximative NLCk-Decomposition in O(n 2k+1) Time -- On Subfamilies of AT-Free Graphs -- Complexity of Coloring Graphs without Forbidden Induced Subgraphs -- On Stable Cutsets in Line Graphs -- On Strong Menger-Connectivity of Star Graphs -- The Complexity of the Matching-Cut Problem -- De Bruijn Graphs and DNA Graphs -- A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness -- Critical and Anticritical Edges in Perfect Graphs.This book constitutes the thoroughly refereed post-workshop proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2001, held in Boltenhagen, Germany, in June 2001. The 27 revised full papers presented together with two invited contributions were carefully reviewed and selected from numerous submissions. The papers provide a wealth of new results for various classes of graphs, graph computations, graph algorithms and graph-theoretical applications in various fields.Lecture Notes in Computer Science,0302-9743 ;2204Computer programmingComputersData structures (Computer science)AlgorithmsComputer science—MathematicsProgramming Techniqueshttps://scigraph.springernature.com/ontologies/product-market-codes/I14010Theory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Data Structures and Information Theoryhttps://scigraph.springernature.com/ontologies/product-market-codes/I15009Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Discrete Mathematics in Computer Sciencehttps://scigraph.springernature.com/ontologies/product-market-codes/I17028Data Structureshttps://scigraph.springernature.com/ontologies/product-market-codes/I15017Computer programming.Computers.Data structures (Computer science)Algorithms.Computer science—Mathematics.Programming Techniques.Theory of Computation.Data Structures and Information Theory.Algorithm Analysis and Problem Complexity.Discrete Mathematics in Computer Science.Data Structures.004.015115Brandstädt Andreasedthttp://id.loc.gov/vocabulary/relators/edtLe Van Bangedthttp://id.loc.gov/vocabulary/relators/edtMiAaPQMiAaPQMiAaPQBOOK9910767577903321Graph-Theoretic Concepts in Computer Science2569248UNINA