Table Of ContentLecture Notes in Computer Science 4337
CommencedPublicationin1973
FoundingandFormerSeriesEditors:
GerhardGoos,JurisHartmanis,andJanvanLeeuwen
EditorialBoard
DavidHutchison
LancasterUniversity,UK
TakeoKanade
CarnegieMellonUniversity,Pittsburgh,PA,USA
JosefKittler
UniversityofSurrey,Guildford,UK
JonM.Kleinberg
CornellUniversity,Ithaca,NY,USA
FriedemannMattern
ETHZurich,Switzerland
JohnC.Mitchell
StanfordUniversity,CA,USA
MoniNaor
WeizmannInstituteofScience,Rehovot,Israel
OscarNierstrasz
UniversityofBern,Switzerland
C.PanduRangan
IndianInstituteofTechnology,Madras,India
BernhardSteffen
UniversityofDortmund,Germany
MadhuSudan
MassachusettsInstituteofTechnology,MA,USA
DemetriTerzopoulos
UniversityofCalifornia,LosAngeles,CA,USA
DougTygar
UniversityofCalifornia,Berkeley,CA,USA
MosheY.Vardi
RiceUniversity,Houston,TX,USA
GerhardWeikum
Max-PlanckInstituteofComputerScience,Saarbruecken,Germany
S. Arun-Kumar Naveen Garg (Eds.)
FSTTCS 2006:
Foundations of
Software Technology
and Theoretical
Computer Science
26th International Conference
Kolkata, India, December 13-15, 2006
Proceedings
1 3
VolumeEditors
S.Arun-Kumar
DepartmentofComputerScienceandEngineering
IndianInstituteofTechnologyDelhi
NewDelhi110016,India
E-mail:[email protected]
NaveenGarg
DepartmentofComputerScienceandEngineering
IndianInstituteofTechnologyDelhi
NewDelhi110016,India
E-mail:[email protected]
LibraryofCongressControlNumber:2006937157
CRSubjectClassification(1998):F.3,D.3,F.4,F.2,F.1,G.2
LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues
ISSN 0302-9743
ISBN-10 3-540-49994-6SpringerBerlinHeidelbergNewYork
ISBN-13 978-3-540-49994-7SpringerBerlinHeidelbergNewYork
Thisworkissubjecttocopyright.Allrightsarereserved,whetherthewholeorpartofthematerialis
concerned,specificallytherightsoftranslation,reprinting,re-useofillustrations,recitation,broadcasting,
reproductiononmicrofilmsorinanyotherway,andstorageindatabanks.Duplicationofthispublication
orpartsthereofispermittedonlyundertheprovisionsoftheGermanCopyrightLawofSeptember9,1965,
initscurrentversion,andpermissionforusemustalwaysbeobtainedfromSpringer.Violationsareliable
toprosecutionundertheGermanCopyrightLaw.
SpringerisapartofSpringerScience+BusinessMedia
springer.com
©Springer-VerlagBerlinHeidelberg2006
PrintedinGermany
Typesetting:Camera-readybyauthor,dataconversionbyScientificPublishingServices,Chennai,India
Printedonacid-freepaper SPIN:11944836 06/3142 543210
Preface
Welcometotheproceedingsofthe26thannualconferenceontheFoundationsof
SoftwareTechnologyandTheoreticalComputerScience(FSTTCS).FSTTCSis
organizedbythe IndianAssociationforResearchinComputerScience(IARCS)
which it helped create by bringing together academic computer scientists from
various parts of India. Over the years several changes have taken place in the
conference, beginning with the first Springer LNCS edition in 1984. The first
three proceedings were printed and published in India by the Tata Institute of
Fundamental Research. Since then other changes, such as an international Pro-
gramme Committee and pre-conference and post-conference workshops, have
helped nurture and enhance the status of this conference among computer sci-
entists interested in foundational research.
Along with these changes there are quite a few invariant properties this con-
ferenceenjoys.IthasalwaysbeenheldinIndia,andalwaysinthesecondorthird
weekofDecember,whichisagoodtimetotraveltoandwithinthecountry.Itis
also the most convenient time to meet Indian researchers,most of whom would
be temporarily free of teaching and administrative commitments.
Thisyearforthefirsttimeinitshistory,FSTTCSwasheldinthehistoriccity
ofKolkata(formerlyCalcutta)attheIndianStatisticalInstitute(ISI).FSTTCS
isoneofthe eventstocommemoratethe Platinumjubilee yearofISIandweare
happy to be part of this celebration. Subhas C. Nandy of ISI Kolkata took full
responsibility as chairman of the Organizing Committee.
Theconferenceattracted155submissionswithauthorsfrom29countries.We
thank the authors for their interest in this conference. The reputation of a con-
ference is effectively determined by its Programme Committee, the refereeing
process and the Invited talks. This year, as in the past, we were able to get
highly respected researchers to serve on our Programme Committee. The refer-
eeing process too has been of a very high quality. The Programme Committee
deliberated on each of the submitted papers and the accompanying referee re-
portsandfinallydecidedtoselect34submissionsasbeingworthyofpublication.
The invited speakers this year were Gordon Plotkin of the University of Ed-
inburgh,UK,EmoWelzlofETHZurich,Switzerland,G´erardBoudolofINRIA,
SophiaAntipolis,France,DavidShmoysofCornellUniversity,USAandEugene
Asarin of Universit´e Paris 7, France.
In keeping with what has now become tradition, two workshops on recent
advances in areas of current interest to the community were also organized.
The themes this year were Timed Systems (organized by Deepak D’Souza and
Supratik Chakraborty) and Approximation Algorithms (organized by Anupam
Gupta and Amit Kumar).
WewouldliketothanktheauthorswhosubmittedpapersandtheProgramme
Committeeforhelpingusmaintainthestandardofthisconference.Weespecially
thanktheauthorsoftheselectedpaperswhichformthebulkofthisvolume.We
VI Preface
would like to thank Springer for agreeing to publish these proceedings in their
prestigiousLecture Notes in Computer Scienceseries,whichhasinnosmallway
contributed to the status of this conference in academic circles.
WewouldalsoliketothankISIKolkataandSubhasNandy’steamforhosting
FSTTCS, IIT Delhi and MPI-Informatik for providing support and of course,
IARCS, the parent organizationthat FSTTCS gave birth to!
December 2006 Naveen Garg
S. Arun-Kumar
Programme Chairs
FSTTCS 2006
Organization
FSTTCS 2006 and the associatedworkshops were held at the Indian Statistical
Institute, Kolkata.
Programme Committee
Amit Kumar Manindra Agrawal
(IIT Delhi, India) (IIT Kanpur, India)
Anil Seth Marco Pistore
(IIT Kanpur, India) (DIT Trento, Italy)
Anuj Dawar Marina Papatriantafilou
(Cambridge University, UK) (Chalmers UT, Sweden)
Anupam Gupta Naveen Garg
(CMU, USA) (IIT Delhi, India), Co-chair
Ashish Tiwari, Neal Young
(SRI, USA) (UC Riverside, USA)
Astrid Kiehn Nobuko Yoshida
(IIT Delhi, India) (Imperial College, UK)
Dale Miller Prakash Panangaden
(INRIA-Futurs, France) (McGill University, Canada)
Deepak D’Souza Radha Jagadeesan
(IISc, India ) (DePaul University, USA)
Edgar Ramos Rohit Khandekar
(UIUC, USA) (University Waterloo, Canada)
Giuseppe Italiano S. Arun-Kumar
(Universita´ di Roma, Italy) (IIT Delhi, India), Co-chair
Helmut Veith Sriram K. Rajamani
(TU Mu¨nchen, Germany) (Microsoft Research, USA)
Javier Esparza Subhas C. Nandy
(University of Stuttgart, Germany) (ISI Kolkata, India)
Joost-Pieter Katoen Supratik Chakraborty
(RWTH, Germany) (IIT Bombay, India)
Kavitha Telikepalli Susanne Albers
(IISc, India) (University of Freiburg, Germany)
Madhavan Mukund Yuval Rabani
(CMI, India) (Technion, Israel)
Referees
Abhik Roychoudhury Aditya Nori Andrey Rybalchenko
Abraham Flaxman Amitabha Bagchi Andrzej Murawski
Achim Blumensath Andrea Pacifici Angelika Mader
VIII Organization
Antoine Meyer Kohei Honda Rahul Jain
Arijit Bishnu Konstantin Korovin Ramesh Hariharan
Ashish Goel Krishna S. Ran Canetti
Ashwin Nayak Krishnendu Chatterjee Rana Barua
Avik Chaudhuri Krishnendu Richard Mayr
B. Meenakshi Mukhopadhya Robert Schweller
Barbara Koenig Kunal Talwar Rohit Parikh
Benedikt Bollig Kunsoo Park Ron van der Meyden
Bharat Adsul Leonard Schulman Ronald de Wolf
Bhargab Bhattacharya Lukasz Kowalik Russ Harmer
Bimal Roy Luke Ong Ryan Williams
Binay K. Bhattacharya Madhu Gopinathan S. P. Suresh
Boris Koldehofe Madhu Sudan S. Ramesh
C. A. Murthy Madhusudan P. Sanjiva Prasad
Carsten Kern Marco Carbone Sariel Har-Peled
Catuscia Palamidessi Marielle Stoelinga SatyanarayanaValluri
Christian Schallhart Marko Samer Saugata Basu
Daniel Hirschkoff Markus Holzer Sergey Bereg
Daniel Willems Martin Berger Soeren Laue
Daniele Varacca Martin Neuhusser Srinath Sridhar
David N. Jansen Massimiliano Caramia Sriram S.
Dino Distefano Matthias Nickles Stefan Funke
Doina Precup Maurizio Naldi Stefan Rieger
Elad Schiller Meena Mahajan Stephen Kobourov
Erika Abraham Michael Kohler Sudeb P. Pal
Fedor Fomin Nabil Mustafa Sudhakar G.
Franck van Breugel Nicolas Markey Suman Roy
G. Sivakumar Nir Piterman Sumit Ganguly
G. Paun Norm Ferns Sumit Jha
Guido Proietti Oded Regev Surender Baswana
Herbert Wiklicky Oleg Sokolsky Susmita Sur-Kolay
Hoeteck Wee Olivier Carton T. S. Hsu
Holger Schlingloff Om P. Damani Thomas Noll
Igor Walukiewicz P. S. Thiagarajan Thomas Thierauf
Irit Katriel Palash Sarkar Tingting Han
J. Radhakrishnan Pallab Dasgupta Umesh Bellur
JayalalSarma M. N. Paolo Zuliani V´eronique Bruy`ere
Jochen Konemann Paritosh Pandya V. Arvind
Johannes Kinder Pavithra Prabhakar Valentin Goranko
K. NarayanKumar Peter Bro Miltersen Vinayaka Pandit
Kamal Lodaya Prakash Chandrasekaran Vinodchandran Variyam
Kapil Vaswani Pranab Sen Walter Vogler
Kasturi R. Varadarajan Prasad Naldurg Willem Conradie
Katarzyna Paluch Prasad Sistla Yaoyun Shi
Khaled Elbassioni Pushpak Bhattacharya Yichen Xie
Kishan Gupta R. Ramanujam
Organization IX
Sponsoring Institutions
Indian Association for Research in Computer Science
Indian Institute of Technology, Delhi
Indian Statistical Institute, Kolkata
Table of Contents
Invited Papers
Shared-Variable Concurrency: A Proposal............................ 1
G´erard Boudol
Hennessy-Plotkin-BrookesRevisited ................................ 4
Gordon Plotkin
Approximation Algorithms for 2-Stage Stochastic Optimization
Problems ........................................................ 5
Chaitanya Swamy, David B. Shmoys
The Number of Crossing Free Configurations on Finite Point Sets
in the Plane...................................................... 20
Emo Welzl
Contributed Papers – Track A
Normal and Feature Approximations from Noisy Point Clouds ......... 21
Tamal K. Dey, Jian Sun
Coresets for Discrete Integration and Clustering ...................... 33
Sariel Har-Peled
Self-assemblying Classes of Shapes with a Minimum Number of Tiles,
and in Optimal Time.............................................. 45
Florent Becker, Ivan Rapaport, E´ric R´emila
One-Input-Face MPCVP Is Hard for L, But in LogDCFL .............. 57
Tanmoy Chakraborty, Samir Datta
Hardness of Approximation Results for the Problem of Finding
the Stopping Distance in Tanner Graphs............................. 69
K. Murali Krishnan, L. Sunil Chandran
Multi-stack Boundary Labeling Problems ............................ 81
Michael A. Bekos, Michael Kaufmann, Katerina Potika,
Antonios Symvonis
Computing a Center-TransversalLine ............................... 93
Pankaj K. Agarwal, Sergio Cabello, J. Antoni Sellar`es,
Micha Sharir
XII Table of Contents
On Obtaining Pseudorandomness from Error-CorrectingCodes ......... 105
Shankar Kalyanaraman, Christopher Umans
Fast Edge Colorings with Fixed Number of Colors to Minimize
Imbalance........................................................ 117
Gruia Calinescu, Michael J. Pelsmajer
Zero Error List-Decoding Capacity of the q/(q−1) Channel............ 129
Sourav Chakraborty, Jaikumar Radhakrishnan,
Nandakumar Raghunathan, Prashant Sasatte
Fast Exponential Algorithms for Maximum r-Regular Induced
Subgraph Problems ............................................... 139
Sushmita Gupta, Venkatesh Raman, Saket Saurabh
Solving Connected Dominating Set Faster Than 2n.................... 152
Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
Linear-Time Algorithms for Two Subtree-Comparison Problems
on Phylogenetic Trees with Different Species ......................... 164
Sun-Yuan Hsieh
Computationally Sound Symbolic Secrecy in the Presence of Hash
Functions ........................................................ 176
V´eronique Cortier, Steve Kremer, Ralf Ku¨sters, Bogdan Warinschi
Some Results on Average-Case Hardness Within the Polynomial
Hierarchy ........................................................ 188
A. Pavan, Rahul Santhanam, N.V. Vinodchandran
Unbiased Rounding of Rational Matrices............................. 200
Benjamin Doerr, Christian Klein
Contributed Papers – Track B
Rational Behaviour and Strategy Construction in Infinite Multiplayer
Games........................................................... 212
Michael Ummels
The Anatomy of Innocence Revisited ................................ 224
Russ Harmer, Olivier Laurent
Testing Probabilistic Equivalence Through Reinforcement Learning...... 236
Jos´ee Desharnais, Franc¸ois Laviolette, Sami Zhioua
On Decidability of LTL Model Checking for Process Rewrite Systems.... 248
Laura Bozzelli, Mojm´ır Kˇret´ınsk´y, Vojtˇech Rˇeh´ak, Jan Strejˇcek
Monitoring of Real-Time Properties ................................. 260
Andreas Bauer, Martin Leucker, Christian Schallhart
