Skip to main content
SpringerLink
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
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.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 (63 papers)

  1. Parallel and Distributed Architectures

    1. Solving Constraint Satisfaction Problems with DNA Computing

      • Evgeny Dantsin, Alexander Wolpert
      Pages 171-180

    2. New Architecture and Algorithms for Degradable VLSI/WSI Arrays

      • Wu Jigang, Heiko Schröder, Srikanthan Thambipillai
      Pages 181-190

    3. Cluster: A Fast Tool to Identify Groups of Similar Programs

      • Casey Carter, Nicholas Tran
      Pages 191-199

    4. Broadcasting in Generalized de Bruijn Digraphs

      • Yosuke Kikuchi, Shingo Osawa, Yukio Shibata
      Pages 200-209

  2. Graph Theory

    1. On the Connected Domination Number of Random Regular Graphs

      • William Duckworth, Bernard Mans
      Pages 210-219

    2. On the Number of Minimum Cuts in a Graph

      • L. Sunil Chandran, L. Shankar Ram
      Pages 220-229

    3. On Crossing Numbers of 5-Regular Graphs

      • G. L. Chia, C. S. Gan
      Pages 230-237

    4. Maximum Flows and Critical Vertices in AND/OR Graphs

      • Yvo Desmedt, Yongge Wang
      Pages 238-248

  4. Automata and Formal Languages

    1. A New Class of Symbolic Abstract Neural Nets: Tissue P Systems

      • C. Martín-Vide, J. Pazos, G. Păun, A. Rodríguez-Patón
      Pages 290-299

    2. Transducers with Set Output

      • Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc
      Pages 300-309

    3. Self-assembling Finite Automata

      • Andreas Klein, Martin Kutrib
      Pages 310-319

    4. Repetition Complexity of Words

      • Lucian Ilie, Sheng Yu, Kaizhong Zhang
      Pages 320-329

  5. Internet Networks

    1. Using PageRank to Characterize Web Structure

      • Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal
      Pages 330-339

    2. On Randomized Broadcasting and Gossiping in Radio Networks

      • Ding Liu, Manoj Prabhakaran
      Pages 340-349

    3. Fast and Dependable Communication in Hyper-rings

      • Tom Altman, Yoshihide Igarashi, Kazuhiro Motegi
      Pages 350-359

  6. Computational Geometry I

    1. The On-Line Heilbronn’s Triangle Problem in Three and Four Dimensions

      • Gill Barequet
      Pages 360-369
Back to top

Other volumes

  1. Computing and Combinatorics

Keywords

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

Search

Navigation