Computing and combinatorics : first annual international conference, COCOON'95, Xi'an, China, August 1995 : proceedings /

Saved in:
Bibliographic Details
Meeting name:International Conference on Computing and Combinatorics (1st : 1995 : Sian, China)
Imprint:Berlin ; New York : Springer-Verlag, c1995.
Description:xiii, 654 p.
Series:Lecture notes in computer science 959
Subject:Computer science -- Congresses.
Combinatorial analysis -- Congresses.
Combinatorial analysis.
Computer science.
Conference papers and proceedings.
Format: Print Book
URL for this record:
Hidden Bibliographic Details
Other authors / contributors:Du, Dingzhu.
Li, Ming, 1955 July 16-
ISBN:354060216X (alk. paper)
Notes:Includes bibliographical references and index.
LEADER 09869cam a2200457 a 4500
001 2349446
003 ICU
005 20100202090700.0
008 951018s1995 ge b 101 0 eng u
010 |a  95024802  
020 |a 354060216X (alk. paper) 
035 |a (ICU)BID21290493 
035 |a (OCoLC)32970748 
040 |a DLC  |c DLC  |d OrLoB-B  |d OCoLC 
041 0 |a eng 
050 0 0 |a QA75.5  |b .I5443 1995 
082 0 0 |a 004/.01/5116  |2 20 
111 2 |a International Conference on Computing and Combinatorics  |n (1st :  |d 1995 :  |c Sian, China) 
245 1 0 |a Computing and combinatorics :  |b first annual international conference, COCOON'95, Xi'an, China, August 1995 : proceedings /  |c Ding-Zhu Du, Ming Li (eds.). 
260 |a Berlin ;  |a New York :  |b Springer-Verlag,  |c c1995. 
263 |a 9509 
300 |a xiii, 654 p. 
336 |a text  |b txt  |2 rdacontent  |0 
337 |a unmediated  |b n  |2 rdamedia  |0 
338 |a volume  |b nc  |2 rdacarrier  |0 
440 0 |a Lecture notes in computer science  |v 959 
504 |a Includes bibliographical references and index. 
505 0 0 |t The Complexity of Mean Payoff Games /  |r Uri Zwick and Mike S. Paterson --  |t Approximation of coNP Sets by NP-Complete Sets /  |r Kazuo Iwama and Shuichi Miyazaki --  |t How to Draw a Planar Clustered Graph /  |r Qing-Wen Feng, Robert F. Cohen and Peter Eades --  |t An Efficient Orthogonal Grid Drawing Algorithm for Cubic Graphs /  |r Tiziana Calamoneri and Rossella Petreschi --  |t Constrained Independence System and Triangulations of Planar Point Sets /  |r Siu-Wing Cheng and Yin-Feng Xu --  |t Three Dimensional Weak Visibility: Complexity and Applications /  |r Caoan Wang and Binhai Zhu --  |t Rectangulating Rectilinear Polygons in Parallel /  |r Sung Kwon Kim --  |t Efficient Randomized Incremental Algorithm for the Closest Pair Problem Using Leafary Trees /  |r V. Kamakoti, Kamala Krithivasan and C. Pandu Rangan --  |t Testing Containment of Object-Oriented Conjunctive Queries Is [actual symbol not reproducible] /  |r Edward P. F. Chan and Ron van der Meyden --  |t Computing Infinite Relations Using Finite Expressions: a New Approach to the Safety Issue in Relational Databases /  |r Ruogu Zhang --  |t Set-Term Unification in a Logic Database Language /  |r Seung Jin Lim and Yiu-Kai Ng --  |t Computations with Finite Closure Systems and Implications /  |r Marcel Wild --  |t Maximum Tree-Packing in Time O(n[superscript 5/2]) /  |r Andrzej Lingas --  |t Optimal Algorithms for Finding Connected Components of an Unknown Graph /  |r Weiping Shi and Douglas B. West --  |t The Multi-Weighted Spanning Tree Problem /  |r Joseph L. Ganley, Mordecai J. Golin and Jeffrey S. Salowe --  |t Algorithmic Graph Embeddings /  |r Jianer Chen --  |t Analysis of Quorum-Based Protocols for Distributed (k + 1)-Exclusion /  |r Divyakant Agrawal, Omer Egecioglu and Amr El Abbadi --  |t A Highly Fault-Tolerant Quorum Consensus Method for Managing Replicated Data /  |r Xuemin Lin and Maria E. Orlowska --  |t Constructing Craig Interpolation Formulas /  |r Guoxiang Huang --  |t Currying of Order-Sorted Term Rewriting Systems /  |r Yoshinobu Kawabe and Naohiro Ishii --  |t Stack and Queue Number of 2-Trees /  |r S. Rengarajan and C. E. Veni Madhavan --  |t Shortest Paths in Random Weighted Graphs /  |r Scott K. Walley and Harry H. Tan --  |t Simple Reduction of f-Colorings to Edge-Colorings /  |r Xiao Zhou and Takao Nishizeki --  |t Output-Size Sensitiveness of OBDD Construction Through Maximal Independent Set Problem /  |r Kezuyoshi Hayase, Kumihiko Sadakane and Seiichiro Tani --  |t Small Weight Bases for Hamming Codes /  |r John Tromp, Louxin Zhang and Ying Zhao --  |t Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms /  |r Julien Cassaigne and Juhani Karhumaki --  |t A Construction for Enumerating k-Coloured Motzkin Paths /  |r Elena Barcucci, Alberto Del Lungo, Elisa Pergola and Renzo Pinzani --  |t On Public-Key Cryptosystem Based on Church-Rosser String-Rewriting Systems /  |r Vladimir A. Oleshchuk --  |t Extending the Hong-Kung Model to Memory Hierarchies /  |r John E. Savage --  |t On Log-Time Alternating Turing Machines of Alternating Depth k /  |r Liming Cai and Jianer Chen --  |t New Bound for Affine Resolvable Designs and Its Application to Authentication Codes /  |r Kaoru Kurosawa and Sanpei Kageyama --  |t Dense Packings of 3k(k + 1) + 1 Equal Disks in a Circle for k = 1,2,3,4, and 5 /  |r B. D. Lubachevsky and R. L. Graham --  |t Efficient Parallel Algorithms for Some Tree Layout Problems /  |r J. Diaz, A. Gibbons, G. Pantziou, M. Serna, P. Spirakis and J. Toran --  |t Conservative Algorithms for Parallel and Sequential Integer Sorting /  |r Yijie Han and Xiaojun Shen --  |t An Optimal Algorithm for Proper Learning of Unions of Two Rectangles with Queries /  |r Zhixiang Chen --  |t Disjunctions of Negated Counting Functions Are Efficiently Learnable with Equivalence Queries /  |r Zhixiang Chen --  |t Non-Empty Cross-3-Intersection Theorems of Subsets /  |r Shiquan Wu --  |t Convexity of Minimal Total Dominating Functions in Graphs /  |r Bo Yu --  |t Transformations for Maximal Planar Graphs with Minimum Degree Five /  |r Jean Hardouin Duparc and Philippe Rolland --  |t An Asynchronous Parallel Method for Linear Systems /  |r Zhaoyong You and Chuanglong Wang --  |t On a Kind of Sequence of Polynomials /  |r Xiangde Zhang --  |t Hamiltonian Cycles in 2-Generated Cayley Digraphs of Abelian Groups /  |r Jixiang Meng --  |t Pandiagonal Magic Squares /  |r Cheng-Xu Xu and Zhun-Wei Lu --  |t PFFM and Quasi-Morishima Matrices /  |r Hua Wang and Zhao-yong You --  |t Edge-Face Total Chromatic Number of Outerplanar Graphs with [Delta](G) = 6 /  |r C. F. Chang, J. X. Chang, X. C. Liu, Peter C. B. Lam and J. F. Wang --  |t Sets Computable in Polynomial Time on Average /  |r Rainer Schuler and Tomoyuki Yamakami --  |t Rankable Distributions Do Not Provide Harder Instances Than Uniform Distributions /  |r Jay Belanger and Jie Wang --  |t Transformations That Preserve Malignness of Universal Distributions /  |r Kojiro Kobayashi --  |t Intersection Suffices for Boolean Hierarchy Equivalence /  |r Lane A. Hemaspaandra and Jorg Rothe --  |t A 3/2log 3-Competitive Algorithm for the Counterfeit Coin Problem /  |r Dean Kelley, Peng-Jun Wan and Qifan Yang --  |t Searching Rigid Data Structures /  |r Svante Carlsson and Jingsen Chen --  |t A Better Subgraph of the Minimum Weight Triangulation /  |r Bo-Ting Yang --  |t Sequence Decomposition Method for Computing a Grobner Basis and Its Application to Bivariate Splines /  |r Wen Gao and Baocai Yin --  |t A Broadcasting Algorithm on the Arrangement Graph /  |r Leqiang Bai, Peter M. Yamakawa, Hiroyuki Ebara and Hideo Nakano --  |t A Fast Maximum Finding Algorithm on Broadcast Communication /  |r Shyue-Horng Shiau and Chang-Biau Yang --  |t Broadcasting in General Networks I: Trees /  |r Aditya Shastri --  |t Uni-Directional Alternating Group Graphs /  |r Shyh-Chain Chern, Tai-Ching Tuan and Jung-Sing Jwo --  |t On Separating Proofs of Knowledge from Proofs of Membership of Languages and Its Application to Secure Identification Schemes /  |r Kouichi Sakurai --  |t Compact Location Problems with Budget and Communication Constraints /  |r S. O. Krumke, H. Noltemeier, S. S. Ravi and M. V. Marathe --  |t Minimum Dominating Sets of Intervals on Lines /  |r Siu-Wing Cheng, Michael Kaminski and Shmuel Zaks --  |t Two-Dimensional Pattern Matching on a Dynamic Library of Texts /  |r Y. Choi and T. W. Lam --  |t Structure in Approximation Classes /  |r P. Crescenzi, V. Kann, R. Silvestri and L. Trevisan --  |t Improved Lower Bounds for the Randomized Boppana-Halldorsson Algorithm for MAXCLIQUE /  |r Marcus Peinado --  |t MNP: A Class of NP Optimization Problems /  |r Qi Cheng and Hong Zhu --  |t Semidefinite Programming and Its Applications to NP Problems /  |r Roman Bacik and S. Mahajan --  |t Analysis and Experimentation on List Update Algorithms /  |r Lucas Chi-Kwong Hui and Kwok-Yan Lam --  |t An Exact Branch and Bound Algorithm for the Steiner Problem in Graphs /  |r B. N. Khoury and P. M. Pardalos --  |t A Physical Model for the Satisfiability Problem /  |r Wenqi Huang, Wei Li, Weifeng Lu and Yuping Zhang --  |t An Efficient Algorithm for Local Testability Problem of Finite State Automata /  |r Sam Myo Kim and Robert McNaughton --  |t Scheduling Task-Tree with Additive Scales on Parallel/ Distributed Machines /  |r Xiangdong Yu and Moti Yung --  |t Single-Vehicle Scheduling Problem on a Straight Line with Time Window Constraints /  |r Chi-lok Chan and Gilbert H. Young --  |t An On-Line Algorithm for Some Uniform Processor Scheduling /  |r Rongheng Li and Lijie Shi --  |t An Algebraic Characterization of Tractable Constraints /  |r Peter Jeavons and David Cohen --  |t Limit Property of Unbalanced Development in Economic Network /  |r Jiyu Ding, Chengxiang Qing and Guodong Song --  |t Document Processing, Theory, and Practice /  |r Derick Wood --  |t Matching and Comparing Sequences in Molecular Biology /  |r Tao Jiang --  |t Primal-Dual Schema Based Approximation Algorithms /  |r Vijay V. Vazirani. 
650 0 |a Computer science  |v Congresses.  |0 
650 0 |a Combinatorial analysis  |v Congresses.  |0 
650 7 |a Combinatorial analysis.  |2 fast  |0 
650 7 |a Computer science.  |2 fast  |0 
655 7 |a Conference papers and proceedings.  |2 fast  |0 
700 1 |a Du, Dingzhu.  |0  |1 
700 1 |a Li, Ming,  |d 1955 July 16-  |0  |1 
901 |a ToCBNA 
903 |a HeVa 
929 |a cat 
999 f f |i 5822c934-1b74-5bba-9f3c-7d7f16d3d0ca  |s 89629489-97ea-5223-9a13-74b4d4c8ed7c 
928 |t Library of Congress classification  |a QA75.5.I54430 1995  |l ASR  |c ASR-SciASR  |i 6024078 
927 |t Library of Congress classification  |a QA75.5.I54430 1995  |l ASR  |c ASR-SciASR  |e CRERAR  |b 43783104  |i 4017399