Table of Contents

• The Assembly of the Human and Mouse GenomesGene Myers. 1 [doi]
• Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule MatchingSartaj Sahni. 2 [doi]
• DNA Complementarity and Paradigms of ComputingArto Salomaa. 3-17 [doi]
• On Higher Arthur-Merlin ClassesJin-yi Cai, Denis Charles, Aduri Pavan, Samik Sengupta. 18-27 [doi]
• (2+ f(n))-SAT and Its PropertiesXiaotie Deng, Chan H. Lee, Yunlei Zhao, Hong Zhu. 28-36 [doi]
• On the Minimal Polynomial of a MatrixThanh Minh Hoang, Thomas Thierauf. 37-46 [doi]
• Burchard von Braunmühl, Computable Real Functions of Bounded Variation and Semi-computable Real NumbersRobert Rettinger, Xizhong Zheng. 47-56 [doi]
• Improved Compact Routing Tables for Planar Networks via Orderly Spanning TreesHsueh-I Lu. 57-66 [doi]
• Coloring Algorithms on Subcubic GraphsHarold N. Gabow, San Skulrattanakulchai. 67-76 [doi]
• Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary GraphsSun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko. 77-86 [doi]
• Extending the Accommodating FunctionJoan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen. 87-96 [doi]
• Inverse Parametric Sequence AlignmentFangting Sun, David Fernández-Baca, Wei Yu. 97-106 [doi]
• The Full Steiner Tree Problem in PhylogenyChin Lung Lu, Chuan Yi Tang, Richard Chia-Tung Lee. 107-116 [doi]
• Inferring a Union of Halfspaces from ExamplesTatsuya Akutsu, Sascha Ott. 117-126 [doi]
• Dictionary Look-Up within Small Edit DistanceAbdullah N. Arslan, Ömer Egecioglu. 127-136 [doi]
• Polynomial Interpolation of the Elliptic Curve and XTR Discrete LogarithmTanja Lange, Arne Winterhof. 137-143 [doi]
• Co-orthogonal CodesVince Grolmusz. 144-152 [doi]
• Efficient Power-Sum Systolic Architectures for Public-Key Cryptosystems in GF(2:::m:::)Nam-Yeun Kim, Won-Ho Lee, Kee-Young Yoo. 153-161 [doi]
• A Combinatorial Approach to Anonymous Membership BroadcastHuaxiong Wang, Josef Pieprzyk. 162-170 [doi]
• Solving Constraint Satisfaction Problems with DNA ComputingEvgeny Dantsin, Alexander Wolpert. 171-180 [doi]
• New Architecture and Algorithms for Degradable VLSI/WSI ArraysWu Jigang, Heiko Schröder, Thambipillai Srikanthan. 181-190 [doi]
• Cluster: A Fast Tool to Identify Groups of Similar ProgramsCasey Carter, Nicholas Tran. 191-199 [doi]
• Broadcasting in Generalized de Bruijn DigraphsYosuke Kikuchi, Shingo Osawa, Yukio Shibata. 200-209 [doi]
• On the Connected Domination Number of Random Regular GraphsWilliam Duckworth, Bernard Mans. 210-219 [doi]
• On the Number of Minimum Cuts in a GraphL. Sunil Chandran, L. Shankar Ram. 220-229 [doi]
• On Crossing Numbers of 5-Regular GraphsGek Ling Chia, C. S. Gan. 230-237 [doi]
• Maximum Flows and Critical Vertices in AND/OR GraphsYvo Desmedt, Yongge Wang. 238-248 [doi]
• New Energy-Efficient Permutation Routing Protocol for Single-Hop Radio NetworksAmitava Datta, Albert Y. Zomaya. 249-258 [doi]
• Simple Mutual Exclusion Algorithms Based on Bounded Tickets on the Asynchronous Shared Memory ModelMasataka Takamura, Yoshihide Igarashi. 259-268 [doi]
• Time and Energy Optimal List Ranking Algorithms on the k -Channel Broadcast Communication ModelKoji Nakano. 269-278 [doi]
• Energy-Efficient Size Approximation of Radio Networks with No Collision DetectionTomasz Jurdzinski, Miroslaw Kutylowski, Jan Zatopianski. 279-289 [doi]
• A New Class of Symbolic Abstract Neural Nets: Tissue P SystemsCarlos Martín-Vide, Juan Pazos, Gheorghe Paun, Alfonso Rodríguez-Patón. 290-299 [doi]
• Transducers with Set OutputJurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc. 300-309 [doi]
• Self-Assembling Finite AutomataAndreas Klein, Martin Kutrib. 310-319 [doi]
• Repetition Complexity of WordsLucian Ilie, Sheng Yu, Kaizhong Zhang. 320-329 [doi]
• Using PageRank to Characterize Web StructureGopal Pandurangan, Prabhakar Raghavan, Eli Upfal. 330-339 [doi]
• On Randomized Broadcasting and Gossiping in Radio NetworksDing Liu, Manoj Prabhakaran. 340-349 [doi]
• Fast and Dependable Communication in Hyper-ringsTom Altman, Yoshihide Igarashi, Kazuhiro Motegi. 350-359 [doi]
• The On-Line Heilbronn s Triangle Problem in Three and Four DimensionsGill Barequet. 360-369 [doi]
• Algorithms for Normal Curves and SurfacesMarcus Schaefer, Eric Sedgwick, Daniel Stefankovic. 370-380 [doi]
• Terrain Polygon Decomposition, with Application to Layered ManufacturingIvaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid. 381-390 [doi]
• Supertrees by FlippingDuhong Chen, Oliver Eulenstein, David Fernández-Baca, Michael Sanderson. 391-400 [doi]
• A Space and Time Efficient Algorithm for Constructing Compressed Suffix ArraysTak Wah Lam, Kunihiko Sadakane, Wing-Kin Sung, Siu-Ming Yiu. 401-410 [doi]
• Sharpening Occam s RazorMing Li, John Tromp, Paul M. B. Vitányi. 411-419 [doi]
• Approximating 3D Points with Cylindrical SegmentsBinhai Zhu. 420-429 [doi]
• Algorithms for the Multicolorings of Partial k-TreesTakehiro Ito, Takao Nishizeki, Xiao Zhou. 430-439 [doi]
• A Fault-Tolerant Merge Sorting AlgorithmBala Ravikumar. 440-447 [doi]
• 2-Compromise Usability in 1-Dimensional Statistical DatabasesLjiljana Brankovic, Jozef Sirán. 448-455 [doi]
• An Experimental Study and Comparison of Topological Peeling and Topological WalkDanny Z. Chen, Shuang Luan, Jinhui Xu. 456-466 [doi]
• On-Line Maximizing the Number of Items Packed in Variable-Sized BinsLeah Epstein, Lene M. Favrholdt. 467-475 [doi]
• On-Line Grid-Packing with a Single Active GridSatoshi Fujita. 476-483 [doi]
• Bend Minimization in Orthogonal Drawings Using Integer ProgrammingPetra Mutzel, René Weiskircher. 484-493 [doi]
• The Conditional Location of a Median PathBiing-Feng Wang, Shan-Chyun Ku, Yong-Hsian Hsieh. 494-503 [doi]
• New Results on the k-Truck ProblemWeimin Ma, Yin-Feng Xu, Jane You, James Liu, Kanliang Wang. 504-513 [doi]
• Theory of Equal-Flows in NetworksK. Srinathan, Pranava R. Goundan, M. V. N. Ashwin Kumar, R. Nandakumar, C. Pandu Rangan. 514-524 [doi]
• Minimum Back-Walk-Free Latency ProblemYaw-Ling Lin. 525-534 [doi]
• Counting Satisfying Assignments in 2-SAT and 3-SATVilhelm Dahllöf, Peter Jonsson, Magnus Wahlström. 535-543 [doi]
• On the Maximum Number of Irreducible Coverings of an n -Vertex Graph by n -3 CliquesIoan Tomescu. 544-553 [doi]
• On Reachability in Graphs with Bounded Independence NumberArfst Nickelsen, Till Tantau. 554-563 [doi]
• On Parameterized EnumerationHenning Fernau. 564-573 [doi]
• Probabilistic Reversible Automata and Quantum AutomataMarats Golovkins, Maksim Kravtsev. 574-583 [doi]
• Quantum versus Deterministic Counter AutomataTomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai. 584-594 [doi]
• Quantum DNF Learnability RevisitedJeffrey C. Jackson, Christino Tamon, Tomoyuki Yamakami. 595-604 [doi]