Computing and combinatorics : 8th annual international conference, COCOON 2002, Singapore, August 15-17, 2002 : proceedings
Guardado en:
| Autor Corporativo: | |
|---|---|
| Otros Autores: | , |
| Formato: | Livre numérique |
| Lenguaje: | Anglais |
| Publicado: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Colección: | Lecture notes in computer science
2387 |
| Materias: | |
| Acceso en línea: | 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 |
Tabla de Contenidos:
- 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.