Computing and combinatorics. 8th annual international conference, COCOON 2002, Singapore, August 15--17, 2002. Proceedings (Q1613682)

The articles of mathematical interest will be reviewed individually. The preceding conference (7th, 2001) has been reviewed (see Zbl 0969.00080). Indexed articles: \textit{Myers, Gene}, The assembly of the human and mouse genomes, 1 [Zbl 1077.92506] \textit{Sahni, Sartaj}, Data structures for one-dimensional packet classification using most-specific-rule matching, 2 [Zbl 1077.68621] \textit{Salomaa, Arto}, DNA complementarity and paradigms of computing, 3-17 [Zbl 1077.68030] \textit{Cai, Jin-Yi; Charles, Denis; Pavan, A.; Sengupta, Samik}, On higher Arthur-Merlin classes, 18-27 [Zbl 1077.68649] \textit{Deng, Xiaotie; Lee, C. H.; Zhao, Yunlei; Zhu, Hong}, \((2+f (n))\)-SAT and its properties, 28-36 [Zbl 1077.68650] \textit{Hoang, Thanh Minh; Thierauf, Thomas}, On the minimal polynomial of a matrix, 37-46 [Zbl 1077.68652] \textit{Rettinger, Robert; Zheng, Xizhong; von Braunmühl, Burchard}, Computable real functions of bounded variation and semi-computable real numbers, 47-56 [Zbl 1077.03517] \textit{Lu, Hsueh-I}, Improved compact routing tables for planar networks via orderly spanning trees, 57-66 [Zbl 1077.68733] \textit{Gabow, Harold N.; Skulrattanakulchai, San}, Coloring algorithms on subcubic graphs, 67-76 [Zbl 1077.68726] \textit{Hsieh, Sun-yuan; Ho, Chin-wen; Hsu, Tsan-sheng; Ko, Ming-tat}, Efficient algorithms for the Hamiltonian problem on distance-hereditary graphs, 77-86 [Zbl 1077.68729] \textit{Boyar, Joan; Favrholdt, Lene M.; Larsen, Kim S.; Nielsen, Morten N.}, Extending the accommodating function, 87-96 [Zbl 1077.68816] \textit{Sun, Fangting; Fernández-Baca, David; Yu, Wei}, Inverse parametric sequence alignment, 97-106 [Zbl 1077.68949] \textit{Lu, Chin Lung; Tang, Chuan Yi; Lee, Richard Chia-Tung}, The full Steiner tree problem in phylogeny, 107-116 [Zbl 1077.68732] \textit{Akutsu, Tatsuya; Ott, Sascha}, Inferring a union of halfspaces from examples, 117-126 [Zbl 1077.68662] \textit{Arslan, Abdullah N.; Eğecioğlu, Ömer}, Dictionary look-up within small edit distance, 127-136 [Zbl 1077.68632] \textit{Lange, Tanja; Winterhof, Arne}, Polynomial interpolation of the elliptic curve and XTR discrete logarithm, 137-143 [Zbl 1077.94518] \textit{Grolmusz, Vince}, Co-orthogonal codes, 144-152 [Zbl 1077.94516] \textit{Kim, Nam-Yeun; Lee, Won-Ho; Yoo, Kee-Young}, Efficient power-sum systolic architectures for public-key cryptosystems in \(\text{GF}(2^m)\), 153-161 [Zbl 1077.94517] \textit{Wang, Huaxiong; Pieprzyk, Josef}, A combinatorial approach to anonymous membership broadcast, 162-170 [Zbl 1077.94521] \textit{Dantsin, Evgeny; Wolpert, Alexander}, Solving constraint satisfaction problems with DNA computing, 171-180 [Zbl 1077.68824] \textit{Wu, Jigang; Schröder, Heiko; Thambipillai, Srikanthan}, New architecture and algorithms for degradable VLSI/WSI arrays, 181-190 [Zbl 1077.68959] \textit{Carter, Casey; Tran, Nicholas}, Cluster: A fast tool to identify groups of similar programs, 191-199 [Zbl 1077.68614] \textit{Kikuchi, Yosuke; Osawa, Shingo; Shibata, Yukio}, Broadcasting in generalized de Bruijn digraphs, 200-209 [Zbl 1077.68515] \textit{Duckworth, William; Mans, Bernard}, On the connected domination number of random regular graphs, 210-219 [Zbl 1077.68724] \textit{Chandran, L. Sunil; Ram, L. Shankar}, On the number of minimum cuts in a graph, 220-229 [Zbl 1077.05507] \textit{Chia, G. L.; Gan, C. S.}, On crossing numbers of 5-regular graphs, 230-237 [Zbl 1077.05505] \textit{Desmedt, Yvo; Wang, Yongge}, Maximum flows and critical vertices in AND/OR graphs, 238-248 [Zbl 1077.68723] \textit{Datta, Amitava; Zomaya, Albert Y.}, New energy-efficient permutation routing protocol for single-hop radio networks, 249-258 [Zbl 1077.90512] \textit{Takamura, Masataka; Igarashi, Yoshihide}, Simple mutual exclusion algorithms based on bounded tickets on the asynchronous shared memory model, 259-268 [Zbl 1077.68538] \textit{Nakano, Koji}, Time and energy optimal list ranking algorithms on the \(k\)-channel broadcast communication model, 269-278 [Zbl 1077.68523] \textit{Jurdziński, Tomasz; Kutyłowski, Mirosław; Zatopiański, Jan}, Energy-efficient size approximation of radio networks with no collision detection, 279-289 [Zbl 1077.90513] \textit{Martín-Vide, C.; Pazos, J.; Păun, G.; Rodríguez-Patón, A.}, A new class of symbolic abstract neural nets: tissue P systems, 290-299 [Zbl 1077.68645] \textit{Czyzowicz, Jurek; Fraczak, Wojciech; Pelc, Andrzej}, Transducers with set output, 300-309 [Zbl 1077.68667] \textit{Klein, Andreas; Kutrib, Martin}, Self-assembling finite automata, 310-319 [Zbl 1077.68046] \textit{Ilie, Lucian; Yu, Sheng; Zhang, Kaizhong}, Repetition complexity of words, 320-329 [Zbl 1077.68084] \textit{Pandurangan, Gopal; Raghavan, Prabhakar; Upfal, Eli}, Using PageRank to characterize Web structure, 330-339 [Zbl 1077.68527] \textit{Liu, Ding; Prabhakaran, Manoj}, On randomized broadcasting and gossiping in radio networks, 340-349 [Zbl 1077.90515] \textit{Altman, Tom; Igarashi, Yoshihide; Motegi, Kazuhiro}, Fast and dependable communication in hyper-rings, 350-359 [Zbl 1077.68502] \textit{Barequet, Gill}, The on-line Heilbronn's triangle problem in three and four dimensions, 360-369 [Zbl 1077.52512] \textit{Schaefer, Marcus; Sedgwick, Eric; Štefankovič, Daniel}, Algorithms for normal curves and surfaces, 370-380 [Zbl 1077.68915] \textit{Ilinkin, Ivaylo; Janardan, Ravi; Smid, Michiel}, Terrain polygon decomposition, with application to layered manufacturing, 381-390 [Zbl 1077.68909] \textit{Chen, D.; Eulenstein, O.; Fernández-Baca, David; Sanderson, M.}, Supertrees by flipping, 391-400 [Zbl 1077.92514] \textit{Lam, Tak-Wah; Sadakane, Kunihiko; Sung, Wing-Kin; Yiu, Siu-Ming}, A space and time efficient algorithm for constructing compressed suffix arrays, 401-410 [Zbl 1077.68947] \textit{Li, Ming; Tromp, John; Vitányi, Paul}, Sharpening Occam's razor, 411-419 [Zbl 1077.68664] \textit{Zhu, Binhai}, Approximating 3D points with cylindrical segments, 420-429 [Zbl 1077.68921] \textit{Ito, Takehiro; Nishizeki, Takao; Zhou, Xiao}, Algorithms for the multicolorings of partial \(k\)-trees, 430-439 [Zbl 1077.68730] \textit{Ravikumar, B.}, A fault-tolerant merge sorting algorithm, 440-447 [Zbl 1077.68624] \textit{Branković, Ljiljana; Širáň, Jozef}, 2-compromise usability in 1-dimensional statistical databases, 448-455 [Zbl 1077.68625] \textit{Chen, Danny Z.; Luan, Shuang; Xu, Jinhui}, An experimental study and comparison of topological peeling and topological walk, 456-466 [Zbl 1077.68906] \textit{Epstein, Leah; Favrholdt, Lene M.}, On-line maximizing the number of items packed in variable-sized bins, 467-475 [Zbl 1077.68825] \textit{Fujita, Satoshi}, On-line grid-packing with a single active grid, 476-483 [Zbl 1077.68826] \textit{Mutzel, Petra; Weiskircher, René}, Bend minimization in orthogonal drawings using integer programming, 484-493 [Zbl 1077.68735] \textit{Wang, Biing-Feng; Ku, Shan-Chyun; Hsieh, Yong-Hsian}, The conditional location of a median path, 494-503 [Zbl 1077.90559] \textit{Ma, Weimin; Xu, Yinfeng; You, Jane; Liu, James; Wang, Kanliang}, New results on the \(k\)-truck problem, 504-513 [Zbl 1077.90074] \textit{Srinathan, K.; Goundan, Pranava R.; Ashwin Kumar, M. V. N.; Nandakumar, R.; Pandu Rangan, C.}, Theory of equal-flows in networks, 514-524 [Zbl 1077.90554] \textit{Lin, Yaw-Ling}, Minimum back-walk-free latency problem, 525-534 [Zbl 1077.68731] \textit{Dahllöf, Vilhelm; Jonsson, Peter; Wahlström, Magnus}, Counting satisfying assignments in 2-SAT and 3-SAT, 535-543 [Zbl 1077.68657] \textit{Tomescu, Ioan}, On the maximum number of irreducible coverings of an \(n\)-vertex graph by \(n -3\) cliques, 544-553 [Zbl 1077.05087] \textit{Nickelsen, Arfst; Tantau, Till}, On reachability in graphs with bounded independence number, 554-563 [Zbl 1077.05506] \textit{Fernau, Henning}, On parameterized enumeration, 564-573 [Zbl 1077.68658] \textit{Golovkins, Marats; Kravtsev, Maksim}, Probabilistic reversible automata and quantum automata, 574-583 [Zbl 1077.68043] \textit{Yamasaki, Tomohiro; Kobayashi, Hirotada; Imai, Hiroshi}, Quantum versus deterministic counter automata, 584-594 [Zbl 1077.68672] \textit{Jackson, Jeffrey C.; Tamon, Christino; Yamakami, Tomoyuki}, Quantum DNF learnability revisited, 595-604 [Zbl 1077.68663]