计算与组合数学 Computing and combinatorics

Invited Lectures
　The Assembly of the Human and Mouse Cenomes
　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
……
Radio Networks
Automata nad Formal Languages
Internet Networks
Computational Geometry I
Computational Biology and Learnign Theory II
Discrete Algorithms II
Computational Geometry II
Combinatorial Optimization
Complexity II
Quantum Computing
Author Index