Abstract is missing.
- Conflict-Free Access to Templates of Trees and Hypercubes in Parallel Memory SystemsSajal K. Das, Maria Cristina Pinotti. 1-10
- Many-to-One Packed Routing via MatchingsDanny Krizanc, Louxin Zhang. 11-17
- A Multi-Tree Generating Routing Scheme Using Acyclic OrientationsFred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan. 18-22
- An Algorithm for Heilbronn s ProblemClaudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann. 23-31
- Optimal Multiresolution Polygonal ApproximationK. W. Chan, Francis Y. L. Chin. 32-41
- Constructing a Strongly Convex Superhull of PointsWei Chen, Xiaowen Deng, Koichi Wada, Kimio Kawaguchi. 42-51
- Fast Range Searching with Delaunay TriangulationsBinhai Zhu. 52-61
- Resolution of Hartmanis Conjecture for NL-Hard Sparse SetsJin-yi Cai, D. Sivakumar. 62-71
- Can Large Fanin Circuits Perform Reliable Computations in the Presence of Noise ?Rüdiger Reischuk. 72-81
- On Set Systems with Restricted Intersections Modulo a Composite NumberVince Grolmusz. 82-90
- Size and Variable Ordering of OBDDs Representing Treshold FunctionsYasuhiko Takenaga, Mitsushi Nouzoe, Shuzo Yajima. 91-100
- The Performance of Neighbor-Joining Algorithms of Phylogeny RecronstructionKevin Atteson. 101-110
- Inferring Evolutionary Trees with Strong Combinatorial EvidenceVincent Berry, Olivier Gascuel. 111-123
- Parsimony is Hard to BeatKenneth Rice, Tandy Warnow. 124-133
- On the Complexity of Computing Evolutionary TreesLeszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin. 134-145
- Computable InvarianceVasco Brattka. 146-155
- Subclasses of Coputable Real Valued FunctionsQing Zhou. 156-165
- Computability on Continuou, Lower Semi-continuous and Upper Semi-continuous Real FunctionsKlaus Weihrauch, Xizhong Zheng. 166-175
- Contrast-Optimal k out of n Secret Sharing Schemes in Visual CryptographyThomas Hofmeister, Matthias Krause, Hans-Ulrich Simon. 176-185
- A Rabin-Type Scheme Based on y:::2::: equiv x:::3::: + bx:::2::: mod nSeng Kiat Chua, San Ling. 186-191
- Optimal Bidding Algorithms Against Cheating in Multiple-Object AuctionsMing-Yang Kao, Junfeng Qi, Lei Tan. 192-201
- Spring Algorithms and SymmetryPeter Eades, Xuemin Lin. 202-211
- Generalized Vertex-Rankings of Partial k-treesAbul Kashem, Xiao Zhou, Takao Nishizeki. 212-221
- A Selected Tour of the Theory of Identification MatricesLin Chen. 222-231
- Effincient Domination of Permutation Graphs and Trapezoid GraphsY. Daniel Liang, Chin Lung Lu, Chuan Yi Tang. 232-241
- On Physical Mapping Algorithms - An Error-Tolerant Test for the Consecutive Ones PropertyWen-Lian Hsu. 242-250
- The Median Problem for Breakpoints in Comparative GenomicsDavid Sankoff, Mathieu Blanchette. 251-264
- Fast Algorithms for Aligning Sequences with Restricted Affine Gap PenaltiesKun-Mao Chao. 264-273
- A Matrix Representation of Polygenetic TreesSanzheng Qiao, W. S.-Y. Wang. 274-283
- Edge and Node Searching Problems on TreesSheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Chuan Yi Tang. 284-293
- Construction of Nearly Optimal Multiway TreesPeter Becker. 294-303
- Optimal Algorithms for Circle PartitioningKuo-Hui Tsai, Da-Wei Wang. 304-310
- Hexagonal Routings of Multiterminal NetsXuehou Tan, Xiaoyu Song. 311-320
- Design and Analysis of Parallel Set-Term UnificationSeung-Jin Ling, Yiu-Kai Ng. 321-330
- On Modularity of the Completeness in Order-Sorted Term Rewriting SystemsYoshinobu Kawabe, Naohiro Ishii. 331-342
- A Three-Valued Quantificational Logic of ContextKaile Su, Decheng Ding, Huowang Chen. 343-352
- A Compact Storage Scheme for Fast Wavelet-Based Subregion RetrievalAthanassios S. Poulakidas, Ashok Srinivasan, Ömer Egecioglu, Oscar H. Ibarra, Tao Yang. 353-362
- A Declustering Algorithm for Minimizing Spatial Join CostYanchun Zhang, Jitian Xiao, Xiaofang Zhou. 363-372
- Fixed Topology Steiner Trees and Spanning Forests with Applications in Network CommunicationsLusheng Wang, Xiaohua Jia. 373-382
- A Branch-and-Bound Algorithm for Computing Node Weighted Steiner Minimum TreesGuoliang Xue. 383-392
- A Complete Characterization of Repetitive Morphisms over the Two-Letter AlphabetYuji Kobayashi, Friedrich Otto, Patrice Séébold. 393-402
- An Algorithm for Identifying Spliced LanguagesSam M. Kim. 403-411
- The Shapes of TreesUlrich Hertrampf. 412-421
- Tally Languages Accepted by Alternating Multitape Finite AutomataDainis Geidmanis, Janis Kaneps, Kalvis Apsitis, Daina Taimina, Elena Calude. 422-430
- Independent Spanning Trees of Chordal RingsYukihiro Iwasaki, Yuka Kajiwara, Koji Obokata, Yoshihide Igarashi. 431-440
- Rearrangeable GraphsQing Hu, Yixin Zhang, Xiaojun Shen. 441-450
- Projective Torus NetworksTing-Yi Sung, Tung-Yang Ho, Lih-Hsing Hsu. 451-459
- On the 100 Rule of Sensivity Analzsis in Linear ProgrammingPu Cai, Jin-yi Cai. 460-469
- Enumerating Triangulations for Products of Two Simplices and for Arbitrary Configurations of PointsFumihiko Takeuchi, Hiroshi Imai. 470-481
- Tree Structure Genetic Algorithm with Nourishment MechanismZhangang Han, Lu Ruqian. 482-491
- An Approach to Scalability of Parallel Matrix Multiplication AlgorithmsXingfu Wu. 492-501
- Limited Acceleration Mechanism for Cell Loss Flow Control in ATM NetworksHong Liu, Enmin Song, Reza Sotudeh. 502-511
- They are Just ButterfliesYonghong Chen, Qiao Li. 512-513
- Mutual Search (abstract)Paul M. B. Vitányi. 514
- Eigenvalues, Eigenvectors, and Graph PartitioningShang-Hua Teng. 515
- Corrigendum: Exact Learning of Subclasses of CDNF Formulars with Membership QueriesCarlos Domingo. 516-520