Skip to main content
SpringerLink
Log in
Book cover

Computing and Combinatorics

14th International Conference, COCOON 2008 Dalian, China, June 27-29, 2008, Proceedings

  • Conference proceedings
  • © 2008

Overview

Editors:
  1. Xiaodong Hu
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Jie Wang
    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 5092)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: COCOON 2008.

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 (66 papers)

  1. Front Matter

    Download chapter PDF

  2. Algorithms and Data Structures

    1. Efficient Compression of Web Graphs

      • Yasuhito Asano, Yuya Miyawaki, Takao Nishizeki
      Pages 1-11

    2. Damaged BZip Files Are Difficult to Repair

      • Christian Hundt, Ulf Ochsenfahrt
      Pages 12-21

    3. Isoperimetric Problem and Meta-fibonacci Sequences

      • B. V. S. Bharadwaj, L. S. Chandran, Anita Das
      Pages 22-30

  3. Algorithmic Game Theory and Online Algorithms

    1. On the Complexity of Equilibria Problems in Angel-Daemon Games

      • Joaquim Gabarro, Alina García, Maria Serna
      Pages 31-40

    2. Average-Case Competitive Analyses for One-Way Trading

      • Hiroshi Fujiwara, Kazuo Iwama, Yoshiyuki Sekiguchi
      Pages 41-51

    3. On the Monotonicity of Weak Searching

      • Boting Yang, Yi Cao
      Pages 52-61

  4. Automata, Languages, Logic, and Computability

    1. VC Dimension Bounds for Analytic Algebraic Computations

      • José Luis Montaña, Luis Miguel Pardo, Mar Callau
      Pages 62-71

    2. Resource Bounded Frequency Computations with Three Errors

      • Ulrich Hertrampf, Christoph Minnameier
      Pages 72-81

    3. A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model

      • Bin Fu, Zhixiang Chen
      Pages 82-91

    4. Smallest Formulas for Parity of 2k Variables Are Essentially Unique

      • Jun Tarui
      Pages 92-99

  5. Combinatorics Related to Algorithms and Complexity

    1. Counting Polycubes without the Dimensionality Curse

      • Gadi Aleksandrowicz, Gill Barequet
      Pages 100-109

    2. Polychromatic Colorings of n-Dimensional Guillotine-Partitions

      • Balázs Keszegh
      Pages 110-118

    3. The Computational Complexity of Link Building

      • Martin Olsen
      Pages 119-129

    4. Improved Parameterized Algorithms for Weighted 3-Set Packing

      • Jianxin Wang, Qilong Feng
      Pages 130-139

    5. Structural Identifiability in Low-Rank Matrix Factorization

      • Epameinondas Fritzilas, Yasmin A. Rios-Solis, Sven Rahmann
      Pages 140-148

    6. Complexity of Counting the Optimal Solutions

      • Miki Hermann, Reinhard Pichler
      Pages 149-159

  6. Complexity Theory

    1. The Orbit Problem Is in the GapL Hierarchy

      • V. Arvind, T. C. Vijayaraghavan
      Pages 160-169

    2. Quantum Separation of Local Search and Fixed Point Computation

      • Xi Chen, Xiaoming Sun, Shang-Hua Teng
      Pages 170-179

    3. Multi-party Quantum Communication Complexity with Routed Messages

      • Seiichiro Tani, Masaki Nakanishi, Shigeru Yamashita
      Pages 180-190
Back to top

Other volumes

  1. Computing and Combinatorics

Keywords

About this book

The refereed proceedings of the 14th Annual International Computing and Combinatorics Conference, COCOON 2008, held in Dalian, China, in June 2008. The 66 revised full papers presented were carefully reviewed and selected from 172 submissions. The papers are organized in topical sections on algorithms and data structures, algorithmic game theory and online algorithms, automata, languages, logic, and computability, combinatorics related to algorithms and complexity, complexity theory, cryptography, reliability and security, and database theory, computational biology and bioinformatics, computational algebra, geometry, and number theory, graph drawing and information visualization, graph theory and algorithms, communication networks, and optimization, wireless network, network optimization, and scheduling problem.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation