Computing and combinatorics : second annual international conference, COCOON '96, Hong Kong, June 17-19, 1996 : proceedings /

Saved in:
Bibliographic Details
Meeting name:International Conference on Computing and Combinatorics (2nd : 1996 : Hong Kong)
Imprint:Berlin ; New York : Springer, c1996.
Description:x, 419 p.
Series:Lecture notes in computer science 1090
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:Cai, Jin-yi, 1961-
Wong, Chak-Kuen, 1938-
ISBN:3540613323 (alk. paper)
Notes:Includes bibliographical references and index.
LEADER 06723cam a2200457 a 4500
001 2489581
003 ICU
005 20030521235200.0
008 960726s1996 gw b 101 0 eng u
010 |a  96021907  
020 |a 3540613323 (alk. paper) 
035 |a (ICU)BID22166767 
035 |a (OCoLC)34742443 
040 |a DLC  |c DLC  |d OrLoB-B  |d OCoLC 
041 0 |a eng 
050 0 0 |a QA75.5  |b .I586 1996 
082 0 0 |a 004  |2 20 
111 2 |a International Conference on Computing and Combinatorics  |n (2nd :  |d 1996 :  |c Hong Kong) 
245 1 0 |a Computing and combinatorics :  |b second annual international conference, COCOON '96, Hong Kong, June 17-19, 1996 : proceedings /  |c Jin-Yi Cai, Chak Kuen Wong, eds. 
260 |a Berlin ;  |a New York :  |b Springer,  |c c1996. 
263 |a 9606 
300 |a x, 419 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 1090 
504 |a Includes bibliographical references and index. 
505 0 0 |t Improved Bounds for On-line Load Balancing /  |r Matthew Andrews, Michel X. Goemans and Lisa Zhang --  |t An O(nlogn)-Average-Time Algorithm for Shortest Networks Under a Given Topology /  |r Guoliang Xue and Ding-Zhu Du --  |t Steiner Problems on Directed Acyclic Graphs /  |r Tsan-Sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang and D. T. Lee --  |t Wormhole Versus Deflection Routing: A Case Study on the Mesh /  |r Efstratios Karaivazoglou, Paul Spirakis and Vassilis Triantafilou --  |t On Sparse Parity Check Matrices /  |r Hanno Lefmann, Pavel Pudlak and Petr Savicky --  |t Finding a Hidden Code by Asking Questions /  |r Zhixiang Chen, Carlos Cunha and Steven Homer --  |t Improved Length Lower Bounds for Reflecting Sequences /  |r H. K. Dai and K. E. Flannery --  |t Combinatorial and Geometric Approaches to Counting Problems on Linear Matroids, Graphic Arrangements, and Partial Orders /  |r Hiroshi Imai, Satoru Iwata, Kyoko Sekine and Kensyu Yoshida --  |t Output-Sensitive Reporting of Disjoint Paths /  |r Giuseppe Di Battista, Roberto Tamassia and Luca Vismara --  |t Rectangular Grid Drawings of Plane Graphs /  |r Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki --  |t Area-Efficient Algorithms for Upward Straight-Line Tree Drawings /  |r Chan-Su Shin, Sung Kwon Kim and Kyung-Yong Chwa --  |t Straight Skeletons for General Polygonal Figures in the Plane /  |r Oswin Aichholzer and Franz Aurenhammer --  |t A Note on Uniform Circuit Lower Bounds for the Counting Hierarchy /  |r Eric Allender --  |t A Note on the Simulation of Exponential Threshold Weights /  |r Thomas Hofmeister --  |t Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions /  |r Vince Grolmusz --  |t Finding Large Planar Subgraphs and Large Subgraphs of a Given Genus /  |r Gruia Calinescu and Cristina G. Fernandes --  |t Efficient Deterministic Algorithms for Embedding Graphs on Books /  |r Farhad Shahrokhi and Weiping Shi --  |t Optimal Bi-Level Augmentation for Selectivity Enhancing Graph Connectivity with Applications /  |r Tsan-sheng Hsu and Ming-Yang Kao --  |t Exact Learning of Subclasses of CDNF Formulas with Membership Queries /  |r Carlos Domingo --  |t Fast Separator Decomposition for Finite-Element Meshes /  |r Shang-Hua Teng --  |t Reduction Algorithms for Constructing Solutions in Graphs with Small Treewidth /  |r Hans L. Bodlaender and Babette de Fluiter --  |t Fast RNC and NC Algorithms for Finding a Maximal Set of Paths with an Application /  |r Ryuhei Uehara, Zhi-Zhong Chen and Xin He --  |t Sparse Suffix Trees /  |r Juha Karkkainen and Esko Ukkonen --  |t Depth-Efficient Threshold Circuits for Multiplication and Symmetric Function Computation /  |r Chi-Hsiang Yeh and Emmanouel A. Varvarigos --  |t A Note on the Self-Witnessing Property of Computational Problems /  |r V. Arvind --  |t The Inverse Satisfiability Problem /  |r Dimitris Kavvadias and Martha Sideri --  |t The Join Can Lower Complexity /  |r Lane A. Hemaspaandra, Zhigen Jiang, Jorg Rothe and Osamu Watanabe --  |t On the Distribution of Eigenvalues of Graphs /  |r Xuerong Yong --  |t On the Difficulty of Designing Good Classifiers /  |r Michelangelo Grigni, Vincent Mirelli and Christos H. Papadimitriou --  |t Approximating Latin Square Extensions /  |r S. Ravi Kumar, Alexander Russell and Ravi Sundaram --  |t Approximating Minimum Keys and Optimal Substructure Screens /  |r Tatsuya Akutsu and Feng Bao --  |t Reductions and Covergence Rates of Average Time /  |r Jay Belanger and Jie Wang --  |t On the Complexity of Computational Problems Associated with Simple Stochastic Games /  |r Akio Yanbe and Kouichi Sakurai --  |t On the Complexity of Commutativity Analysis /  |r Oscar Ibarra, Pedro Diniz and Martin Rinard --  |t Improved Non-approximability Results for Vertex Cover Problems with Density Constraints /  |r Andrea E. F. Clementi and Luca Trevisan --  |t Some Notes on the Nearest Neighbour Interchange Distance /  |r Ming Li, John Tromp and Louxin Zhang --  |t Distributed Computing in Asynchronous Networks with Byzantine Edges /  |r Vasant Shanbhogue and Moti Yung --  |t Weight Biased Leftist Trees and Modified Skip Lists /  |r Seonghun Cho and Sartaj Sahni --  |t Probabilistic Analysis of Local Search and NP-Completeness Result for Constraint Satisfaction /  |r Hoong Chuin Lau --  |t On the Reconfiguration of Chains /  |r Sue Whitesides and Naixun Pei --  |t Two-Guarding a Rectilinear Polygon /  |r Xuehou Tan and Binhai Zhu --  |t Three Systems for Shared Generation of Authenticators /  |r R. Safavi-Naini --  |t Efficient Generation of Elliptic Curve Cryptosystems /  |r Kwok-Yan Lam, San Ling and Lucas C.-K. Hui --  |t Superconnectivity for Minimal Multi-loop Networks /  |r Jixiang Meng. 
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 Cai, Jin-yi,  |d 1961-  |0  |1 
700 1 |a Wong, Chak-Kuen,  |d 1938-  |0  |1 
901 |a ToCBNA 
903 |a HeVa 
929 |a cat 
999 f f |i 1bf8adad-9346-5931-9efd-e7f660203606  |s 98d96dbc-8627-5bb3-bac6-ccc72ae314d6 
928 |t Library of Congress classification  |a QA75.5.I5860 1996  |l ASR  |c ASR-SciASR  |i 2988479 
927 |t Library of Congress classification  |a QA75.5.I5860 1996  |l ASR  |c ASR-SciASR  |e CRERAR  |b 45693572  |i 4659765