26. FSTTCS 2006: Kolkata, India

Invited Papers

• Gérard Boudol:
  Shared-Variable Concurrency: A Proposal. 1-3
  
• Gordon D. Plotkin:
  Hennessy-Plotkin-Brookes Revisited. 4
  
• Chaitanya Swamy, David B. Shmoys:
  Approximation Algorithms for 2-Stage Stochastic Optimization Problems. 5-19
  
• Emo Welzl:
  The Number of Crossing Free Configurations on Finite Point Sets in the Plane. 20
  

Contributed Papers - Track A

• Tamal K. Dey, Jian Sun:
  Normal and Feature Approximations from Noisy Point Clouds. 21-32
  
• Sariel Har-Peled:
  Coresets for Discrete Integration and Clustering. 33-44
  
• Florent Becker, Ivan Rapaport, Eric Rémila:
  Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time. 45-56
  
• Tanmoy Chakraborty, Samir Datta:
  One-Input-Face MPCVP Is Hard for L, But in LogDCFL. 57-68
  
• K. Murali Krishnan, L. Sunil Chandran:
  Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs. 69-80
  
• Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis:
  Multi-stack Boundary Labeling Problems. 81-92
  
• Pankaj K. Agarwal, Sergio Cabello, Joan Antoni Sellarès, Micha Sharir:
  Computing a Center-Transversal Line. 93-104
  
• Shankar Kalyanaraman, Christopher Umans:
  On Obtaining Pseudorandomness from Error-Correcting Codes. 105-116
  
• Gruia Calinescu, Michael J. Pelsmajer:
  Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance. 117-128
  
• Sourav Chakraborty, Jaikumar Radhakrishnan, Nandakumar Raghunathan, Prashant Sasatte:
  Zero Error List-Decoding Capacity of the q/(q-1) Channel. 129-138
  
• Sushmita Gupta, Venkatesh Raman, Saket Saurabh:
  Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems. 139-151
  
• Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch:
  Solving Connected Dominating Set Faster Than 2ⁿ. 152-163
  
• Sun-Yuan Hsieh:
  Linear-Time Algorithms for Two Subtree-Comparison Problems on Phylogenetic Trees with Different Species. 164-175
  
• Véronique Cortier, Steve Kremer, Ralf Küsters, Bogdan Warinschi:
  Computationally Sound Symbolic Secrecy in the Presence of Hash Functions. 176-187
  
• Aduri Pavan, Rahul Santhanam, N. V. Vinodchandran:
  Some Results on Average-Case Hardness Within the Polynomial Hierarchy. 188-199
  
• Benjamin Doerr, Christian Klein:
  Unbiased Rounding of Rational Matrices. 200-211
  

Contributed Papers - Track B

• Michael Ummels:
  Rational Behaviour and Strategy Construction in Infinite Multiplayer Games. 212-223
  
• Russell Harmer, Olivier Laurent:
  The Anatomy of Innocence Revisited. 224-235
  
• Josee Desharnais, François Laviolette, Sami Zhioua:
  Testing Probabilistic Equivalence Through Reinforcement Learning. 236-247
  
• Laura Bozzelli, Mojmír Kretínský, Vojtech Rehák, Jan Strejcek:
  On Decidability of LTL Model Checking for Process Rewrite Systems. 248-259
  
• Andreas Bauer, Martin Leucker, Christian Schallhart:
  Monitoring of Real-Time Properties. 260-272
  
• Christian Dax, Martin Hofmann, Martin Lange:
  A Proof System for the Linear Time µ-Calculus. 273-284
  
• Thierry Cachat:
  Tree Automata Make Ordinal Theory Easy. 285-296
  
• Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas:
  Context-Sensitive Dependency Pairs. 297-308
  
• Marcus Größer, Gethin Norman, Christel Baier, Frank Ciesinski, Marta Z. Kwiatkowska, David Parker:
  On Reduction Criteria for Probabilistic Reward Models. 309-320
  
• Paul Gastin, Nathalie Sznajder, Marc Zeitoun:
  Distributed Synthesis for Well-Connected Architectures. 321-332
  
• Mohammad Reza Mousavi, Iain C. C. Phillips, Michel A. Reniers, Irek Ulidowski:
  The Meaning of Ordered SOS. 333-344
  
• Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey, Jacob Illum Rasmussen:
  Almost Optimal Strategies in One Clock Priced Timed Games. 345-356
  
• Didier Galmiche, Dominique Larchey-Wendling:
  Expressivity Properties of Boolean. 357-368
  
• Fabrice Chevalier, Deepak D'Souza, Pavithra Prabhakar:
  On Continuous Timed Automata with Input-Determined Guards. 369-380
  
• Ranko Lazic:
  Safely Freezing LTL. 381-392
  
• Rajeev Alur, Swarat Chaudhuri:
  Branching Pushdown Tree Automata. 393-404
  
• Gary Wassermann, Zhendong Su:
  Validity Checking for Finite Automata over Linear Arithmetic Constraints. 405-416
  
• James Laird:
  Game Semantics for Higher-Order Concurrency. 417-428
  

Last update Tue Feb 14 03:56:30 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page