Skip to main content
SpringerLink
Log in
Book cover

Computing and Combinatorics

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

  • Conference proceedings
  • © 1997

Overview

Editors:
  1. Tao Jiang
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. D. T. Lee
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1276)

Included in the following conference series:

Conference proceedings info: COCOON 1997.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (56 papers)

  1. Front Matter

    Download chapter PDF

  2. Conflict-free access to templates of trees and hypercubes in parallel memory systems

    • Sajal K. Das, M. Cristina Pinotti
    Pages 1-10

  3. Many-to-one packet routing via matchings

    • Danny Krizanc, Louxin Zhang
    Pages 11-17

  4. A multi-tree generating routing scheme using acyclic orientations

    • Fred S. Annexstein, Kenneth A. Berman, Ram Swaminathan
    Pages 18-22

  5. An algorithm for Heilbronn's problem

    • Claudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann
    Pages 23-31

  6. Optimal multiresolution polygonal approximation

    • K. W. Chan, Francis Y. L. Chin
    Pages 32-41

  7. Constructing a strongly convex superhull of points

    • Wei Chen, Xiao Wen Deng, Koichi Wada, Kimio Kawaguchi
    Pages 42-51

  8. Fast range searching with Delaunay Triangulations

    • Binhai Zhu
    Pages 52-61

  9. Resolution of Hartmanis' conjecture for NL-hard sparse sets

    • Jin-Yi Cai, D. Sivakumar
    Pages 62-71

  10. Can large fanin circuits perform reliable computations in the presence of noise?

    • Rüdiger Reischuk
    Pages 72-81

  11. On set systems with restricted intersections modulo a composite number

    • Vince Grolmusz
    Pages 82-90

  12. Size and variable ordering of OBDDs representing threshold functions

    • Yasuhiko Takenaga, Mitsushi Nouzoe, Shuzo Yajima
    Pages 91-100

  13. The performance of neighbor-joining algorithms of phylogeny reconstruction

    • Kevin Atteson
    Pages 101-110

  14. Inferring evolutionary trees with strong combinatorial evidence

    • Vincent Berry, Olivier Gascuel
    Pages 111-123

  15. Parsimony is hard to beat!

    • Kenneth Rice, Tandy Warnow
    Pages 124-133

  16. On the complexity of computing evolutionary trees

    • Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin
    Pages 134-145

  17. Computable invariance

    • Vasco Brattka
    Pages 146-155

  18. Subclasses of computable real valued functions

    • Qing Zhou
    Pages 156-165

  19. Computability on continuous, lower semi-continuous and upper semi-continuous real functions

    • Klaus Weihrauch, Xizhong Zheng
    Pages 166-175

  20. Contrast-optimal k out of n secret sharing schemes in visual cryptography

    • Thomas Hofmeister, Matthias Krause, Hans U. Simon
    Pages 176-185
Back to top

Other volumes

  1. Computing and Combinatorics

Keywords

About this book

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.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation