Computing and combinatorics : third annual international conference, COCOON '97, Shanghai, China, August 20-22, 1997 : proceedings /
Saved in:
| Meeting name: | COCOON (Conference (3rd : 1997 : Shanghai, China) |
|---|---|
| Imprint: | Berlin ; New York : Springer, c1997. |
| Description: | xii, 522 p. |
| Language: | English |
| Series: | Lecture notes in computer science 1276 |
| Subject: | |
| Format: | Print Book |
| URL for this record: | http://pi.lib.uchicago.edu/1001/cat/bib/2751896 |
Table of Contents:
- Conflict-Free Access to Templates of Trees and Hypercubes in Parallel Memory Systems / Sajal K. Das and M. Cristina Pinotti
- Many-to-One Packet Routing via Matchings / Danny Krizanc and Louxin Zhang
- A Multi-tree Generating Routing Scheme Using Acyclic Orientations / Fred S. Annexstein, Kenneth A. Berman and Ram Swaminathan
- An Algorithm for Heilbronn's Problem / Claudia Bertram-Kretzberg, Thomas Hofmeister and Hanno Lefmann
- Optimal Multiresolution Polygonal Approximation / K. W. Chan and Francis Y. L. Chin
- Constructing a Strongly Convex Superhull of Points / Wei Chen, Xiao Wen Deng and Koichi Wada [et al.]
- Fast Range Searching with Delaunay Triangulations / Binhai Zhu
- Resolution of Hartmanis' Conjecture for NL-hard Sparse Sets / Jin-Yi Cai and D. Sivakumar
- Can Large Fanin Circuits Perform Reliable Computations in the Presence of Noise? / Rudiger Reischuk
- On Set Systems with Restricted Intersections Modulo a Composite Number / Vince Grolmusz
- Size and Variable Ordering of OBDDs Representing Threshold Functions / Yasuhiko Takenaga, Mitsushi Nouzoe and Shuzo Yajima
- The Performance of Neighbor-Joining Algorithms of Phylogeny Reconstruction / Kevin Atteson
- Inferring Evolutionary Trees with Strong Combinatorial Evidence / Vincent Berry and Olivier Gascuel
- Parsimony is Hard to Beat / Kenneth Rice and Tandy Warnow
- On the Complexity of Computing Evolutionary Trees / Leszek Gasieniec, Jesper Jansson and Andrzej Lingas [et al.]
- Computable Invariance / Vasco Brattka
- Subclasses of Computable Real Valued Functions / Qing Zhou
- Computability on Continuous, Lower Semi-continuous and Upper Semi-continuous Real Functions / Klaus Weihrauch and Xizhong Zheng
- Contrast-Optimal k out of n Secret Sharing Schemes in Visual Cryptography / Thomas Hofmeister, Matthias Krause and Hans U. Simon
- A Rabin-Type Scheme Based on y[superscript 2][identical with]x[superscript 3]=bx[superscript 2] mod n / Seng Kiat Chua and San Ling
- Optimal Bidding Algorithms Against Cheating in Multiple-Object Auctions / Ming-Yang Kao, Junfeng Qi and Lei Tan
- Spring Algorithms and Symmetry / Peter Eades and Xuemin Lin
- Generalized Vertex-Rankings of Partial k-trees / Md. Abul Kashem, Xiao Zhou and Takao Nishizeki
- A Selected Tour of the Theory of Identification Matrices / Lin Chen
- Efficient Domination on Permutation Graphs and Trapezoid Graphs / Y. Daniel Liang, Chin Lung Lu and Chuan Yi Tang
- On Physical Mapping Algorithms - An Error-Tolerant Test for the Consecutive Ones Property / Wen-Lian Hsu
- The Median Problem for Breakpoints in Comparative Genomics / David Sankoff and Mathieu Blanchette
- Fast Algorithms for Aligning Sequences with Restricted Affine Gap Penalties / Kun-Mao Chao
- A Matrix Representation of Phylogenetic Trees / Sanzheng Qiao and W. S.-Y. Wang
- Edge and Node Searching Problems on Trees / Sheng-Lung Peng, Chin-Wen Ho and Tsan-sheng Hsu [et al.]
- Construction of Nearly Optimal Multiway Trees / Peter Becker
- Optimal Algorithms for Circle Partitioning / Kuo-Hui Tsai and Da-Wei Wang
- Hexagonal Routing of Multiterminal Nets / Xuehou Tan and Xiaoyu Song
- Design and Analysis of Parallel Set-Term Unification / Seung-Jin Lim and Yiu-Kai Ng
- On Modularity of the Completeness in Order-Sorted Term Rewriting Systems / Yoshinobu Kawabe and Naohiro Ishii
- A Three-Valued Quantificational Logic of Context / Kaile Su, Decheng Ding and Huowang Chen
- A Compact Storage Scheme for Fast Wavelet-Based Subregion Retrieval / A. S. Poulakidas, A. Srinivasan and O. Egecioglu [et al.]
- A Declustering Algorithm for Minimizing Spatial Join Cost / Yanchun Zhang, Jitian Xiao and Xiaofang Zhou
- Fixed Topology Steiner Trees and Spanning Forests with Applications in Network Communications / Lusheng Wang and Xiaohua Jia
- A Branch-and-Bound Algorithm for Computing Node Weighted Steiner Minimum Trees / Guoliang Xue
- A Complete Characterization of Repetitive Morphisms over the Two-Letter Alphabet / Yuji Kobayashi, Friedrich Otto and Patrice Seebold
- An Algorithm for Identifying Spliced Languages / Sam M. Kim
- The Shapes of Trees / Ulrich Hertrampf
- Tally Languages Accepted by Alternating Multitape Finite Automata / Dainis Geidmanis, Janis Kaneps and Kalvis Apsitis [et al.]
- Independent Spanning Trees of Chordal Rings / Yukihiro Iwasaki, Yuka Kajiwara and Koji Obokata [et al.]
- Rearrangeable Graphs / Qing Hu, Yixin Zhang and Xiaojun Shen
- Projective Torus Networks / Ting-Yi Sung, Tung-Yang Ho and Lih-Hoing Hsu
- On the 100% Rule of Sensitivity Analysis in Linear Programming / Pu Cai and Jin-Yi Cai
- Enumerating Triangulations for Products of Two Simplices and for Arbitrary Configurations of Points / Fumihiko Takeuchi and Hiroshi Imai
- Tree Structure Genetic Algorithm with a Nourishment Mechanism / Zhangang Han and Ruqiun Lu
- An Approach to Scalability of Parallel Matrix Multiplication Algorithms / Xingfu Wu
- Limited Acceleration Mechanism for Cell Loss Free Flow Control in ATM Networks / Hong Liu, Enmin Song and Reza Sotudeh
- They Are Just Butterflies / Yonghong Chen and Qiao Li
- Mutual Search / Paul Vitanyi
- Eigenvalues, Eigenvectors, and Graph Partitioning / Shang-Hua Teng
- Corrigendum: Exact Learning of Subclasses of CDNF Formulas with Membership Queries / Carlos Domingo.
