00808nam 2200253 450 991041315880332120200831095332.0978881528562120200831d2019----u y0engy50 baitaIT 00 <<I >>labirinti della sorveglianza informaticacittadinanza e impegno politico nell'era della trasparenza universaleMatteo F.N. GiglioliBolognail Mulino2019118 p.22 cmPercorsiscienza politicaDiritto alla riservatezza323.44822itaGiglioli,Matteo F.N.7877169910413158803321342.448 GIG 17190bfsBFSLabirinti della sorveglianza informatica1755478UNINA01111nam0 22002891i 450 UON0028865520231205103911.96220070222d1967 |0itac50 baspaES|||| 1||||Estudios sobre Lope de VegaJosé F. MontesinosNueva ediciónSalamanca, [etc.]Anayac1967XVIII, 330 p.24 cm.001UON001764592001 Temas y estudios210 SalamancaAnaya.VEGA CARPIO LOPE FELIX DEUONC041017FIESSalamancaUONL000435860.3Letteratura spagnola. Età aurea, 1516-169921MONTESINOSJosé F.UONV163741386425AnayaUONV268400650ITSOL20240220RICASIBA - SISTEMA BIBLIOTECARIO DI ATENEOUONSIUON00288655SIBA - SISTEMA BIBLIOTECARIO DI ATENEOSI SPA III 0884 SI SP 3348 5 0884 Estudios sobre Lope de Vega1247726UNIOR06536nam 22007335 450 991014490220332120251117003611.03-540-69662-810.1007/3-540-63890-3(CKB)1000000000234767(SSID)ssj0000321211(PQKBManifestationID)11247375(PQKBTitleCode)TC0000321211(PQKBWorkID)10262623(PQKB)10986721(DE-He213)978-3-540-69662-9(PPN)155163949(EXLCZ)99100000000023476720121227d1997 u| 0engurnn#008mamaatxtccrAlgorithms and Computation 8th International Symposium, ISAAC'97, Singapore, December 17-19, 1997, Proceedings. /edited by Hon Wai Leong, Hiroshi Imai, Sanjay Jain1st ed. 1997.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1997.1 online resource (XVII, 435 p.)Lecture Notes in Computer Science,0302-9743 ;1350Bibliographic Level Mode of Issuance: Monograph3-540-63890-3 Solving NP-hard combinatorial problems in the practical sense Invited presentation -- Airline crew-scheduling problem with many irregular flights -- Practical approach to a facility location problem for large-scale logistics -- Hard instance generation for SAT -- Playing tetris on meshes and multi-dimensional Shearsort -- Formulation of the addition-shift-sequence problem and its complexity -- Weighted and unweighted selection algorithms for k sorted sequences -- An adaptive distributed fault-tolerant routing algorithm for the star graph -- Multi-color routing in the undirected hypercube -- Competitive source routing on tori and meshes -- Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs -- Augmenting edge and vertex connectivities simultaneously -- Two-face horn extensions -- Decremental maintenance of reachability in hypergraphs and minimum models of horn formulae -- Algorithmic analysis of multithreaded algorithms -- A characterization of planar graphs by pseudo-line arrangements -- Optimal fault-tolerant broadcasting in trees -- A theoretical framework of hybrid approaches to MAX SAT -- Exponential lower bounds on the size of OBDDs representing integer division -- On-line versus off-line in money-making strategies with brokerage -- Decision-making by hierarchies of discordant agents -- A new efficient off-line anonymous cash scheme -- Approximating unweighted connectivity problems in parallel -- A randomized linear work EREW PRAM algorithm to find a minimum spanning forest -- Efficient parallel algorithms for planar st-graphs -- Peg-solitaire, string rewriting systems and finite automata -- On the size of probabilistic formulae -- Homophonic coding with logarithmic memory size -- Complexity and modeling aspects of mesh refinement into quadrilaterals -- Topology oriented vs. exact arithmetic — Experience in implementing the three-dimensional convex hull algorithm -- The complexity of learning branches and strategies from queries -- Singularities make spatial join scheduling hard -- A faster one-dimensional topological compaction algorithm -- Algorithms for finding optimal disjoint paths around a rectangle -- An algorithm for finding a region with the minimum total L 1 from prescribed terminals -- On defect sets in bipartite graphs (extended abstract) -- Dynamic programming on distance-hereditary graphs -- On the equivalence in complexity among basic problems on bipartite and parity graphs -- All-cavity maximum matchings -- Fast algorithms for computing ?-Skeletons and their relatives -- A branch-and-cut approach for minimum weight triangulation -- An efficient approximation scheme for the subset-sum problem -- Competitive call control in mobile networks -- Generalized swap-with-parent schemes for self-organizing sequential linear lists.This book constitutes the refereed proceedings of the 8th International Symposium on Algorithms and Computation, ISAAC'97, held in Singapore in December 1997. The 42 revised full papers presented were selected from a total of 98 submissions. The scope of the volume spans the whole area of algorithms from discrete mathematics and complexity theory to algorithms design and evaluation in a variety of applicational areas. Among the topics addressed are scheduling and logistics, networking and routing, combinatorial optimization, graph-computations, algorithmic learning, computational geometry, etc.Lecture Notes in Computer Science,0302-9743 ;1350ComputersAlgorithmsComputer science—MathematicsComputer scienceMathematicsNumerical analysisTheory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Discrete Mathematics in Computer Sciencehttps://scigraph.springernature.com/ontologies/product-market-codes/I17028Computation by Abstract Deviceshttps://scigraph.springernature.com/ontologies/product-market-codes/I16013Computational Mathematics and Numerical Analysishttps://scigraph.springernature.com/ontologies/product-market-codes/M1400XNumeric Computinghttps://scigraph.springernature.com/ontologies/product-market-codes/I1701XComputers.Algorithms.Computer science—Mathematics.Computer scienceMathematics.Numerical analysis.Theory of Computation.Algorithm Analysis and Problem Complexity.Discrete Mathematics in Computer Science.Computation by Abstract Devices.Computational Mathematics and Numerical Analysis.Numeric Computing.004.0151Leong Hon Waiedthttp://id.loc.gov/vocabulary/relators/edtImai Hiroshiedthttp://id.loc.gov/vocabulary/relators/edtJaina Sañjayaedthttp://id.loc.gov/vocabulary/relators/edtBOOK9910144902203321Algorithms and Computation771857UNINA