Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Computing and Combinatorics - Third Annual International Conference, COCOON '97, Shanghai, China,

Computing and Combinatorics

Third Annual International Conference, COCOON '97, Shanghai, China, August 20-22, 1997. Proceedings.

Jiang, Tao, Lee, D.T. (Eds.)

1997, XII, 524 p.

Available Formats:

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.


ISBN 978-3-540-69522-6

digitally watermarked, no DRM

The eBook version of this title will be available soon

learn more about Springer eBooks

add to marked items


Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.


(net) price for USA

ISBN 978-3-540-63357-0

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days

add to marked items

This book constitutes the refereed proceedings of the Third Annual International Computing and Combinatorics Conference, COCOON'97, held in Shanghai, China, in August 1997.
The volume presents 53 revised full papers selected from a total of 106 submissions. The papers are organized in sections on parallel and distributed computing, computational geometry, complexity, computational biology, computability, cryptography and computational finance, graph algorithms, algorithms, rewriting and logic, algorithms and applications, automata languages and complexity, and mathematical programming and genetic algorithms.

Content Level » Research

Keywords » Algorithms - Automat - Graph - algorithm - automata - combinatorics - complexity - computability - computational geometry - distributed computing - genetic algorithms - logic - optimization - programming

Related subjects » Communication Networks - Image Processing - Theoretical Computer Science

Table of contents 

Conflict-free access to templates of trees and hypercubes in parallel memory systems.- Many-to-one packet routing via matchings.- A multi-tree generating routing scheme using acyclic orientations.- An algorithm for Heilbronn's problem.- Optimal multiresolution polygonal approximation.- Constructing a strongly convex superhull of points.- Fast range searching with Delaunay Triangulations.- Resolution of Hartmanis' conjecture for NL-hard sparse sets.- Can large fanin circuits perform reliable computations in the presence of noise?.- On set systems with restricted intersections modulo a composite number.- Size and variable ordering of OBDDs representing threshold functions.- The performance of neighbor-joining algorithms of phylogeny reconstruction.- Inferring evolutionary trees with strong combinatorial evidence.- Parsimony is hard to beat!.- On the complexity of computing evolutionary trees.- Computable invariance.- Subclasses of computable real valued functions.- Computability on continuous, lower semi-continuous and upper semi-continuous real functions.- Contrast-optimal k out of n secret sharing schemes in visual cryptography.- A Rabin-type scheme based on y 2 ? x 3 + bx 2 mod n.- Optimal bidding algorithms against cheating in multiple-object auctions.- Spring algorithms and symmetry.- Generalized vertex-rankings of partial k-trees.- A selected tour of the theory of identification matrices.- Efficient domination on permutation graphs and trapezoid graphs.- On physical mapping algorithms: An error-tolerant test for the consecutive ones property.- The median problem for breakpoints in comparative genomics.- Fast algorithms for aligning sequences with restricted affine gap penalties.- A matrix representation of phylogenetic trees.- Edge and node searching problems on trees.- Construction of nearly optimal multiway trees.- Optimal algorithms for circle partitioning.- Hexagonal routing of multiterminal nets.- Design and analysis of parallel set-term unification.- On modularity of completeness in order-sorted term rewriting systems.- A three-valued quantificational logic of context.- A compact storage scheme for fast wavelet-based subregion retrieval.- A declustering algorithm for minimising spatial join cost.- Fixed topology steiner trees and spanning forests with applications in network communications.- A branch-and-bound algorithm for computing node weighted steiner minimum trees.- A complete characterization of repetitive morphisms over the two-letter alphabet.- An algorithm for identifying spliced languages.- The shapes of trees.- Tally languages accepted by alternating multitape finite automata.- Independent spanning trees of chordal rings.- Rearrangeable graphs.- Projective torus networks.- On the 100% rule of sensitivity analysis in linear programming.- Enumerating triangulations for products of two simplices and for arbitrary configurations of points.- Tree structure genetic algorithm with a nourishment mechanism.- An approach to scalability of parallel matrix multiplication algorithms.- Limited acceleration mechanism for cell loss free flow control in ATM networks.- They are just butterflies.- Mutual search.- Eigenvalues, eigenvectors, and graph partitioning.- Corrigendum: Exact learning of subclasses of CDNF formulas with membership queries.

Popular Content within this publication 



Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Theory of Computation.