Computing and combinatorics. 3rd annual international conference, COCOON '97. Shanghai, China. August 20--22, 1997. Proceedings (Q1363215)

The articles of mathematical interest will be reviewed individually. Indexed articles: \textit{Cai, Jin-Yi; Sivakumar, D.}, Resolution of Hartmanis' conjecture for NL-hard sparse sets, 62-71 [Zbl 0884.68052] \textit{Reischuk, Rüdiger}, Can large fanin circuits perform reliable computations in the presence of noise?, 72-81 [Zbl 0885.94034] \textit{Grolmusz, Vince}, On set systems with restricted intersections modulo a composite number. (Extended abstract), 82-90 [Zbl 0888.05053] \textit{Takenaga, Yasuhiko; Nouzoe, Mitsushi; Yajima, Shuzo}, Size and variable ordering of OBDDs representing threshold functions, 91-100 [Zbl 0898.94020] \textit{Atteson, Kevin}, The performance of neighbor-joining algorithms of phylogeny reconstruction, 101-110 [Zbl 0889.92020] \textit{Berry, Vincent; Gascuel, Olivier}, Inferring evolutionary trees with strong combinatorial evidence, 111-123 [Zbl 0899.92026] \textit{Gąsieniec, Leszek; Jansson, Jesper; Lingas, Andrzej; Östlin, Anna}, On the complexity of computing evolutionary trees, 134-145 [Zbl 0889.92021] \textit{Brattka, Vasco}, Computable invariance, 146-155 [Zbl 0881.03033] \textit{Zhou, Qing}, Subclasses of computable real valued functions, 156-165 [Zbl 0883.03047] \textit{Weihrauch, Klaus; Zheng, Xizhong}, Computability on continuous, lower semi-continuous and upper semi-continuous real functions, 166-175 [Zbl 0883.03046] \textit{Hofmeister, Thomas; Krause, Matthias; Simon, Hans U.}, Contrast-optimal \(k\) out of \(n\) secret sharing schemes in visual cryptography. (Extended abstract), 176-185 [Zbl 0882.94021] \textit{Chua, Seng Kiat; Ling, San}, A Rabin-type scheme based on \(y^2\equiv x^3+bx^2\mod n\), 186-191 [Zbl 0909.94009] \textit{Kao, Ming-Yang; Qi, Junfeng; Tan, Lei}, Optimal bidding algorithms against cheating in multiple-object auctions, 192-201 [Zbl 0878.90022] \textit{Eades, Peter; Lin, Xuemin}, Spring algorithms and symmetry, 202-211 [Zbl 0883.05119] \textit{Kashem, Md. Abul; Zhou, Xiao; Nishizeki, Takao}, Generalized vertex-rankings of partial \(k\)-trees. (Extended abstract), 212-221 [Zbl 0883.05118] \textit{Chen, Lin}, A selected tour of the theory of identification matrices, 222-231 [Zbl 0892.05029] \textit{Sankoff, David; Blanchette, Mathieu}, The median problem for breakpoints in comparative genomics, 251-263 [Zbl 0889.92023] \textit{Kawabe, Yoshinobu; Ishii, Naohiro}, On modularity of completeness in order-sorted term rewriting systems, 331-342 [Zbl 0884.68068] \textit{Su, Kaile; Ding, Decheng; Chen, Huowang}, A three-valued quantificational logic of context, 343-352 [Zbl 0881.03015] \textit{Kobayashi, Yuji; Otto, Friedrich; Séébold, Patrice}, A complete characterization of repetitive morphisms over the two-letter alphabet, 393-402 [Zbl 0884.68073] \textit{Kim, Sam M.}, An algorithm for identifying spliced languages, 403-411 [Zbl 0889.92008] \textit{Hertrampf, Ulrich}, The shapes of trees, 412-421 [Zbl 0884.68074] \textit{Geidmanis, Dainis; Kaņeps, Jānis; Apsītis, Kalvis; Taimiņa, Daina; Calude, Elena}, Tally languages accepted by alternating multitape finite automata, 422-430 [Zbl 0884.68075] \textit{Cai, Pu; Cai, Jin-Yi}, On the 100\% rule of sensitivity analysis in linear programming, 460-469 [Zbl 0898.90087]