Skip to main content
Springer Nature Link
Log in

Computing and Combinatorics

8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002 Proceedings

  • Conference proceedings
  • © 2002

Overview

Editors:
  1. Oscar H. Ibarra

    1. Department of Computer Science, University of California, Santa Barbara, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Louxin Zhang

    1. Department of Mathematics, National University of Singapore, Singapore, Singapore

    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 2387)

Included in the following conference series:

Conference proceedings info: COCOON 2002.

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

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Keywords

Table of contents (63 papers)

  1. Front Matter

    Pages I-XIII
    Download chapter PDF

  3. Complexity Theory I

    1. On Higher Arthur-Merlin Classes

      • Jin-Yi Cai, Denis Charles, A. Pavan, Samik Sengupta
      Pages 18-27

    2. (2 + f(n))-SAT and Its Properties

      • Xiaotie Deng, C. H. Lee, Yunlei Zhao, Hong Zhu
      Pages 28-36

    3. On the Minimal Polynomial of a Matrix

      • Thanh Minh Hoang, Thomas Thierauf
      Pages 37-46

    4. Computable Real Functions of Bounded Variation and Semi-computable Real Numbers

      • Robert Rettinger, Xizhong Zheng, Burchard von Braunmühl
      Pages 47-56

  4. Discrete Algorithms I

    1. Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees

      • Hsueh-I Lu
      Pages 57-66

    2. Coloring Algorithms on Subcubic Graphs

      • Harold N. Gabow, San Skulrattanakulchai
      Pages 67-76

    3. Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs

      • Sun-yuan Hsieh, Chin-wen Ho, Tsan-sheng Hsu, Ming-tat Ko
      Pages 77-86

    4. Extending the Accommodating Function

      • Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen
      Pages 87-96

  5. Computational Biology and Learning Theory I

    1. Inverse Parametric Sequence Alignment

      • Fangting Sun, David Fernández-Baca, Wei Yu
      Pages 97-106

    2. The Full Steiner Tree Problem in Phylogeny

      • Chin Lung Lu, Chuan Yi Tang, Richard Chia-Tung Lee
      Pages 107-116

    3. Inferring a Union of Halfspaces from Examples

      • Tatsuya Akutsu, Sascha Ott
      Pages 117-126

    4. Dictionary Look-Up within Small Edit Distance

      • Abdullah N. Arslan, Ömer Eğecioğlu
      Pages 127-136

  6. Coding Theory and Cryptography

    1. Polynomial Interpolation of the Elliptic Curve and XTR Discrete Logarithm

      • Tanja Lange, Arne Winterhof
      Pages 137-143

    2. Co-orthogonal Codes

      • Vince Grolmusz
      Pages 144-152

    3. Efficient Power-Sum Systolic Architectures for Public-Key Cryptosystems in GF(2m)

      • Nam-Yeun Kim, Won-Ho Lee, Kee-Young Yoo
      Pages 153-161

    4. A Combinatorial Approach to Anonymous Membership Broadcast

      • Huaxiong Wang, Josef Pieprzyk
      Pages 162-170
Back to top

Other volumes

  1. Computing and Combinatorics

Editors and Affiliations

  • Department of Computer Science, University of California, Santa Barbara, USA

    Oscar H. Ibarra

  • Department of Mathematics, National University of Singapore, Singapore, Singapore

    Louxin Zhang

Bibliographic Information

Publish with us

Policies and ethics

Back to top