Skip to main content
Springer Nature Link
Log in

Theory and Applications of Models of Computation

4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings

  • Conference proceedings
  • © 2007

Overview

Editors:
  1. Jin-Yi Cai
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. S. Barry Cooper
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Hong Zhu
    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 4484)

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

Included in the following conference series:

Conference proceedings info: TAMC 2007.

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 EUR 105.49
Price includes VAT (France)
  • 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

Keywords

Table of contents (69 papers)

  1. Front Matter

    Download chapter PDF

  3. Contributed Papers

    1. Approximation Algorithms for 3D Orthogonal Knapsack

      • Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, Henning Thomas
      Pages 34-45

    2. A Comparative Study of Efficient Algorithms for Partitioning a Sequence into Monotone Subsequences

      • Bing Yang, Jing Chen, Enyue Lu, S. Q. Zheng
      Pages 46-57

    3. The Hardness of Selective Network Design for Bottleneck Routing Games

      • Haiyang Hou, Guochuan Zhang
      Pages 58-66

    4. A Polynomial Time Algorithm for Finding Linear Interval Graph Patterns

      • Hitoshi Yamasaki, Takayoshi Shoudai
      Pages 67-78

    5. Elementary Differences Among Jump Hierarchies

      • Angsheng Li
      Pages 79-88

    6. Working with the LR Degrees

      • George Barmpalias, Andrew E. M. Lewis, Mariya Soskova
      Pages 89-99

    7. Computability on Subsets of Locally Compact Spaces

      • Yatao Xu, Tanja Grubba
      Pages 100-114

    8. A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs

      • Shin-ichi Nakano, Ryuhei Uehara, Takeaki Uno
      Pages 115-127

    9. Finding a Duplicate and a Missing Item in a Stream

      • Jun Tarui
      Pages 128-135

    10. Directed Searching Digraphs: Monotonicity and Complexity

      • Boting Yang, Yi Cao
      Pages 136-147

    11. Protecting Against Key Escrow and Key Exposure in Identity-Based Cryptosystem

      • Jin Wang, Xi Bai, Jia Yu, Daxing Li
      Pages 148-158

    12. Encapsulated Scalar Multiplications and Line Functions in the Computation of Tate Pairing

      • Rongquan Feng, Hongfeng Wu
      Pages 159-170

    13. A Provably Secure Blind Signature Scheme

      • Xiaoming Hu, Shangteng Huang
      Pages 171-180

    14. Construct Public Key Encryption Scheme Using Ergodic Matrices over GF(2)

      • Pei Shi-Hui, Zhao Yong-Zhe, Zhao Hong-Wei
      Pages 181-188

    15. New Left-to-Right Radix-r Signed-Digit Recoding Algorithm for Pairing-Based Cryptosystems

      • Fanyu Kong, Jia Yu, Zhun Cai, Daxing Li
      Pages 189-198

    16. The Strongest Nonsplitting Theorem

      • Mariya Ivanova Soskova, S. Barry Cooper
      Pages 199-211

    17. There is an Sw-Cuppable Strongly c.e. Real

      • Yun Fan
      Pages 212-221
Back to top

Other volumes

  1. Theory and Applications of Models of Computation

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation