{"entities":{"Q1613682":{"pageid":1624422,"ns":120,"title":"Item:Q1613682","lastrevid":72344814,"modified":"2026-04-14T04:16:35Z","type":"item","id":"Q1613682","labels":{"en":{"language":"en","value":"Computing and combinatorics. 8th annual international conference, COCOON 2002, Singapore, August 15--17, 2002. Proceedings"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1793890"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1613682$4721CFB4-DDFC-4679-BC3C-B519715DA4A8","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"c5e8e90a702b65b7b5bcf584c8c9ccaaa3a3dccd","datavalue":{"value":{"text":"Computing and combinatorics. 8th annual international conference, COCOON 2002, Singapore, August 15--17, 2002. Proceedings","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1613682$00A32D0C-7556-4346-AC0C-4EDA1CA354E2","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"07add66156e2c5f7c725f36bc4c6b6a8fe13162c","datavalue":{"value":"0993.00039","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1613682$D65FF27A-E5E0-4B24-9438-908DF9D7ABCB","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"85c07c7737819bff773f78e2590a3bb761fe677b","datavalue":{"value":{"entity-type":"item","numeric-id":162374,"id":"Q162374"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1613682$8DABFCB1-FB13-4C1F-A9A1-949AA75C3B23","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"53fcb96a7cb4f5e8cbd012770cf049a4dffd75df","datavalue":{"value":{"time":"+2002-09-01T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1613682$4328ECD3-E4D5-441E-BC99-9DE999FFF15A","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"a027989229f6254aa0aff658239106ebedd398b4","datavalue":{"value":"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\u00fchl, 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\u00e1ndez-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\u011fecio\u011flu, \u00d6mer}, 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\u00f6der, 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\u0144ski, Tomasz; Kuty\u0142owski, Miros\u0142aw; Zatopia\u0144ski, Jan}, Energy-efficient size approximation of radio networks with no collision detection, 279-289 [Zbl 1077.90513]  \\textit{Mart\u00edn-Vide, C.; Pazos, J.; P\u0103un, G.; Rodr\u00edguez-Pat\u00f3n, 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; \u0160tefankovi\u010d, 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\u00e1ndez-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\u00e1nyi, 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\u0107, Ljiljana; \u0160ir\u00e1\u0148, 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\u00e9}, 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\u00f6f, Vilhelm; Jonsson, Peter; Wahlstr\u00f6m, 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]","type":"string"},"datatype":"string"},"type":"statement","id":"Q1613682$668B7432-3FE2-4B94-9B79-E629020B442B","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1613682$352A107C-187A-4D29-846E-ED1DCEF40CF1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1613682$76D28AB4-CF89-4EA5-B260-0461071E6DCE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"c2375fd4b32d2eb23df347253ca68f523c20922c","datavalue":{"value":"05-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1613682$80E15465-FE67-4C03-B100-6B6C8BC62088","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"e38d92ab59856fc9264000e2ecb8ad469c0ddd53","datavalue":{"value":"1793890","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1613682$62D47702-5C32-41A0-9105-FBDA2F40ED2C","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"013bdaa22dce64380532d826a1223943d34c70cb","datavalue":{"value":"Singapore","type":"string"},"datatype":"string"},"type":"statement","id":"Q1613682$CF820F73-B027-409C-97A6-C7189407D7FB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5c4c4bb5a86a0fdf66f908b603f2f6975f5ef6fc","datavalue":{"value":"Proceedings","type":"string"},"datatype":"string"},"type":"statement","id":"Q1613682$A850619C-D1E0-4557-BC65-543E1BFC8713","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5d83ae477e518ffecea78688f13a2aaaeca13299","datavalue":{"value":"Conference","type":"string"},"datatype":"string"},"type":"statement","id":"Q1613682$518992A3-B042-4CF2-BC4E-000A2504E20F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e9475a285b417e963b84d0c818da9f17fc8c5b16","datavalue":{"value":"COCOON 2002","type":"string"},"datatype":"string"},"type":"statement","id":"Q1613682$01D9E615-F1E1-4711-AAA8-200AF455F8D2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"27f00569034f7cb0041aea0b2e07bb97e1a71a31","datavalue":{"value":"Computing","type":"string"},"datatype":"string"},"type":"statement","id":"Q1613682$8A443574-B9AA-4FCF-A904-1D8F6DDFB0C9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d8c90dadb55fe2b5558cd95a256bf4488e2be4be","datavalue":{"value":"Combinatorics","type":"string"},"datatype":"string"},"type":"statement","id":"Q1613682$223AF6F2-8635-40BC-B914-57DE109B5EF6","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1613682$199AD364-35C1-4351-BA47-D992F7EBF054","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Computing and combinatorics. 8th annual international conference, COCOON 2002, Singapore, August 15--17, 2002. Proceedings","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Computing_and_combinatorics._8th_annual_international_conference,_COCOON_2002,_Singapore,_August_15--17,_2002._Proceedings"}}}}}