Skip to main content
  • Conference proceedings
  • © 2010

Algorithms and Computation

21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part I

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

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

Conference series link(s): ISAAC: International Symposium on Algorithms and Computation

Conference proceedings info: ISAAC 2010.

Buy it now

Buying options

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

Table of contents (40 papers)

  1. Front Matter

  2. Session 1A. Approximation Algorithm I

    1. Approximate Periodicity

      • Amihood Amir, Estrella Eisenberg, Avivit Levy
      Pages 25-36
    2. Approximating the Average Stretch Factor of Geometric Graphs

      • Siu-Wing Cheng, Christian Knauer, Stefan Langerman, Michiel Smid
      Pages 37-48
  3. Session 1B. Complexity I

    1. Satisfiability with Index Dependency

      • Hongyu Liang, Jing He
      Pages 49-60
    2. Anonymous Fuzzy Identity-Based Encryption for Similarity Search

      • David W. Cheung, Nikos Mamoulis, W. K. Wong, S. M. Yiu, Ye Zhang
      Pages 61-72
    3. Improved Randomized Algorithms for 3-SAT

      • Kazuo Iwama, Kazuhisa Seto, Tadashi Takai, Suguru Tamaki
      Pages 73-84
    4. Quantum Counterfeit Coin Problems

      • Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama
      Pages 85-96
  4. Session 2A. Data Structure and Algorithm I

    1. Priority Range Trees

      • Michael T. Goodrich, Darren Strash
      Pages 97-108
    2. Should Static Search Trees Ever Be Unbalanced?

      • Prosenjit Bose, Karim Douïeb
      Pages 109-120
    3. Levelwise Mesh Sparsification for Shortest Path Queries

      • Yuichiro Miyamoto, Takeaki Uno, Mikio Kubo
      Pages 121-132
    4. Unit-Time Predecessor Queries on Massive Data Sets

      • Andrej Brodnik, John Iacono
      Pages 133-144
  5. Session 2B. Combinatorial Optimization

    1. Popularity at Minimum Cost

      • Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar
      Pages 145-156
    2. Structural and Complexity Aspects of Line Systems of Graphs

      • Jozef Jirásek, Pavel Klavík
      Pages 157-168
    3. Generating Trees on Multisets

      • Bingbing Zhuang, Hiroshi Nagamochi
      Pages 182-193
  6. Session 3A. Graph Algorithm I

Other Volumes

  1. Algorithms and Computation

Editors and Affiliations

  • Department of Computer Science, KAIST, Yuseong-gu, Korea

    Otfried Cheong, Kyung-Yong Chwa

  • School of Computer Science and Engineering, Seoul National University, Seoul, Korea

    Kunsoo Park

Bibliographic Information

Buy it now

Buying options

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