Computing and Combinatorics: 7th Annual International Conference, COCOON 2001, Guilin, China, August 20-23, 2001, Proceedings

Front Cover
Jie Wang
Springer, Sep 21, 2001 - Computer science - 602 pages
This book constitutes the refereed proceedings of the 7th Annual International Conference on Computing and Combinatorics, COCOON 2001, held in Guilin, China, in August 2001. The 50 revised full papers and 16 short papers presented were carefully reviewed and selected from 97 submissions. The papers are organized in topical sections on complexity theory, computational biology, computational geometry, data structures and algorithms, games and combinatorics, graph algorithms and complexity, graph drawing, graph theory, online algorithms, randomized and average-case algorithms, Steiner trees, systems algorithms and modeling, and computability.

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Complexity Theory
1
LogSpace Constructive Universal Traversal Sequences
20
Program Schemes Queues the Recursive Spectrum and ZeroOne Laws
39

42 other sections not shown

Other editions - View all

Common terms and phrases

Bibliographic information