3. COCOON 1997: Shanghai, China

Tao Jiang, D. T. Lee (Eds.): Computing and Combinatorics, Third Annual International Conference, COCOON '97, Shanghai, China, August 20-22, 1997, Proceedings. Lecture Notes in Computer Science 1276 Springer 1997, ISBN 3-540-63357-X BibTeX

@proceedings{DBLP:conf/cocoon/1997,
  editor    = {Tao Jiang and
               D. T. Lee},
  title     = {Computing and Combinatorics, Third Annual International Conference,
               COCOON '97, Shanghai, China, August 20-22, 1997, Proceedings},
  booktitle = {COCOON},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1276},
  year      = {1997},
  isbn      = {3-540-63357-X},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Parallel and Distributed Computing

Sajal K. Das, Maria Cristina Pinotti: Conflict-Free Access to Templates of Trees and Hypercubes in Parallel Memory Systems. 1-10 BibTeX
Danny Krizanc, Louxin Zhang: Many-to-One Packed Routing via Matchings. 11-17 BibTeX
Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan: A Multi-Tree Generating Routing Scheme Using Acyclic Orientations. 18-22 BibTeX

Computational Geometry

Claudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann: An Algorithm for Heilbronn's Problem. 23-31 BibTeX
K. W. Chan, Francis Y. L. Chin: Optimal Multiresolution Polygonal Approximation. 32-41 BibTeX
Wei Chen, Xiaowen Deng, Koichi Wada, Kimio Kawaguchi: Constructing a Strongly Convex Superhull of Points. 42-51 BibTeX
Binhai Zhu: Fast Range Searching with Delaunay Triangulations. 52-61 BibTeX

Complexity

Jin-yi Cai, D. Sivakumar: Resolution of Hartmanis' Conjecture for NL-Hard Sparse Sets. 62-71 BibTeX
Rüdiger Reischuk: Can Large Fanin Circuits Perform Reliable Computations in the Presence of Noise ? 72-81 BibTeX
Vince Grolmusz: On Set Systems with Restricted Intersections Modulo a Composite Number. 82-90 BibTeX
Yasuhiko Takenaga, Mitsushi Nouzoe, Shuzo Yajima: Size and Variable Ordering of OBDDs Representing Treshold Functions. 91-100 BibTeX

Computational Biology I

Kevin Atteson: The Performance of Neighbor-Joining Algorithms of Phylogeny Recronstruction. 101-110 BibTeX
Vincent Berry, Olivier Gascuel: Inferring Evolutionary Trees with Strong Combinatorial Evidence. 111-123 BibTeX
Kenneth Rice, Tandy Warnow: Parsimony is Hard to Beat. 124-133 BibTeX
Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin: On the Complexity of Computing Evolutionary Trees. 134-145 BibTeX

Computability

Vasco Brattka: Computable Invariance. 146-155 BibTeX
Qing Zhou: Subclasses of Coputable Real Valued Functions. 156-165 BibTeX
Klaus Weihrauch, Xizhong Zheng: Computability on Continuou, Lower Semi-continuous and Upper Semi-continuous Real Functions. 166-175 BibTeX

Crytography and Computational Finance

Thomas Hofmeister, Matthias Krause, Hans-Ulrich Simon: Contrast-Optimal k out of n Secret Sharing Schemes in Visual Cryptography. 176-185 BibTeX
Seng Kiat Chua, San Ling: A Rabin-Type Scheme Based on y² equiv x³ + bx² mod n. 186-191 BibTeX
Ming-Yang Kao, Junfeng Qi, Lei Tan: Optimal Bidding Algorithms Against Cheating in Multiple-Object Auctions. 192-201 BibTeX

Graph Algorithms

Peter Eades, Xuemin Lin: Spring Algorithms and Symmetry. 202-211 BibTeX
Abul Kashem, Xiao Zhou, Takao Nishizeki: Generalized Vertex-Rankings of Partial k-trees. 212-221 BibTeX
Lin Chen: A Selected Tour of the Theory of Identification Matrices. 222-231 BibTeX
Y. Daniel Liang, Chin Lung Lu, Chuan Yi Tang: Effincient Domination of Permutation Graphs and Trapezoid Graphs. 232-241 BibTeX

Computational Biology II

Wen-Lian Hsu: On Physical Mapping Algorithms - An Error-Tolerant Test for the Consecutive Ones Property. 242-250 BibTeX
David Sankoff, Mathieu Blanchette: The Median Problem for Breakpoints in Comparative Genomics. 251-264 BibTeX
Kun-Mao Chao: Fast Algorithms for Aligning Sequences with Restricted Affine Gap Penalties. 264-273 BibTeX
Sanzheng Qiao, W. S.-Y. Wang: A Matrix Representation of Polygenetic Trees. 274-283 BibTeX

Algorithms

Sheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Chuan Yi Tang: Edge and Node Searching Problems on Trees. 284-293 BibTeX
Peter Becker: Construction of Nearly Optimal Multiway Trees. 294-303 BibTeX
Kuo-Hui Tsai, Da-Wei Wang: Optimal Algorithms for Circle Partitioning. 304-310 BibTeX
Xuehou Tan, Xiaoyu Song: Hexagonal Routings of Multiterminal Nets. 311-320 BibTeX

Rewriting and Logic

Seung-Jin Ling, Yiu-Kai Ng: Design and Analysis of Parallel Set-Term Unification. 321-330 BibTeX
Yoshinobu Kawabe, Naohiro Ishii: On Modularity of the Completeness in Order-Sorted Term Rewriting Systems. 331-342 BibTeX
Kaile Su, Decheng Ding, Huowang Chen: A Three-Valued Quantificational Logic of Context. 343-352 BibTeX

Algorithms and Applications

Athanassios S. Poulakidas, Ashok Srinivasan, Ömer Egecioglu, Oscar H. Ibarra, Tao Yang: A Compact Storage Scheme for Fast Wavelet-Based Subregion Retrieval. 353-362 BibTeX
Yanchun Zhang, Jitian Xiao, Xiaofang Zhou: A Declustering Algorithm for Minimizing Spatial Join Cost. 363-372 BibTeX
Lusheng Wang, Xiaohua Jia: Fixed Topology Steiner Trees and Spanning Forests with Applications in Network Communications. 373-382 BibTeX
Guoliang Xue: A Branch-and-Bound Algorithm for Computing Node Weighted Steiner Minimum Trees. 383-392 BibTeX

Automata, Languages and Complexity

Yuji Kobayashi, Friedrich Otto, Patrice Séébold: A Complete Characterization of Repetitive Morphisms over the Two-Letter Alphabet. 393-402 BibTeX
Sam M. Kim: An Algorithm for Identifying Spliced Languages. 403-411 BibTeX
Ulrich Hertrampf: The Shapes of Trees. 412-421 BibTeX
Dainis Geidmanis, Janis Kaneps, Kalvis Apsitis, Daina Taimina, Elena Calude: Tally Languages Accepted by Alternating Multitape Finite Automata. 422-430 BibTeX

Parallel and Distrubed Computing II

Yukihiro Iwasaki, Yuka Kajiwara, Koji Obokata, Yoshihide Igarashi: Independent Spanning Trees of Chordal Rings. 431-440 BibTeX
Qing Hu, Yixin Zhang, Xiaojun Shen: Rearrangeable Graphs. 441-450 BibTeX
Ting-Yi Sung, Tung-Yang Ho, Lih-Hsing Hsu: Projective Torus Networks. 451-459 BibTeX

Mathematical Programming and Genetic Algorithms

Pu Cai, Jin-yi Cai: On the 100% Rule of Sensivity Analzsis in Linear Programming. 460-469 BibTeX
Fumihiko Takeuchi, Hiroshi Imai: Enumerating Triangulations for Products of Two Simplices and for Arbitrary Configurations of Points. 470-481 BibTeX
Zhangang Han, Lu Ruqian: Tree Structure Genetic Algorithm with Nourishment Mechanism. 482-491 BibTeX

Parallel and Distributed Computing III

Xingfu Wu: An Approach to Scalability of Parallel Matrix Multiplication Algorithms. 492-501 BibTeX
Hong Liu, Enmin Song, Reza Sotudeh: Limited Acceleration Mechanism for Cell Loss Flow Control in ATM Networks. 502-511 BibTeX
Yonghong Chen, Qiao Li: They are Just Butterflies. 512-513 BibTeX

Invited Lectures

Paul M. B. Vitányi: Mutual Search (abstract). 514 BibTeX
Shang-Hua Teng: Eigenvalues, Eigenvectors, and Graph Partitioning. 515 BibTeX

Corrigenda

Carlos Domingo: Corrigendum: Exact Learning of Subclasses of CDNF Formulars with Membership Queries. 516-520 BibTeX