{"entities":{"Q1331631":{"pageid":1342381,"ns":120,"title":"Item:Q1331631","lastrevid":68488497,"modified":"2026-04-13T00:01:58Z","type":"item","id":"Q1331631","labels":{"en":{"language":"en","value":"Algorithms and computation. 5th international symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994. Proceedings"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 623727"}},"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":"Q1331631$A37BEEB6-4FE2-420E-AB2A-D1801A36FCE0","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"11dd8e69df60925c5156cac00d1d6790003c474e","datavalue":{"value":{"text":"Algorithms and computation. 5th international symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994. Proceedings","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1331631$95E7BE05-9C45-46BB-B4B3-646A90F22C0B","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"2489f12773994ea8c8407a31f890eb519ebd53c3","datavalue":{"value":"0856.00036","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1331631$45DD10F0-FF2B-4361-9559-203F90BF0C47","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"b684edd658d0a6b1c773d47ac47a5c904ae66855","datavalue":{"value":"10.1007/3-540-58325-4","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1331631$01DB2AA8-CB5B-4FB9-B158-567E37F1BCFE","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":"Q1331631$997B4A13-1860-49F9-A231-5E31DFC4446C","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"a0a675714777b74f112b367c49e47e38623049da","datavalue":{"value":{"time":"+1994-08-23T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1331631$E6C000F6-96E6-40AC-B04A-3FFDEA43749F","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"eb7499c169718317daeeb825b02e3e3a97a91ea2","datavalue":{"value":"The articles of this volume will be reviewed individually. The 4th symposium (1993) has been reviewed (see Zbl 0856.00042 and Zbl 0851.00081).  Indexed articles:  \\textit{Wu, Wen-tsun}, Polynomial equations-solving and its applications, 1-9 [Zbl 0953.01500]  \\textit{Klein, Rolf; Lingas, Andrzej}, Hamiltonian abstract Voronoi diagrams in linear time, 11-19 [Zbl 0953.68604]  \\textit{Bose, Prosenjit; Houle, Michael E.; Toussaint, Godfried}, Every set of disjoint line segments admits a binary tree, 20-28 [Zbl 0953.68602]  \\textit{Iwano, Kazuo; Raghavan, Prabhakar; Tamaki, Hisao}, The traveling cameraman problem, with applications to automatic optical inspection, 29-37 [Zbl 0953.68614]  \\textit{Akutsu, Tatsuya}, On determining the congruity of point sets in higher dimensions, 38-46 [Zbl 0953.68606]  \\textit{Book, Ronald V.; Watanabe, Osamu}, On random hard sets for NP, 47-55 [Zbl 0953.68544]  \\textit{Hemaspaandra, Lane A.; Naik, Ashish V.; Ogihara, Mitsunori; Selman, Alan L.}, Computing solutions uniquely collapses the polynomial hierarchy, 56-64 [Zbl 0953.68541]  \\textit{Santha, Miklos; Tan, Sovanna}, Verifying the determinant in parallel, 65-73 [Zbl 0953.68559]  \\textit{Lin, Chih-Long}, Hardness of approximating graph transformation problem, 74-82 [Zbl 0953.68542]  \\textit{Panconesi, Alessandro; Papatriantafilou, Marina; Tsigas, Philippas; Vit\u00e1nyi, Paul}, Randomized wait-free naming, 83-91 [Zbl 0953.68573]  \\textit{Jennings, Esther; Moty\u010dkov\u00e1, Lenka}, Distributed algorithms for finding small cycle covers in arbitrary networks, 110-118 [Zbl 0953.68641]  \\textit{Zhang, Xiang-sun; Zhu, Hui-can}, A neural network model for quadratic programming with simple upper and lower bounds and its application to linear programming, 119-127 [Zbl 0953.90562]  \\textit{Zhu, Daming; Ma, Shaohan; Qiu, Hongze}, Analysis of the convergency of topology preserving neural networks on learning, 128-136 [Zbl 0953.68588]  \\textit{Arvind, V.; K\u00f6bler, J.; Schuler, R.}, On helping and interactive proof systems, 137-145 [Zbl 0953.68554]  \\textit{Gu, Jun; Gu, Qian-Ping}, Average time complexity of the SAT1. 2 algorithm, 146-154 [Zbl 0953.68552]  \\textit{Chen, Jingsen}, Average cost to produce partial orders, 155-163 [Zbl 0953.68528]  \\textit{Li, Daxing; Ma, Shaohan}, Two notes on low-density subset sum algorithms, 164-171 [Zbl 0953.68558]  \\textit{Cai, Jin-Yi; Hirsch, Michael D.}, Rotation distance, triangulations of planar surfaces and hyperbolic geometry, 172-180 [Zbl 0953.68611]  \\textit{Chen, Yongmao; Smith, Terence R.}, Finitely representable spatial objects and efficient computation, 181-189 [Zbl 0953.68530]  \\textit{Nagamochi, Hiroshi; Nishimura, Kazuhiro; Ibaraki, Toshihide}, Computing all small cuts in undirected networks, 190-198 [Zbl 0953.68578]  \\textit{Zhou, Xiao; Nishizeki, Takao}, Edge-coloring and \\(f\\)-coloring for various classes of graphs, 199-207 [Zbl 0953.05500]  \\textit{Gopalakrishnan, C. P.; Rangan, C. Pandu}, Edge-disjoint paths in permutation graphs, 208-216 [Zbl 0953.05502]  \\textit{Taoka, Satoshi; Watanabe, Toshimasa}, Minimum augmentation to \\(k\\)-edge-connect specified vertices of a graph, 217-225 [Zbl 0953.05503]  \\textit{Srivastav, Anand; Stangier, Peter}, Algorithmic Chernoff-Hoeffding inequalities in integer programming, 226-233 [Zbl 0953.90559]  \\textit{Takaoka, Tadao}, Approximate pattern matching with samples, 234-242 [Zbl 0953.68551]  \\textit{Lin, Xuemin; Orlowska, Maria E.}, An efficient optimal algorithm for minimizing the overall communication cost in replicated data management, 243-251 [Zbl 0953.68531]  \\textit{Gu, Jun}, Multispace search: A new optimization approach, 252-260 [Zbl 0953.68596]  \\textit{Arikati, Srinivasa; Maheshwari, Anil}, Realizing degree sequences in parallel, 261-269 [Zbl 0953.05509]  \\textit{Kavvadias, Dimitris; Pantziou, Grammati E.; Spirakis, Paul G.; Zaroliagis, Christos D.}, Efficient sequential and parallel algorithms for the negative cycle problem, 270-278 [Zbl 0953.05507]  \\textit{Chen, Danny Z.; Hu, Xiaobo}, Fast and efficient operations on parallel priority queues, 279-287 [Zbl 0953.68522]  \\textit{Carlsson, Svante; Chen, Jingsen; Mattsson, Christer}, Heaps with bits, 288-296 [Zbl 0953.68524]  \\textit{von zur Gathen, Joachim; Shparlinski, Igor}, Components and projections of curves over finite fields, 297-305 [Zbl 0953.14501]  \\textit{Middendorf, Martin}, On the approximation of finding various minimal, maximal, and consistent sequences, 306-314 [Zbl 0953.68635]  \\textit{Nakanishi, Michio; Hasidume, Morio; Ito, Minoru; Hashimoto, Akihiro}, A linear-time algorithm for computing characteristic strings, 315-323 [Zbl 0953.68632]  \\textit{Makino, Kazuhisa; Ibaraki, Toshihide}, The maximum latency and identification of positive Boolean functions, 324-332 [Zbl 0953.94503]  \\textit{Kaufmann, Michael; Lauer, Harald; Schr\u00f6der, Heiko}, Fast deterministic hot-potato routing on processor arrays, 333-341 [Zbl 0953.68507]  \\textit{Gu, Qian-Ping; Peng, Shietung}, \\(k\\)-pairwise cluster fault tolerant routing in hypercubes, 342-350 [Zbl 0953.68500]  \\textit{Kaufmann, Michael; Gao, Shaodi; Thulasiraman, K.}, On Steiner minimal trees in grid graphs and its application to VLSI routing, 351-359 [Zbl 0953.68579]  \\textit{Shen, Xiaojun; Hu, Qing; Dai, Hao; Wang, Xiangzu}, Optimal routing of permutations on rings, 360-368 [Zbl 0953.68508]  \\textit{Ambos-Spies, Klaus; Terwijn, Sebastiaan A.; Zheng, Xizhong}, Resource bounded randomness and weakly complete problems, 369-377 [Zbl 0953.68546]  \\textit{Krishnan, Sriram C.; Puri, Anuj; Brayton, Robert K.}, Deterministic \\(\\omega\\) automata vis-a-vis deterministic B\u00fcchi automata, 378-386 [Zbl 0953.68563]  \\textit{Mihara, Takashi; Nishino, Tetsuro}, Quantum computation and NP-complete problems, 387-395 [Zbl 0953.68545]  \\textit{Fortnow, Lance; Rogers, John}, Separability and one-way functions, 396-404 [Zbl 0953.68547]  \\textit{Akutsu, Tatsuya; Halld\u00f3rsson, Magn\u00fas M.}, On the approximation of largest common subtrees and largest common point sets, 405-413 [Zbl 0953.68555]  \\textit{Jiang, Tao; Wang, Lusheng}, An approximation scheme for some Steiner tree problems in the plane, 414-422 [Zbl 0953.68576]  \\textit{Yang, Bo-Ting; Xu, Yin-Feng; You, Zhao-Yong}, A chain decomposition algorithm for the proof of a property on minimum weight triangulations, 423-427 [Zbl 0953.68613]  \\textit{Ding, Jiyu}, The generating algorithm for quasi-full Steiner trees, 428-432 [Zbl 0953.68584]  \\textit{Hui, Lucas Chi Kwong; Martel, Charles U.}, Analysing deletions in competitive self-adjusting linear list algorithms, 433-441 [Zbl 0953.68633]  \\textit{Abuaiadh, Diab; Kingston, Jeffrey H.}, Are Fibonacci heaps optimal?, 442-450 [Zbl 0953.68521]  \\textit{Kao, Ming-Yang; Teng, Shang-Hua}, Simple and efficient graph compression schemes for dense and complement graphs, 451-459 [Zbl 0953.68583]  \\textit{Subramanian, C. R.}, Improved algorithms for coloring random graphs, 460-468 [Zbl 0953.05508]  \\textit{Ibarra, Oscar H.; Tr\u00e2n, Nicholas Q.}, On the parallel complexity of solving recurrence equations, 469-477 [Zbl 0953.68639]  \\textit{Iwamoto, Chuzo; Iwama, Kazuo}, Extended graph connectivity and its gradually increasing parallel complexity, 478-486 [Zbl 0953.68553]  \\textit{Metaxas, Panagiotis T.; Pantziou, Grammati E.; Symvonis, Antonis}, Parallel h-v drawings of binary trees, 487-495 [Zbl 0953.68609]  \\textit{Hsieh, Sun-Yuan; Ho, Chin-Wen}, An efficient parallel strategy for recognizing series-parallel graphs, 496-504 [Zbl 0953.68577]  \\textit{Tokuyama, Takeshi}, Orthogonal queries in segments and triangles, 505-513 [Zbl 0953.68525]  \\textit{Zhu, Binhai}, Further computational geometry in secondary memory, 514-522 [Zbl 0953.68603]  \\textit{Tan, Xuehou; Hirata, Tomio}, Shortest safari routes in simple polygons, 523-531 [Zbl 0953.68612]  \\textit{Chin, Francis Y.; Wang, Cao An}, On greedy tetrahedralization of points in 3D, 532-540 [Zbl 0953.68607]  \\textit{Fujiyoshi, Kunihiro; Kajitani, Yoji; Niitsu, Hiroshi}, The totally-perfect bipartite graph and its construction, 541-549 [Zbl 0953.68585]  \\textit{Tsai, K. H.; Lee, D. T.}, \\(k\\) best cuts for circular-arc graphs, 550-558 [Zbl 0953.68605]  \\textit{Chen, Lin}, Revisiting circular arc graphs, 559-566 [Zbl 0953.68582]  \\textit{Pandu Rangan, C.; Chang, Maw-Shang}, Weighted irredundance of interval graphs, 567-574 [Zbl 0953.05511]  \\textit{Tani, Seiichiro; Imai, Hiroshi}, A reordering operation for an ordered binary decision diagram and an extended framework for combinatorics of graphs, 575-583 [Zbl 0953.68586]  \\textit{Hosaka, Kazuhisa; Takenaga, Yasuhiko; Yajima, Shuzo}, On the size of ordered binary decision diagrams representing threshold functions, 584-592 [Zbl 0953.68580]  \\textit{Li, Hong-Zhou; Li, Guan-Ying}, Nonuniform lowness and strong nonuniform lowness, 593-599 [Zbl 0953.68543]  \\textit{Biehl, Ingrid}, Definition and existence of super complexity cores, 600-606 [Zbl 0953.68562]  \\textit{Young, Gilbert H.; Chan, Chi-Lok}, Efficient algorithms for assigning chain-like tasks on a chain-like network computer, 607-615 [Zbl 0953.68511]  \\textit{Lau, Hoong Chuin}, Manpower scheduling with shift change constraints, 616-624 [Zbl 0953.90516]  \\textit{Xu, Ying; Gabow, Harold N.}, Fast algorithms for transversal matroid intersection problems, 625-633 [Zbl 0953.68634]  \\textit{Deng, Xiaotie}, A convex hull algorithm on coarse-grained multiprocessors, 634-642 [Zbl 0953.68601]  \\textit{Lee, De-Lei; Batcher, Kenneth E.}, A multiway merging network, 643-651 [Zbl 0953.68526]  \\textit{Asano, Tetsuo}, Reporting and counting intersections of lines within a polygon, 652-659 [Zbl 0953.68610]  \\textit{Havas, George; Lian, Jin Xian}, A new problem in string searching, 660-668 [Zbl 0953.68527]  \\textit{Sun, Shangzhi; Du, David H. C.; Xue, Guoliang}, Achieving the shortest clock period by inserting the minimum amount of delay, 669-677 [Zbl 0953.94502]  \\textit{Bao, Feng; Igarashi, Yoshihide}, A randomized algorithm to finite automata public key cryptosystem, 678-686 [Zbl 0953.94500]","type":"string"},"datatype":"string"},"type":"statement","id":"Q1331631$A7EFB035-D1EC-4E10-B6D1-B063DD8AFC14","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1331631$AB7D0D2E-230D-49BC-8F26-8201E8879C7C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1331631$01CAAF3A-E522-490A-84AF-AB9A69C556ED","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"05cc62cc135896864a7c3e7a311fb841ab9763bc","datavalue":{"value":"623727","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1331631$14AB3777-77FB-45F2-8F9E-F032D545612E","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"6b4d4dc39d3d2d5b9f074655c2e1cc5dbb044571","datavalue":{"value":"Beijing (P. R. China)","type":"string"},"datatype":"string"},"type":"statement","id":"Q1331631$B97C6605-8178-48BC-A09E-DE595C992CED","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1b165f2c80f889e3c73f8a20cfd816794dd15c80","datavalue":{"value":"Symposium","type":"string"},"datatype":"string"},"type":"statement","id":"Q1331631$6C8005F8-B241-4D79-B15E-C4278FAA8D48","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5c4c4bb5a86a0fdf66f908b603f2f6975f5ef6fc","datavalue":{"value":"Proceedings","type":"string"},"datatype":"string"},"type":"statement","id":"Q1331631$FC1435AB-7310-426A-8802-3FEC89DCD947","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"267c7f49a5f8e80c7540a2b11ca04932ef2be4b2","datavalue":{"value":"ISAAC '94","type":"string"},"datatype":"string"},"type":"statement","id":"Q1331631$DDB84E46-B8B6-42EA-BFE0-44E867BA4443","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8baf804bc4c1172cd32c9cc96b06a8c070f11c0c","datavalue":{"value":"Algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q1331631$2970BC32-D838-4ABF-8093-4A6E72DF00CD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a7733f4707cd6367a6ff84835298a3aa55a9016e","datavalue":{"value":"Computation","type":"string"},"datatype":"string"},"type":"statement","id":"Q1331631$C075729E-B6F7-419D-A7AF-19B7021A15FA","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":"Q1331631$7AFD2B6F-B7AA-43BD-8601-DA2D71F8D0B8","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Algorithms and computation. 5th international symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994. Proceedings","badges":[]}}}}}