LEADER 00904nam0-2200313---450- 001 990000031210403321 005 20090306101018.0 035 $a000003121 035 $aFED01000003121 035 $a(Aleph)000003121FED01 035 $a000003121 100 $a20090306d1956----km-y0itay50------ba 101 0 $aeng 102 $aUS 105 $ay-------001yy 200 1 $aAluminium in modern architecture$f[by John Peter, Paul Weidlinger] 210 $aLouisville$cReynolds metals company$d1956 215 $a2 v.$d23 cm 327 1 $a1.: [Buildings] / by John Peter$a2.: [Architectural engineering] / by Paul Weidlinger 676 $a720 700 1$aPeter,$bJohn 701 1$aWeidlinger,$bPaul 801 0$aIT$bUNINA$gRICA$2UNIMARC 901 $aBK 912 $a990000031210403321 952 $a13 D 43 16$b22776$fFINBC 952 $a13 D 43 17$b22777$fFINBC 959 $aFINBC 997 $aUNINA LEADER 07642nam 22008775 450 001 9910143626903321 005 20251116234114.0 010 $a3-540-44968-X 024 7 $a10.1007/3-540-44968-X 035 $a(CKB)1000000000211273 035 $a(SSID)ssj0000322167 035 $a(PQKBManifestationID)11233019 035 $a(PQKBTitleCode)TC0000322167 035 $a(PQKBWorkID)10282619 035 $a(PQKB)11737982 035 $a(DE-He213)978-3-540-44968-3 035 $a(MiAaPQ)EBC3072968 035 $a(PPN)155189387 035 $a(BIP)13627330 035 $a(BIP)6527016 035 $a(EXLCZ)991000000000211273 100 $a20121227d2000 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputing and Combinatorics $e6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000 Proceedings /$fedited by Ding-Zhu Du, Peter Eades, Vladimir Estivill-Castro, Xuemin Lin, Arun Sharma 205 $a1st ed. 2000. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2000. 215 $a1 online resource (XII, 478 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1858 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-67787-9 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Talks -- Theoretical Problems Related to the Internet -- Recent Progress and Prospects for Integer Factorisation Algorithms -- Hao Wang Award Paper -- Approximating Uniform Triangular Meshes in Polygons -- The Best Young Researcher Paper -- Maximum Induced Matchings of Random Cubic Graphs -- Computational Geometry 1 -- A Duality between Small-Face Problems in Arrangements of Lines and Heilbronn-Type Problems -- On Local Transformation of Polygons with Visibility Properties -- Graph Drawing -- Embedding Problems for Paths with Direction Constrained Edges -- Characterization of Level Non-planar Graphs by Minimal Patterns -- Rectangular Drawings of Plane Graphs Without Designated Corners -- Computing Optimal Embeddings for Planar Graphs -- Graph Theory and Algorithms 1 -- Approximation Algorithms for Independent Sets in Map Graphs -- Hierarchical Topological Inference on Planar Disc Maps -- Efficient Algorithms for the Minimum Connected Domination on Trapezoid Graphs -- Complexity, Discrete Mathematics, and Number Theory -- Parameterized Complexity of Finding Subgraphs with Hereditary Properties -- Some Results on Tries with Adaptive Branching -- Optimal Coding with One Asymmetric Error: Below the Sphere Packing Bound -- Closure Properties of Real Number Classes under Limits and Computable Operators -- Graph Theory and Algorithms 2 -- A Characterization of Graphs with Vertex Cover Six -- On the Monotonicity of Minimum Diameter with Respect to Order and Maximum Out-Degree -- Online Algorithms -- Online Independent Sets -- Two-Dimensional On-Line Bin Packing Problem with Rotatable Items -- Better Bounds on the Accommodating Ratio for the Seat Reservation Problem -- Ordinal On-Line Scheduling on Two Uniform Machines -- Parallel and Distributed Computing -- Agents, Distributed Algorithms, and Stabilization -- A Fast Sorting Algorithm and Its Generalization on Broadcast Communications -- Efficient List Ranking Algorithms on Reconfigurable Mesh -- Computational Geometry 2 -- Tripods Do Not Pack Densely -- An Efficient k Nearest Neighbor Searching Algorithm for a Query Line -- Tetrahedralization of Two Nested Convex Polyhedra -- Efficient Algorithms for Two-Center Problems for a Convex Polygon -- Combinatorial Optimization -- On Computation of Arbitrage for Markets with Friction -- On Some Optimization Problems in Obnoxious Facility Location -- Generating Necklaces and Strings with Forbidden Substrings -- Optimal Labelling of Point Features in the Slider Model -- Data Structures and Computational Biology -- Mappings for Conflict-Free Access of Paths in Elementary Data Structures -- Theory of Trinomial Heaps -- Polyhedral Aspects of the Consecutive Ones Problem -- The Complexity of Physical Mapping with Strict Chimerism -- Learning and Cryptography -- Logical Analysis of Data with Decomposable Structures -- Learning from Approximate Data -- A Combinatorial Approach to Asymmetric Traitor Tracing -- Removing Complexity Assumptions from Concurrent Zero-Knowledge Proofs -- Automata and Quantum Computing -- One-Way Probabilistic Reversible and Quantum One-Counter Automata -- Similarity Enrichment in Image Compression through Weighted Finite Automata -- On the Power of Input-Synchronized Alternating Finite Automata -- Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width Restriction. 330 $aThis book constitutes the refereed proceedings of the 6th Annual International Conference on Computing and Combinatorics, COCOON 2000, held in Sydney, Australia in July 2000.The 44 revised full papers presented together with two invited contributions were carefully reviewed and selected from a total of 81 submissions. The book offers topical sections on computational geometry; graph drawing; graph theory and algorithms; complexity, discrete mathematics, and number theory; online algorithms; parallel and distributed computing; combinatorial optimization; data structures and computational biology; learning and cryptography; and automata and quantum computing. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1858 606 $aComputer programming 606 $aComputers 606 $aApplication software 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aComputer graphics 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aComputer Applications$3https://scigraph.springernature.com/ontologies/product-market-codes/I23001 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 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$aComputer programming. 615 0$aComputers. 615 0$aApplication software. 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aComputer graphics. 615 14$aProgramming Techniques. 615 24$aTheory of Computation. 615 24$aComputer Applications. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Graphics. 676 $a004 702 $aDu$b Ding-Zhu$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aEades$b Peter$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aEstivill-Castro$b Vladimir$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aLin$b Xuemin$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSharma$b Arun$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aCOCOON 2000 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910143626903321 996 $aComputing and Combinatorics$9772278 997 $aUNINA