LEADER 00794nam0-22002891i-450- 001 990005272320403321 005 20060206140307.0 035 $a000527232 035 $aFED01000527232 035 $a(Aleph)000527232FED01 035 $a000527232 100 $a19990604d1975----km-y0itay50------ba 101 1 $aita 105 $ay-------001yy 200 1 $a<>materialismo dialettico$fHenri Lefebvre 210 $aTorino$cEinaudi$d1975 215 $aXIV, 125 p.$d21 cm 225 1 $aReprints Einaudi$v45 676 $a335.4112$v21$zita 700 1$aLefebvre,$bHenri$032295 801 0$aIT$bUNINA$gRICA$2UNIMARC 901 $aBK 912 $a990005272320403321 952 $a335.411 LEF 1$bST.REL. 1179$fFLFBC 959 $aFLFBC 996 $aMaterialismo dialettico$987880 997 $aUNINA LEADER 05860nam 22008535 450 001 9910143860003321 005 20251116234352.0 010 $a3-540-44849-7 024 7 $a10.1007/3-540-44849-7 035 $a(CKB)1000000000212159 035 $a(SSID)ssj0000321200 035 $a(PQKBManifestationID)11231225 035 $a(PQKBTitleCode)TC0000321200 035 $a(PQKBWorkID)10263232 035 $a(PQKB)10458570 035 $a(DE-He213)978-3-540-44849-5 035 $a(MiAaPQ)EBC3072107 035 $a(PPN)155206397 035 $a(BIP)13627234 035 $a(BIP)8681254 035 $a(EXLCZ)991000000000212159 100 $a20121227d2003 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms and Complexity $e5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings /$fby Rosella Petreschi, Giuseppe Persiano, Riccardo Silvestri 205 $a1st ed. 2003. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2003. 215 $a1 online resource (X, 290 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2653 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-40176-8 320 $aIncludes bibliographical references and index. 327 $aTutorials -- Localized Network Representations -- Optimal Binary Search Trees with Costs Depending on the Access Paths -- On the Generation of Extensions of a Partially Ordered Set -- Error-Correcting Codes in Complexity Theory -- Invited Talks -- Cache-Oblivious Algorithms -- Spanning Trees with Low Maximum/Average Stretch -- Hyper Encryption and Everlasting Secrets -- Computing with Electronic Nanotechnologies -- Regular Contribution -- Efficient Update Strategies for Geometric Computing with Uncertainty -- Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete -- An Improved Algorithm for Point Set Pattern Matching under Rigid Motion -- Unlocking the Advantages of Dynamic Service Selection and Pricing -- The Relative Worst Order Ratio for On-Line Algorithms -- On-Line Stream Merging, Max Span, and Min Coverage -- Randomised Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular Graphs -- Additive Spanners for k-Chordal Graphs -- Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation -- Reconciling Gene Trees to a Species Tree -- Generating All Forest Extensions of a Partially Ordered Set -- Indexing Structures for Approximate String Matching -- Approximation Hardness for Small Occurrence Instances of NP-Hard Problems -- Fast Approximation of Minimum Multicast Congestion ? Implementation versus Theory -- Approximation of a Retrieval Problem for Parallel Disks -- On k-Edge-Connectivity Problems with Sharpened Triangle Inequality -- The Complexity of Detecting Fixed-Density Clusters -- Nearly Bounded Error Probabilistic Sets -- Some Properties of MODm Circuits Computing Simple Functions -- XOR-Based Schemes for Fast Parallel IP Lookups -- The Impact of Network Structure on the Stability of Greedy Protocols -- Improving Customer Proximity to Railway Stations -- Differential Approximation for Some Routing Problems. 330 $aThis book constitutes the refereed proceedings of the 5th Italian Conference on Algorithms and Computation, CIAC 2003, held in Rome, Italy in May 2003.The 23 revised full papers presented were carefully reviewed and selected from 57 submissions. Among the topics addressed are complexity, complexity theory, geometric computing, matching, online algorithms, combinatorial optimization, computational graph theory, approximation algorithms, network algorithms, routing, and scheduling. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2653 606 $aLogic, Symbolic and mathematical 606 $aAlgorithms 606 $aData structures (Computer science) 606 $aComputers 606 $aComputer science?Mathematics 606 $aComputer graphics 606 $aMathematical Logic and Foundations$3https://scigraph.springernature.com/ontologies/product-market-codes/M24005 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 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 606 $aComputer Graphics$3https://scigraph.springernature.com/ontologies/product-market-codes/I22013 615 0$aLogic, Symbolic and mathematical. 615 0$aAlgorithms. 615 0$aData structures (Computer science) 615 0$aComputers. 615 0$aComputer science?Mathematics. 615 0$aComputer graphics. 615 14$aMathematical Logic and Foundations. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aData Structures. 615 24$aComputation by Abstract Devices. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Graphics. 676 $a511/.8 700 $aPetreschi$b Rosella$4aut$4http://id.loc.gov/vocabulary/relators/aut$0871316 702 $aPersiano$b Giuseppe$4aut$4http://id.loc.gov/vocabulary/relators/aut 702 $aSilvestri$b Riccardo$4aut$4http://id.loc.gov/vocabulary/relators/aut 712 12$aItalian Conference on Algorithms and Complexity 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910143860003321 996 $aAlgorithms and Complexity$91945102 997 $aUNINA