Computing and combinatorics : 8th annual international conference, COCOON 2002, Singapore, August 15-17, 2002 : proceedings
Guardat en:
| Autor corporatiu: | |
|---|---|
| Altres autors: | , |
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Col·lecció: | Lecture notes in computer science
2387 |
| Matèries: | |
| Accés en línia: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Computing and combinatorics, 8th annual international conference, COCOON 2002, Singapore, August 15-17, 2002, proceedings, Oscar H. Ibarra, Louxin Zhang (eds.), Berlin, Springer, 2002, 1 volume (xiii-606 pages), Lecture notes in computer science, 3-540-43996-X • Computing and Combinatorics, Texte imprimé, 9783662194058 |
| LEADER | 06579nam a22004217a 4500 | ||
|---|---|---|---|
| 001 | 972872 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155231405 | ||
| 020 | |a 9783540456551 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a Annual International Conference on Computing and Combinatorics |n (08 |d :2002 |c :Singapour). | |
| 245 | 1 | 0 | |a Computing and combinatorics : |b 8th annual international conference, COCOON 2002, Singapore, August 15-17, 2002 : proceedings |c [edited by] Oscar H. Ibarra, Louxin Zhang. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 2387 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Invited 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 MutualExclusion 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 -- CountingSatisfying 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. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 650 | |a Informatique | ||
| 650 | |a Algorithmes | ||
| 650 | |a Réseaux d'ordinateurs | ||
| 650 | |a Analyse combinatoire | ||
| 650 | |a Structures de données (informatique) | ||
| 650 | |a Fichiers (informatique) |x Organisation | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Ibarra, Oscar H., |d 1941- |4 pbd | |
| 700 | 1 | |a Zhang, Louxin. |4 pbd | |
| 776 | 0 | |0 069530572 |t Computing and combinatorics |o 8th annual international conference, COCOON 2002, Singapore, August 15-17, 2002 |o proceedings |f Oscar H. Ibarra, Louxin Zhang (eds.) |c Berlin |n Springer |d 2002 |p 1 volume (xiii-606 pages) |s Lecture notes in computer science |z 3-540-43996-X | |
| 776 | 0 | |t Computing and Combinatorics |b Texte imprimé |z 9783662194058 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-45655-4 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-8M1Q6WMS-4 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750632119 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-45655-4 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:753988593 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-45655-4 |z Accès INSA CVL | |
| 997 | |0 972872 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||