LEADER 07325nam 22008055 450 001 996465563403316 005 20200704004053.0 010 $a3-540-45655-4 024 7 $a10.1007/3-540-45655-4 035 $a(CKB)1000000000211790 035 $a(SSID)ssj0000322169 035 $a(PQKBManifestationID)11277526 035 $a(PQKBTitleCode)TC0000322169 035 $a(PQKBWorkID)10281165 035 $a(PQKB)10008279 035 $a(DE-He213)978-3-540-45655-1 035 $a(MiAaPQ)EBC3071982 035 $a(PPN)155231405 035 $a(EXLCZ)991000000000211790 100 $a20121227d2002 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputing and Combinatorics$b[electronic resource] $e8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002 Proceedings /$fedited by Oscar H. Ibarra, Louxin Zhang 205 $a1st ed. 2002. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2002. 215 $a1 online resource (XIV, 614 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2387 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-43996-X 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Lectures -- The Assembly of the Human and Mouse Genomes -- Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching -- DNA Complementarity and Paradigms of Computing -- Complexity Theory I -- On Higher Arthur-Merlin Classes -- (2 + f(n))-SAT and Its Properties -- On the Minimal Polynomial of a Matrix -- Computable Real Functions of Bounded Variation and Semi-computable Real Numbers -- Discrete Algorithms I -- Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees -- Coloring Algorithms on Subcubic Graphs -- Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs -- Extending the Accommodating Function -- Computational Biology and Learning Theory I -- Inverse Parametric Sequence Alignment -- The Full Steiner Tree Problem in Phylogeny -- Inferring a Union of Halfspaces from Examples -- Dictionary Look-Up within Small Edit Distance -- Coding Theory and Cryptography -- Polynomial Interpolation of the Elliptic Curve and XTR Discrete Logarithm -- Co-orthogonal Codes -- Efficient Power-Sum Systolic Architectures for Public-Key Cryptosystems in GF(2m) -- A Combinatorial Approach to Anonymous Membership Broadcast -- Parallel and Distributed Architectures -- Solving Constraint Satisfaction Problems with DNA Computing -- New Architecture and Algorithms for Degradable VLSI/WSI Arrays -- Cluster: A Fast Tool to Identify Groups of Similar Programs -- Broadcasting in Generalized de Bruijn Digraphs -- Graph Theory -- On the Connected Domination Number of Random Regular Graphs -- On the Number of Minimum Cuts in a Graph -- On Crossing Numbers of 5-Regular Graphs -- Maximum Flows and Critical Vertices in AND/OR Graphs -- Radio Networks -- New Energy-Efficient Permutation Routing Protocol for Single-Hop Radio Networks -- Simple Mutual Exclusion Algorithms Based on Bounded Tickets on the Asynchronous Shared Memory Model -- Time and Energy Optimal List Ranking Algorithms on the k-Channel Broadcast Communication Model -- Energy-Efficient Size Approximation of Radio Networks with No Collision Detection -- Automata and Formal Languages -- A New Class of Symbolic Abstract Neural Nets: Tissue P Systems -- Transducers with Set Output -- Self-assembling Finite Automata -- Repetition Complexity of Words -- Internet Networks -- Using PageRank to Characterize Web Structure -- On Randomized Broadcasting and Gossiping in Radio Networks -- Fast and Dependable Communication in Hyper-rings -- Computational Geometry I -- The On-Line Heilbronn?s Triangle Problem in Three and Four Dimensions -- Algorithms for Normal Curves and Surfaces -- Terrain Polygon Decomposition, with Application to Layered Manufacturing -- Computational Biology and Learning Theory II -- Supertrees by Flipping -- A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays -- Sharpening Occam?s Razor -- Approximating 3D Points with Cylindrical Segments -- Discrete Algorithms II -- Algorithms for the Multicolorings of Partial k-Trees -- A Fault-Tolerant Merge Sorting Algorithm -- 2-Compromise Usability in 1-Dimensional Statistical Databases -- Computational Geometry II -- An Experimental Study and Comparison of Topological Peeling and Topological Walk -- On-Line Maximizing the Number of Items Packed in Variable-Sized Bins -- On-Line Grid-Packing with a Single Active Grid -- Bend Minimization in Orthogonal Drawings Using Integer Programming -- Combinatorial Optimization -- The Conditional Location of a Median Path -- New Results on the k-Truck Problem -- Theory of Equal-Flows in Networks -- Minimum Back-Walk-Free Latency Problem -- Complexity II -- Counting Satisfying Assignments in 2-SAT and 3-SAT -- On the Maximum Number of Irreducible Coverings of an n-Vertex Graph by n ? 3 Cliques -- On Reachability in Graphs with Bounded Independence Number -- On Parameterized Enumeration -- Quantum Computing -- Probabilistic Reversible Automata and Quantum Automata -- Quantum versus Deterministic Counter Automata -- Quantum DNF Learnability Revisited. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2387 606 $aComputers 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aComputer graphics 606 $aComputer communication systems 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aDiscrete Mathematics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29000 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 606 $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022 615 0$aComputers. 615 0$aDiscrete mathematics. 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aComputer graphics. 615 0$aComputer communication systems. 615 14$aTheory of Computation. 615 24$aDiscrete Mathematics. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Graphics. 615 24$aComputer Communication Networks. 676 $a004 702 $aIbarra$b Oscar H$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aZhang$b Louxin$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aCOCOON 2002 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465563403316 996 $aComputing and Combinatorics$9772278 997 $aUNISA