2. COCOON 1996: Hong Kong
Jin-yi Cai, C. K. Wong (Eds.): Computing and Combinatorics, Second Annual International Conference, COCOON '96, Hong Kong, June 17-19, 1996, Proceedings. Springer 1996 Lecture Notes in Computer Science ISBN 3-540-61332-3
Session 1
- Guoliang Xue, Ding-Zhu Du: O(n log n)-Average-Time Algorithm for Shortest Network under a Given Topology. 11-20
- Tsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang, D. T. Lee: Steiner Problems on Directed Acyclic Graphs. 21-30
- Efstratios Karaivazoglou, Paul G. Spirakis, Vasilis Triantafilou: Wormhole Versus Deflection Routing: A Case Study on the Mesh. 31-40
Session 2
- Hanno Lefmann, Pavel Pudlák, Petr Savický: On Sparse Parity Chack Matrices (Extended Abstract). 41-49
- Hiroshi Imai, Satoru Iwata, Kyoko Sekine, Kensyu Yoshida: Combinatorial and Geometric Approaches to Counting Problems on Linear Matroids, Graphic Arrangements, and Partial Orders. 68-80
Session 3
- Giuseppe Di Battista, Roberto Tamassia, Luca Vismara: Output-Sensitive Reporting of Disjoint Paths (Extended Abstract). 81-91
- Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki: Rectangular Grid Drawings of Plane Graphs. 92-105
- Chan-Su Shin, Sung Kwon Kim, Kyung-Yong Chwa: Area-Efficient Algorithms for Upward Straight-Line Tree Drawings (Extended Abstract). 106-116
- Oswin Aichholzer, Franz Aurenhammer: Straight Skeletons for General Polygonal Figures in the Plane. 117-126
Session 4
- Eric Allender: A Note on Uniform Circuit Lower Bounds for the Counting Hierarchy (Extended Abstract). 127-135
- Thomas Hofmeister: A Note on the Simulation of Exponential Threshold Weights. 136-141
- Vince Grolmusz: Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions (Preliminary Version). 142-151
Session 5
- Gruia Calinescu, Cristina G. Fernandes: Finding Large Planar Subgraphs and Large Subgraphs of a Given Genus. 152-161
- Farhad Shahrokhi, Weiping Shi: Efficient Deterministic Algorithms for Embedding Graphs on Books. 162-168
- Tsan-sheng Hsu, Ming-Yang Kao: Optimal Bi-Level Augmentation for Selectivity Enhancing Graph Connectivity with Applications. 169-178
- Carlos Domingo: Exact Learning of Subclasses of CDNF Formulas with Membership Queries. 179-188
Session 6
- Shang-Hua Teng: Fast Separator Decomposition for Finite Element Meshes. 189-198
- Hans L. Bodlaender, Babette de Fluiter: Reduction Algorithms for Constructing Solutions in Graphs with Small Treewidth. 199-208
- Ryuhei Uehara, Zhi-Zhong Chen, Xin He: Fast RNC and NC Algorithms for Finding a Maximal Set of Paths with an Application. 209-218
Session 7
- Chi-Hsiang Yeh, Emmanouel A. Varvarigos: Depth-Efficient Threshold Circuits for Multiplication and Symmetric Function Computation. 231-240
- Vikraman Arvind: A Note on the Self-Witnessing Property of Computational Problems. 241-249
- Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe: The Join Can Lower Complexity. 260-267
- Xuerong Yong: On the Distribution of Eigenvalues of Graphs. 268-272
Session 8
- Michelangelo Grigni, Vincent Mirelli, Christos H. Papadimitriou: On the Difficulty of Designing Good Classifiers. 273-279
Session 9
- Akio Yanbe, Kouichi Sakurai: On the Complexity of Computational Problems Associated with Simple Stochastic Games (Extended Abstract). 310-322
- Oscar H. Ibarra, Pedro C. Diniz, Martin C. Rinard: On the Complexity of Commutativity Analysis. 323-332
- Andrea E. F. Clementi, Luca Trevisan: Improved Non-approximability Results for Vertex Cover with Density Constraints. 333-342
Session 10
- Ming Li, John Tromp, Louxin Zhang: Some Notes on the Nearest Neighbour Interchange Distance. 343-351
- Vasant Shanbhogue, Moti Yung: Distributed Computing in Asynchronous Networks with Byzantine Edges. 352-360
- Hoong Chuin Lau: Probabilistic Analysis of Local Search and NP-Completeness Result for Constraint Satisfaction (Extended Abstract). 371-380
Session 11
- Reihaneh Safavi-Naini: Three Systems for Shared Generation of Authenticators. 401-410
- Kwok-Yan Lam, San Ling, Lucas Chi Kwong Hui: Efficient Generation of Elliptic Curve Cryptosystems. 411-416
- Jixiang Meng: Superconnectivity for Minimal Multi-loop Networks. 417-419
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T214307 by the dblp team