Preliminary Programme (13, 14 and 15 December 2006) (A 2day schedule has also been put up in case 14 Dec has to be washed off due to a strike by Trade Unions.) Click here for the 2day programme 

13 Dec 2006  
8:309:30  Registration  
Invited Talk 9:3010:30 
HennessyPlotkinBrookes Revisited G. D. Plotkin Chair: S. ArunKumar 

10:3011:00  Tea/Coffee  
Session  A1.1 Chair: Naveen Garg  B1.1 Chair: Kamal Lodaya 
11:0011:30  Selfassembling classes of shapes, fast and with a minimal number of tiles F Becker, I Rapaport and E Rémila 
The Meaning of Ordered SOS M.R. Mousavi, I.C.C. Phillips, M.A. Reniers and I. Ulidowski 
11:3012:00  Hardness of Approximation results for the problem of finding the Stopping Distance in Tanner Graphs K. Murali Krishnan, L. Sunil Chandran 
The anatomy of innocence revisited R. Harmer and O. Laurent 
12:0012:30  Fast edge colorings with fixed number of colors to minimize imbalance G. Calinescu and M.J. Pelsmajer 
ContextSensitive Dependency Pairs B. Alarcón, R. Gutiérrez, and S. Lucas 
12:3013:30  Lunch  
Invited Talk 13:3014:30 
The Number of Crossing Free Configurations on Finite Point Sets Emo Welzl Chair: Naveen Garg 

14:3015:00  Tea/Coffee  
Session  A1.2 Chair: Manindra Agrawal  B1.2 Chair: Paritosh Pandya 
15:0015:30  Oneinputface MPCVP is Hard for L, but in LogDCFL T. Chakraborty and S. Datta 
On Decidability of LTL Model Checking for Process Rewrite Systems L. Bozzelli, M. Kretinsky, V. Rehak and J. Strejcek 
15:3016:00  Computationally Sound Symbolic Secrecy in the Presence of Hash Functions V Cortier, S. Kremer, R. Kusters and B. Warinschi 
Safely Freezing LTL R. Lazić 
16:0016:30  Some Results on Averagecase Hardness Within the Polynomial Hierarchy A. Pavan, R. Santhanam and V. Vinodchandran 
Distributed synthesis for wellconnected architectures P. Gastin, N. Sznajder and M. Zeitoun 
Business Meeting  
Conference Banquet  
14 Dec 2006  
8:309:30  Registration  
Invited Talk 9:3010:30 
SharedVariable Concurrency: A Proposal G. Boudol Chair: Madhavan Mukund 

10:3011:00  Tea/Coffee  
Session  A2.1 Chair: Yuval Rabani  B2.1 Chair: Astrid Kiehn 
11:0011:30  MultiStack Boundary Labeling Problems M. A. Bekos, M. Kaufmann, K. Potika and A. Symvonis 
Game semantics For HigherOrder Concurrency Jim Laird 
11:3012:00  Lineartime Algorithms for Two SubtreeComparison Problems on Phylogenetic Trees with Different Species SunYuan Hsieh 
Rational Behaviour and Strategy Construction in Infinite Multiplayer Games M. Ummels 
12:0012:30  Unbiased Rounding of Rational Matrices B. Doerr, C. Klein 
Testing Probabilistic Equivalence through Reinforcement Learning J. Desharnais, F. Laviolette and S. Zhioua 
12:3013:30  Lunch  
Invited Talk 13:3014:30 
Approximate Algorithms for 2stage Stochastic Optimization David B. Shmoys Chair: Amit Kumar 

14:3015:00  Tea/Coffee  
Session  A2.2 Chair: Rana Barua  B2.2 Chair: Sanjiva Prasad 
15:0015:30  On obtaining pseudorandomness from errorcorrecting codes S Kalyanaraman and C Umans 
Branching pushdown tree automata R. Alur, S. Chaudhuri 
15:3016:00  Zeroerror list decoding capacity of the q/(q1) channel Sourav Chakraborty, Jaikumar Radhakrishnan, Nandakumar Raghunathan and Prashant Sasatte 
Tree automata make ordinal theory easy T Cachat 
16:0016:30  Expressivity properties of Boolean BI through relational models D. Galmiche and D. LarcheyWendling 

15 Dec 2006  
8:309:30  Registration  
Invited Talk 9:3010:30 
All That Noise! Eugene Asarin Chair: Deepak D'Souza 

10:3011:00  Tea/Coffee  
Session  A3.1 Chair: Sudeb Pal  B3.1 Chair: Supratik Chakraborty 
11:0011:30  Normal and Feature Approximations from Noisy Point Clouds Tamal K. Dey and Jian Sun 
On continuous timed automata with inputdetermined guards F. Chevalier, D. D'Souza and P. Prabhakar 
11:3012:00  Coresets for Discrete Integration and Clustering S. HarPeled 
Almost Optimal Strategies in One Clock Priced Timed Automata P. Bouyer, K. G. Larsen, N. Markey, J. I. Rasmussen 
12:0012:30  Computing a CenterTransversal Line P. K. Agarwal, S. Cabello, J. A. Sellarès and M. Sharir 
Monitoring of Realtime Properties A. Bauer, M. Leucker, C. Schallhart 
12:3013:30  Lunch  
Sponsor's Talk 14:0014:30 

IBMIRL  
14:3015:00  Tea/Coffee  
Session  A3.2 Chair: Bhabhani P Sinha  B3.2 Chair: Narayan Kumar 
15:0015:30  Fast Exponential Algorithms for Maximum rRegular Induced Subgraph Problems S. Gupta, V. Raman and S. Saurabh 
On reduction criteria for probabilistic reward models M. Groesser, G. Norman, C. Baier, F. Ciesinski, M. Kwiatkowska and D. Parker 
15:3016:00  Solving Connected Dominating Set Faster than 2^n F. V. Fomin, F. Grandoni and D. Kratsch 
Validity Checking for Finite Automata over Linear Arithmetic Constraints G. Wassermann, Z. Su 
16:0016:30  A Proof System for the Linear Time μCalculus C Dax and M Hofmann and M Lange 
Alternative Programme (13 and 15 December 2006) 

13 Dec 2006  
8:009:00  Registration  
Invited Talk 9:0010:00 
HennessyPlotkinBrookes Revisited G. D. Plotkin Chair: S. ArunKumar 

10:0010:15  
Session  A1.1 Chair: Naveen Garg  B1.1 Chair: Kamal Lodaya 
10:1510:40  Selfassembling classes of shapes, fast and with a minimal number of tiles F Becker, I Rapaport and E Rémila 
The Meaning of Ordered SOS M.R. Mousavi, I.C.C. Phillips, M.A. Reniers and I. Ulidowski 
10:4011:05  Hardness of Approximation results for the problem of finding the Stopping Distance in Tanner Graphs K. Murali Krishnan, L. Sunil Chandran 
The anatomy of innocence revisited R. Harmer and O. Laurent 
10:0511:30  Fast edge colorings with fixed number of colors to minimize imbalance G. Calinescu and M.J. Pelsmajer 
ContextSensitive Dependency Pairs B. Alarcón, R. Gutiérrez, and S. Lucas 
11:3012:00  Tea/Coffee  
Invited Talk 12:0013:00 
The Number of Crossing Free Configurations on Finite Point Sets Emo Welzl Chair: Naveen Garg 

13:0014:00  Lunch  
Session  A1.2 Chair: Manindra Agrawal  B1.2 Chair: Paritosh Pandya 
14:0014:25  Oneinputface MPCVP is Hard for L, but in LogDCFL T. Chakraborty and S. Datta 
On Decidability of LTL Model Checking for Process Rewrite Systems L. Bozzelli, M. Kretinsky, V. Rehak and J. Strejcek 
14:2514:50  Computationally Sound Symbolic Secrecy in the Presence of Hash Functions V Cortier, S. Kremer, R. Kusters and B. Warinschi 
Safely Freezing LTL R. Lazić 
14:5015:15  Some Results on Averagecase Hardness Within the Polynomial Hierarchy A. Pavan, R. Santhanam and V. Vinodchandran 
Distributed synthesis for wellconnected architectures P. Gastin, N. Sznajder and M. Zeitoun 
15:1515:45  Tea/Coffee  
Invited Talk 15:4516:45 
SharedVariable Concurrency: A Proposal G. Boudol Chair: Madhavan Mukund 

16:4517:00  
Session  A2.1 Chair: Yuval Rabani  B2.1 Chair: Astrid Kiehn 
17:0017:25  MultiStack Boundary Labeling Problems M. A. Bekos, M. Kaufmann, K. Potika and A. Symvonis 
Game semantics For HigherOrder Concurrency Jim Laird 
17:2517:50  Lineartime Algorithms for Two SubtreeComparison Problems on Phylogenetic Trees with Different Species SunYuan Hsieh 
Rational Behaviour and Strategy Construction in Infinite Multiplayer Games M. Ummels 
17:5018:15  Unbiased Rounding of Rational Matrices B. Doerr, C. Klein 
Testing Probabilistic Equivalence through Reinforcement Learning J. Desharnais, F. Laviolette and S. Zhioua 
Business Meeting  
Conference Banquet  
15 Dec 2006  
8:009:00  Registration  
Invited Talk 9:0010:00 
All That Noise! Eugene Asarin Chair: Deepak D'Souza 

10:0010:15  
Session  A3.1 Chair: Sudeb Pal  B3.1 Chair: Supratik Chakraborty 
10:1510:40  Normal and Feature Approximations from Noisy Point Clouds Tamal K. Dey and Jian Sun 
On continuous timed automata with inputdetermined guards F. Chevalier, D. D'Souza and P. Prabhakar 
10:4011:05  Coresets for Discrete Integration and Clustering S. HarPeled 
Almost Optimal Strategies in One Clock Priced Timed Automata P. Bouyer, K. G. Larsen, N. Markey, J. I. Rasmussen 
10:0511:30  Computing a CenterTransversal Line P. K. Agarwal, S. Cabello, J. A. Sellarès and M. Sharir 
Monitoring of Realtime Properties A. Bauer, M. Leucker, C. Schallhart 
11:3012:00  Tea/Coffee  
Invited Talk 12:0013:00 
Approximate Algorithms for 2stage Stochastic Optimization David B. Shmoys Chair: Amit Kumar 

13:0014:00  Lunch  
14:0014:30  Sponsor's Talk: IBMIRL  
14:3014:45  
Session  A3.2 Chair: Bhabhani P Sinha  B3.2 Chair: Narayan Kumar 
14:4515:10  Fast Exponential Algorithms for Maximum rRegular Induced Subgraph Problems S. Gupta, V. Raman and S. Saurabh 
On reduction criteria for probabilistic reward models M. Groesser, G. Norman, C. Baier, F. Ciesinski, M. Kwiatkowska and D. Parker 
15:1015:35  Solving Connected Dominating Set Faster than 2^n F. V. Fomin, F. Grandoni and D. Kratsch 
Validity Checking for Finite Automata over Linear Arithmetic Constraints G. Wassermann, Z. Su 
15:3516:00  A Proof System for the Linear Time μCalculus C Dax and M Hofmann and M Lange 

16:0016:30  Tea/Coffee  
Session  A2.2 Chair: Rana Barua  B2.2 Chair: Sanjiva Prasad 
16:3016:55  On obtaining pseudorandomness from errorcorrecting codes S Kalyanaraman and C Umans 
Branching pushdown tree automata R. Alur, S. Chaudhuri 
16:5517:20  Zeroerror list decoding capacity of the q/(q1) channel Sourav Chakraborty, Jaikumar Radhakrishnan, Nandakumar Raghunathan and Prashant Sasatte 
Tree automata make ordinal theory easy T Cachat 
17:2017:45  Expressivity properties of Boolean BI through relational models D. Galmiche and D. LarcheyWendling 