Ebook: Computing and Combinatorics: Second Annual International Conference, COCOON '96 Hong Kong, June 17–19, 1996 Proceedings

This book constitutes the proceedings of the Second Annual International Conference on Computing and Combinatorics, COCOON '96, held in June 1996 in Hong Kong.
The 44 papers presented in the book in revised version were carefully selected from a total of 82 submissions. They describe state-of-the-art research results from various areas of theoretical computer science, combinatorics related to computing, and experimental analysis of algorithms; computational graph theory, computational geometry, and networking issues are particularly well-presented.

---

This book constitutes the proceedings of the Second Annual International Conference on Computing and Combinatorics, COCOON '96, held in June 1996 in Hong Kong.
The 44 papers presented in the book in revised version were carefully selected from a total of 82 submissions. They describe state-of-the-art research results from various areas of theoretical computer science, combinatorics related to computing, and experimental analysis of algorithms; computational graph theory, computational geometry, and networking issues are particularly well-presented.

---

This book constitutes the proceedings of the Second Annual International Conference on Computing and Combinatorics, COCOON '96, held in June 1996 in Hong Kong.
The 44 papers presented in the book in revised version were carefully selected from a total of 82 submissions. They describe state-of-the-art research results from various areas of theoretical computer science, combinatorics related to computing, and experimental analysis of algorithms; computational graph theory, computational geometry, and networking issues are particularly well-presented.
Content:
Front Matter....Pages -
Improved bounds for on-line load balancing....Pages 1-10
Steiner problems on directed acyclic graphs....Pages 11-20
Wormhole versus deflection routing: A case study on the mesh....Pages 21-30
On sparse parity check matrices (extended abstract)....Pages 31-40
Finding a hidden code by asking questions....Pages 41-49
Improved length lower bounds for reflecting sequences....Pages 50-55
Combinatorial and geometric approaches to counting problems on linear matroids, graphic arrangements, and partial orders....Pages 56-67
Output-sensitive reporting of disjoint paths (extended abstract)....Pages 68-80
Rectangular grid drawings of plane graphs....Pages 81-91
Area-efficient algorithms for upward straight-line tree drawings....Pages 92-105
Straight skeletons for general polygonal figures in the plane....Pages 106-116
A note on uniform circuit lower bounds for the counting hierarchy (extended abstract)....Pages 117-126
A note on the simulation of exponential threshold weights....Pages 127-135
Harmonic analysis, real approximation, and the communication complexity of Boolean functions....Pages 136-141
Finding large planar subgraphs and large subgraphs of a given genus....Pages 142-151
Efficient deterministic algorithms for embedding graphs on books....Pages 152-161
Optimal bi-level augmentation for selective! enhancing graph connectivity with applications....Pages 162-168
Exact learning of subclasses of CDNF formulas with membership queries....Pages 169-178
Fast separator decomposition for finite element meshes....Pages 179-188
Two-guarding a rectilinear polygon....Pages 189-198
Three systems for shared generation of authenticators....Pages 391-400
Efficient generation of elliptic curve cryptosystems....Pages 401-410
Superconnectivity for minimal multi-loop networks....Pages 411-416
Back Matter....Pages 417-419
....Pages -