01117nam0 22003013i 450 UBO005291720231121125850.0882430871620150121e19901949||||0itac50 baitaitz01i xxxe z01nPotere giuridico e diritto soggettivoGiuseppe GuarinoRistNapoliJovene1990NapoliLitografia Libero Nicola106 p.24 cmRipr. dell'estr. da: Rassegna di diritto pubblico, n. 3-4, 1949.Diritto costituzionaleFIRRMLC085481IGuarino, Giuseppe <1922-2020>CFIV038490070844849ITIT-0120150121IT-FR0098 Biblioteca Area Giuridico EconomicaFR0098 UBO0052917Biblioteca Area Giuridico Economica 53DSG 01/0247 53VM 0000199685 VM barcode:GIU000242. - Inventario:376VMA 2001042320121204 53Potere giuridico e diritto soggettivo3639484UNICAS01242nam0 22002771i 450 UON0007747220231205102416.83820020107d1934 |0itac50 bafreMA|||| |||||ˆLe ‰droit immobilier marocain et le régime foncier de l'immatriculation (Zone française, Zone spéciale de Tanger, Zone espagnole)Alphonse MénardRabatFelix Moncho1934308 p.25 cmdata inesattaIT-UONSI B Afr4/0285PROPRIETA' AGRARIAMaroccoUONC023584FIMARabatUONL000557333.76TERRENI RURALI / PROPRIETA' AGRARIA21MENARDAlphonseUONV050833499224MonchoUONV258427650ITSOL20240220RICASIBA - SISTEMA BIBLIOTECARIO DI ATENEOUONSIUON00077472SIBA - SISTEMA BIBLIOTECARIO DI ATENEOSI B Afr 4 0285 SI MR 4388 7 0285 data inesattaDroit immobilier marocain et le régime foncier de l'immatriculation (Zone française, Zone spéciale de Tanger, Zone espagnole1299499UNIOR07519nam 22007575 450 991076756450332120200704235031.03-540-30140-210.1007/b100428(CKB)1000000000212547(SSID)ssj0000101106(PQKBManifestationID)11131456(PQKBTitleCode)TC0000101106(PQKBWorkID)10037417(PQKB)10856040(DE-He213)978-3-540-30140-0(MiAaPQ)EBC3088983(PPN)155180878(EXLCZ)99100000000021254720121227d2004 u| 0engurnn|008mamaatxtccrAlgorithms -- ESA 2004 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings /edited by Susanne Albers, Tomasz Radzik1st ed. 2004.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2004.1 online resource (XXXVI, 836 p.) Lecture Notes in Computer Science,0302-9743 ;3221Bibliographic Level Mode of Issuance: Monograph3-540-23025-4 Includes bibliographical references at the end of each chapters and index.Invited Lectures -- A Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing -- Algorithmic Aspects of Web Search Engines -- Design and Analysis Track -- Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects -- Swap and Mismatch Edit Distance -- Path Decomposition Under a New Cost Measure with Applications to Optical Network Design -- Optimal External Memory Planar Point Enclosure -- Maximizing Throughput in Multi-queue Switches -- An Improved Algorithm for CIOQ Switches -- Labeling Smart Dust -- Graph Decomposition Lemmas and Their Role in Metric Embedding Methods -- Modeling Locality: A Probabilistic Analysis of LRU and FWF -- An Algorithm for Computing DNA Walks -- Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems -- Direct Routing: Algorithms and Complexity -- Lower Bounds for Embedding into Distributions over Excluded Minor Graph Families -- A Parameterized Algorithm for Upward Planarity Testing -- Fisher Equilibrium Price with a Class of Concave Utility Functions -- Hardness and Approximation Results for Packing Steiner Trees -- Approximation Hardness of Dominating Set Problems -- Improved Online Algorithms for Buffer Management in QoS Switches -- Time Dependent Multi Scheduling of Multicast -- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems -- The Average Case Analysis of Partition Sorts -- A Fast Distributed Algorithm for Approximating the Maximum Matching -- Extreme Points Under Random Noise -- Fixed Parameter Algorithms for Counting and Deciding Bounded Restrictive List H-Colorings -- On Variable-Sized Multidimensional Packing -- An Inductive Construction for Plane Laman Graphs via Vertex Splitting -- Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems -- On the Evolution of Selfish Routing -- Competitive Online Approximation of the Optimal Search Ratio -- Incremental Algorithms for Facility Location and k-Median -- Dynamic Shannon Coding -- Fractional Covering with Upper Bounds on the Variables: Solving LPs with Negative Entries -- Negotiation-Range Mechanisms: Coalition-Resistant Markets -- Approximation Algorithms for Quickest Spanning Tree Problems -- An Approximation Algorithm for Maximum Triangle Packing -- Approximate Parameterized Matching -- Approximation of Rectangle Stabbing and Interval Stabbing Problems -- Fast 3-Coloring Triangle-Free Planar Graphs -- Approximate Unions of Lines and Minkowski Sums -- Radio Network Clustering from Scratch -- Seeking a Vertex of the Planar Matching Polytope in NC -- Equivalence of Search Capability Among Mobile Guards with Various Visibilities -- Load Balancing in Hypercubic Distributed Hash Tables with Heterogeneous Processors -- On the Stability of Multiple Partner Stable Marriages with Ties -- Flows on Few Paths: Algorithms and Lower Bounds -- Maximum Matchings in Planar Graphs via Gaussian Elimination -- Fast Multipoint Evaluation of Bivariate Polynomials -- On Adaptive Integer Sorting -- Tiling a Polygon with Two Kinds of Rectangles -- On Dynamic Shortest Paths Problems -- Uniform Algorithms for Deterministic Construction of Efficient Dictionaries -- Fast Sparse Matrix Multiplication -- Engineering and Applications Track -- An Experimental Study of Random Knapsack Problems -- Contraction and Treewidth Lower Bounds -- Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks -- Comparing Real Algebraic Numbers of Small Degree -- Code Flexibility and Program Efficiency by Genericity: Improving Cgal ’s Arrangements -- Finding Dominators in Practice -- Data Migration on Parallel Disks -- Classroom Examples of Robustness Problems in Geometric Computations -- Stable Minimum Storage Merging by Symmetric Comparisons -- On Rectangular Cartograms -- Multi-word Atomic Read/Write Registers on Multiprocessor Systems -- Beyond Optimal Play in Two-Person-Zerosum Games -- Solving Geometric Covering Problems by Data Reduction -- Efficient IP Table Lookup via Adaptive Stratified Trees with Selective Reconstructions -- Super Scalar Sample Sort -- Construction of Minimum-Weight Spanners -- A Straight Skeleton Approximating the Medial Axis -- Non-additive Shortest Paths.Lecture Notes in Computer Science,0302-9743 ;3221Software engineeringAlgorithmsNumerical analysisComputer science—MathematicsData structures (Computer science)Computer networksSoftware Engineering/Programming and Operating Systemshttps://scigraph.springernature.com/ontologies/product-market-codes/I14002Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Numeric Computinghttps://scigraph.springernature.com/ontologies/product-market-codes/I1701XDiscrete Mathematics in Computer Sciencehttps://scigraph.springernature.com/ontologies/product-market-codes/I17028Data Structureshttps://scigraph.springernature.com/ontologies/product-market-codes/I15017Computer Communication Networkshttps://scigraph.springernature.com/ontologies/product-market-codes/I13022Software engineering.Algorithms.Numerical analysis.Computer science—Mathematics.Data structures (Computer science)Computer networks.Software Engineering/Programming and Operating Systems.Algorithm Analysis and Problem Complexity.Numeric Computing.Discrete Mathematics in Computer Science.Data Structures.Computer Communication Networks.005.1Albers Susanneedthttp://id.loc.gov/vocabulary/relators/edtRadzik Tomaszedthttp://id.loc.gov/vocabulary/relators/edtBOOK9910767564503321Algorithms -- ESA 20042089156UNINA