Lecture Notes in Computer Science

Second Annual International Conference, COCOON '96, Hong Kong, June 17-19, 1996. Proceedings

By: Jin-Yi Cai (Editor), C.K. Wong (Editor)

Write A Review

Paperback | 5 June 1996

At a Glance

Paperback
440 Pages

Dimensions(cm)
23.39 x 15.6 x 2.26

Paperback

$84.99

or 4 interest-free payments of $21.25 with

Ships in 5 to 7 business days

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.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $89.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

You Can Find This Book In

Non-Fiction Mathematics Combinatorics & Graph Theory Computing & I.T.Computer Science Mathematical Theory of Computation Computer Networking & Communications Mathematical Foundation Mathematical Logic Graphical & Digital Media Applications Computer Hardware Network Hardware

Computer Programming & Software Development Algorithms & Data Structures

Improved Bounds for On-line Load Balancing	p. 1
An O(nlogn)-Average-Time Algorithm for Shortest Networks Under a Given Topology	p. 11
Steiner Problems on Directed Acyclic Graphs	p. 21
Wormhole Versus Deflection Routing: A Case Study on the Mesh	p. 31
On Sparse Parity Check Matrices	p. 41
Finding a Hidden Code by Asking Questions	p. 50
Improved Length Lower Bounds for Reflecting Sequences	p. 56
Combinatorial and Geometric Approaches to Counting Problems on Linear Matroids, Graphic Arrangements, and Partial Orders	p. 68
Output-Sensitive Reporting of Disjoint Paths	p. 81
Rectangular Grid Drawings of Plane Graphs	p. 92
Area-Efficient Algorithms for Upward Straight-Line Tree Drawings	p. 106
Straight Skeletons for General Polygonal Figures in the Plane	p. 117
A Note on Uniform Circuit Lower Bounds for the Counting Hierarchy	p. 127
A Note on the Simulation of Exponential Threshold Weights	p. 136
Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions	p. 142
Finding Large Planar Subgraphs and Large Subgraphs of a Given Genus	p. 152
Efficient Deterministic Algorithms for Embedding Graphs on Books	p. 162
Optimal Bi-Level Augmentation for Selectivity Enhancing Graph Connectivity with Applications	p. 169
Exact Learning of Subclasses of CDNF Formulas with Membership Queries	p. 179
Fast Separator Decomposition for Finite-Element Meshes	p. 189
Reduction Algorithms for Constructing Solutions in Graphs with Small Treewidth	p. 199
Fast RNC and NC Algorithms for Finding a Maximal Set of Paths with an Application	p. 209
Sparse Suffix Trees	p. 219
Depth-Efficient Threshold Circuits for Multiplication and Symmetric Function Computation	p. 231
A Note on the Self-Witnessing Property of Computational Problems	p. 241
The Inverse Satisfiability Problem	p. 250
The Join Can Lower Complexity	p. 260
On the Distribution of Eigenvalues of Graphs	p. 268
On the Difficulty of Designing Good Classifiers	p. 273
Approximating Latin Square Extensions	p. 280
Approximating Minimum Keys and Optimal Substructure Screens	p. 290
Reductions and Covergence Rates of Average Time	p. 300
On the Complexity of Computational Problems Associated with Simple Stochastic Games	p. 310
On the Complexity of Commutativity Analysis	p. 323
Improved Non-approximability Results for Vertex Cover Problems with Density Constraints	p. 333
Some Notes on the Nearest Neighbour Interchange Distance	p. 343
Distributed Computing in Asynchronous Networks with Byzantine Edges	p. 352
Weight Biased Leftist Trees and Modified Skip Lists	p. 361
Probabilistic Analysis of Local Search and NP-Completeness Result for Constraint Satisfaction	p. 371
On the Reconfiguration of Chains	p. 381
Two-Guarding a Rectilinear Polygon	p. 391
Three Systems for Shared Generation of Authenticators	p. 401
Efficient Generation of Elliptic Curve Cryptosystems	p. 411
Superconnectivity for Minimal Multi-loop Networks	p. 417
Author Index	p. 421
Table of Contents provided by Blackwell. All Rights Reserved.

Lecture Notes in Computer Science

Second Annual International Conference, COCOON '96, Hong Kong, June 17-19, 1996. Proceedings

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Mathematical Theory of Computation

Statistical Atlases and Computational Models of the Heart. Regular and CMRxRecon Challenge Papers

16th International Workshop, STACOM 2025, Held in Conjunction with MICCAI 2025, Daejeon, South Korea, September 27, 2025, Revised Selected Papers

AI Engineering

Building Applications with Foundation Models

Algorithms in C, Parts 1-4

3rd Edition - Fundamentals, Data Structures, Sorting, Searching

Swim Training Patterns

1st Edition - Plan your Training Sessions with the Power of Mathematics

Discrete Mathematics for Computing

Grassroots

Beading With Algorithms

Cellular Automata In Peyote Stitch

Effective Machine Learning Teams

Best Practices for ML Practitioners

Theory of Computation for Software Developers

Mathematical Foundations of Deep Learning

Theory and Algorithms

Mathematical Foundations of Deep Learning

Theory and Algorithms

Mining Complex Networks

Advances in Applied Mathematics

Mining Complex Networks

Advances in Applied Mathematics

Zhang Time Discretization (ZTD) Formulas and Applications

Decentralized Futures

Navigating the Integration of Blockchain Technology with Artificial Intelligence

Nonlinear Analysis for Human Movement Variability

Metaheuristic Algorithms

Theory and Practice

Machine Learning Interviews

Kickstart Your Machine Learning and Data Career

Introduction to Modern Cryptography

Revised Third Edition

AI Value Creators

Beyond the Generative AI User Mindset

The Irrational Decision

How We Gave Computers the Power to Choose for Us

Machine Learning Pocket Reference

Working with Structured Data in Python

Axiomatic Set Theory

An Introduction

Python Essentials

Symbolic and Numeric Problem-Solving in Engineering

Why Don t Rabbits Rule The World?

Mathematical answers to life s key questions

This product is categorised by