Skip to main content
  • Conference proceedings
  • © 2006

FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science

26th International Conference, Kolkata, India, December 13-15, 2006, Proceedings

Conference proceedings info: FSTTCS 2006.

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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

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

Table of contents (38 papers)

  1. Front Matter

  2. Contributed Papers – Track A

    1. Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time

      • Florent Becker, Ivan Rapaport, Éric Rémila
      Pages 45-56
    2. One-Input-Face MPCVP Is Hard for L, But in LogDCFL

      • Tanmoy Chakraborty, Samir Datta
      Pages 57-68
    3. Multi-stack Boundary Labeling Problems

      • Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis
      Pages 81-92
    4. Computing a Center-Transversal Line

      • Pankaj K. Agarwal, Sergio Cabello, J. Antoni Sellarès, Micha Sharir
      Pages 93-104
    5. On Obtaining Pseudorandomness from Error-Correcting Codes

      • Shankar Kalyanaraman, Christopher Umans
      Pages 105-116
    6. Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance

      • Gruia Calinescu, Michael J. Pelsmajer
      Pages 117-128
    7. Zero Error List-Decoding Capacity of the q/(q–1) Channel

      • Sourav Chakraborty, Jaikumar Radhakrishnan, Nandakumar Raghunathan, Prashant Sasatte
      Pages 129-138
    8. Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems

      • Sushmita Gupta, Venkatesh Raman, Saket Saurabh
      Pages 139-151
    9. Solving Connected Dominating Set Faster Than 2n

      • Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
      Pages 152-163
    10. Computationally Sound Symbolic Secrecy in the Presence of Hash Functions

      • Véronique Cortier, Steve Kremer, Ralf Küsters, Bogdan Warinschi
      Pages 176-187
    11. Some Results on Average-Case Hardness Within the Polynomial Hierarchy

      • A. Pavan, Rahul Santhanam, N. V. Vinodchandran
      Pages 188-199

Other Volumes

  1. FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science

Editors and Affiliations

  • Department of Computer Science and Engineering, Indian Institute of Technology Delhi, New Delhi, India

    S. Arun-Kumar

  • Indian Institute of Technology, Delhi

    Naveen Garg

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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