Skip to main content
SpringerLink
Log in
Book cover

FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science

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

  • Conference proceedings
  • © 2006

Overview

Editors:
  1. S. Arun-Kumar

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Naveen Garg

    1. Indian Institute of Technology, Delhi

    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 4337)

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

Included in the following conference series:

Conference proceedings info: FSTTCS 2006.

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 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

Licence this eBook for your library

Institutional subscriptions

Table of contents (38 papers)

  1. Front Matter

    Download chapter PDF

  3. Contributed Papers – Track A

    1. Normal and Feature Approximations from Noisy Point Clouds

      • Tamal K. Dey, Jian Sun
      Pages 21-32

    2. Coresets for Discrete Integration and Clustering

      • Sariel Har-Peled
      Pages 33-44

    3. 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

    4. One-Input-Face MPCVP Is Hard for L, But in LogDCFL

      • Tanmoy Chakraborty, Samir Datta
      Pages 57-68

    5. Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs

      • K. Murali Krishnan, L. Sunil Chandran
      Pages 69-80

    6. Multi-stack Boundary Labeling Problems

      • Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis
      Pages 81-92

    7. Computing a Center-Transversal Line

      • Pankaj K. Agarwal, Sergio Cabello, J. Antoni Sellarès, Micha Sharir
      Pages 93-104

    8. On Obtaining Pseudorandomness from Error-Correcting Codes

      • Shankar Kalyanaraman, Christopher Umans
      Pages 105-116

    9. Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance

      • Gruia Calinescu, Michael J. Pelsmajer
      Pages 117-128

    10. Zero Error List-Decoding Capacity of the q/(q–1) Channel

      • Sourav Chakraborty, Jaikumar Radhakrishnan, Nandakumar Raghunathan, Prashant Sasatte
      Pages 129-138

    11. Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems

      • Sushmita Gupta, Venkatesh Raman, Saket Saurabh
      Pages 139-151

    12. Solving Connected Dominating Set Faster Than 2n

      • Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
      Pages 152-163

    13. Linear-Time Algorithms for Two Subtree-Comparison Problems on Phylogenetic Trees with Different Species

      • Sun-Yuan Hsieh
      Pages 164-175

    14. Computationally Sound Symbolic Secrecy in the Presence of Hash Functions

      • Véronique Cortier, Steve Kremer, Ralf Küsters, Bogdan Warinschi
      Pages 176-187

    15. Some Results on Average-Case Hardness Within the Polynomial Hierarchy

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

Other volumes

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

Keywords

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

Publish with us

Policies and ethics

Back to top

Search

Navigation