The Assembly of the Human and Mouse Genomes | p. 1 |
Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching | p. 2 |
DNA Complementarity and Paradigms of Computing | p. 3 |
On Higher Arthur-Merlin Classes | p. 18 |
(2 + f(n))-SAT and Its Properties | p. 28 |
On the Minimal Polynomial of a Matrix | p. 37 |
Computable Real Functions of Bounded Variation and Semi-computable Real Numbers | p. 47 |
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees | p. 57 |
Coloring Algorithms on Subcubic Graphs | p. 67 |
Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs | p. 77 |
Extending the Accommodating Function | p. 87 |
Inverse Parametric Sequence Alignment | p. 97 |
The Full Steiner Tree Problem in Phylogeny | p. 107 |
Inferring a Union of Halfspaces from Examples | p. 117 |
Dictionary Look-Up within Small Edit Distance | p. 127 |
Polynomial Interpolation of the Elliptic Curve and XTR Discrete Logarithm | p. 137 |
Co-orthogonal Codes | p. 144 |
Efficient Power-Sum Systolic Architectures for Public-Key Cryptosystems in GF(2[superscript m]) | p. 153 |
A Combinatorial Approach to Anonymous Membership Broadcast | p. 162 |
Solving Constraint Satisfaction Problems with DNA Computing | p. 171 |
New Architecture and Algorithms for Degradable VLSI/WSI Arrays | p. 181 |
Cluster: A Fast Tool to Identify Groups of Similar Programs | p. 191 |
Broadcasting in Generalized de Bruijn Digraphs | p. 200 |
On the Connected Domination Number of Random Regular Graphs | p. 210 |
On the Number of Minimum Cuts in a Graph | p. 220 |
On Crossing Numbers of 5-Regular Graphs | p. 230 |
Maximum Flows and Critical Vertices in AND/OR Graphs | p. 238 |
New Energy-Efficient Permutation Routing Protocol for Single-Hop Radio Networks | p. 249 |
Simple Mutual Exclusion Algorithms Based on Bounded Tickets on the Asynchronous Shared Memory Model | p. 259 |
Time and Energy Optimal List Ranking Algorithms on the k-Channel Broadcast Communication Model | p. 269 |
Energy-Efficient Size Approximation of Radio Networks with No Collision Detection | p. 279 |
A New Class of Symbolic Abstract Neural Nets: Tissue P Systems | p. 290 |
Transducers with Set Output | p. 300 |
Self-assembling Finite Automata | p. 310 |
Repetition Complexity of Words | p. 320 |
Using PageRank to Characterize Web Structure | p. 330 |
On Randomized Broadcasting and Gossiping in Radio Networks | p. 340 |
Fast and Dependable Communication in Hyper-rings | p. 350 |
The On-Line Heilbronn's Triangle Problem in Three and Four Dimensions | p. 360 |
Algorithms for Normal Curves and Surfaces | p. 370 |
Terrain Polygon Decomposition, with Application to Layered Manufacturing | p. 381 |
Supertrees by Flipping | p. 391 |
A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays | p. 401 |
Sharpening Occam's Razor | p. 411 |
Approximating 3D Points with Cylindrical Segments | p. 420 |
Algorithms for the Multicolorings of Partial k-Trees | p. 430 |
A Fault-Tolerant Merge Sorting Algorithm | p. 440 |
2-Compromise Usability in 1-Dimensional Statistical Databases | p. 448 |
An Experimental Study and Comparison of Topological Peeling and Topological Walk | p. 456 |
On-Line Maximizing the Number of Items Packed in Variable-Sized Bins | p. 467 |
On-Line Grid-Packing with a Single Active Grid | p. 476 |
Bend Minimization in Orthogonal Drawings Using Integer Programming | p. 484 |
The Conditional Location of a Median Path | p. 494 |
New Results on the k-Truck Problem | p. 504 |
Theory of Equal-Flows in Networks | p. 514 |
Minimum Back-Walk-Free Latency Problem | p. 525 |
Counting Satisfying Assignments in 2-SAT and 3-SAT | p. 535 |
On the Maximum Number of Irreducible Coverings of an n-Vertex Graph by n - 3 Cliques | p. 544 |
On Reachability in Graphs with Bounded Independence Number | p. 554 |
On Parameterized Enumeration | p. 564 |
Probabilistic Reversible Automata and Quantum Automata | p. 574 |
Quantum versus Deterministic Counter Automata | p. 584 |
Quantum DNF Learnability Revisited | p. 595 |
Author Index | p. 605 |
Table of Contents provided by Blackwell. All Rights Reserved. |