26. FSTTCS 2006:
Kolkata,
India
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.
Lecture Notes in Computer Science 4337 Springer 2006, ISBN 3-540-49994-6 BibTeX
Invited Papers
Contributed Papers - Track A
- Tamal K. Dey, Jian Sun:
Normal and Feature Approximations from Noisy Point Clouds.
21-32
Electronic Edition (link) BibTeX
- Sariel Har-Peled:
Coresets for Discrete Integration and Clustering.
33-44
Electronic Edition (link) BibTeX
- Florent Becker, Ivan Rapaport, Eric Rémila:
Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time.
45-56
Electronic Edition (link) BibTeX
- Tanmoy Chakraborty, Samir Datta:
One-Input-Face MPCVP Is Hard for L, But in LogDCFL.
57-68
Electronic Edition (link) BibTeX
- K. Murali Krishnan, L. Sunil Chandran:
Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs.
69-80
Electronic Edition (link) BibTeX
- Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis:
Multi-stack Boundary Labeling Problems.
81-92
Electronic Edition (link) BibTeX
- Pankaj K. Agarwal, Sergio Cabello, Joan Antoni Sellarès, Micha Sharir:
Computing a Center-Transversal Line.
93-104
Electronic Edition (link) BibTeX
- Shankar Kalyanaraman, Christopher Umans:
On Obtaining Pseudorandomness from Error-Correcting Codes.
105-116
Electronic Edition (link) BibTeX
- Gruia Calinescu, Michael J. Pelsmajer:
Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance.
117-128
Electronic Edition (link) BibTeX
- Sourav Chakraborty, Jaikumar Radhakrishnan, Nandakumar Raghunathan, Prashant Sasatte:
Zero Error List-Decoding Capacity of the q/(q-1) Channel.
129-138
Electronic Edition (link) BibTeX
- Sushmita Gupta, Venkatesh Raman, Saket Saurabh:
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems.
139-151
Electronic Edition (link) BibTeX
- Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch:
Solving Connected Dominating Set Faster Than 2n.
152-163
Electronic Edition (link) BibTeX
- Sun-Yuan Hsieh:
Linear-Time Algorithms for Two Subtree-Comparison Problems on Phylogenetic Trees with Different Species.
164-175
Electronic Edition (link) BibTeX
- Véronique Cortier, Steve Kremer, Ralf Küsters, Bogdan Warinschi:
Computationally Sound Symbolic Secrecy in the Presence of Hash Functions.
176-187
Electronic Edition (link) BibTeX
- Aduri Pavan, Rahul Santhanam, N. V. Vinodchandran:
Some Results on Average-Case Hardness Within the Polynomial Hierarchy.
188-199
Electronic Edition (link) BibTeX
- Benjamin Doerr, Christian Klein:
Unbiased Rounding of Rational Matrices.
200-211
Electronic Edition (link) BibTeX
Contributed Papers - Track B
- Michael Ummels:
Rational Behaviour and Strategy Construction in Infinite Multiplayer Games.
212-223
Electronic Edition (link) BibTeX
- Russell Harmer, Olivier Laurent:
The Anatomy of Innocence Revisited.
224-235
Electronic Edition (link) BibTeX
- Josee Desharnais, François Laviolette, Sami Zhioua:
Testing Probabilistic Equivalence Through Reinforcement Learning.
236-247
Electronic Edition (link) BibTeX
- Laura Bozzelli, Mojmír Kretínský, Vojtech Rehák, Jan Strejcek:
On Decidability of LTL Model Checking for Process Rewrite Systems.
248-259
Electronic Edition (link) BibTeX
- Andreas Bauer, Martin Leucker, Christian Schallhart:
Monitoring of Real-Time Properties.
260-272
Electronic Edition (link) BibTeX
- Christian Dax, Martin Hofmann, Martin Lange:
A Proof System for the Linear Time µ-Calculus.
273-284
Electronic Edition (link) BibTeX
- Thierry Cachat:
Tree Automata Make Ordinal Theory Easy.
285-296
Electronic Edition (link) BibTeX
- Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas:
Context-Sensitive Dependency Pairs.
297-308
Electronic Edition (link) BibTeX
- Marcus Größer, Gethin Norman, Christel Baier, Frank Ciesinski, Marta Z. Kwiatkowska, David Parker:
On Reduction Criteria for Probabilistic Reward Models.
309-320
Electronic Edition (link) BibTeX
- Paul Gastin, Nathalie Sznajder, Marc Zeitoun:
Distributed Synthesis for Well-Connected Architectures.
321-332
Electronic Edition (link) BibTeX
- Mohammad Reza Mousavi, Iain C. C. Phillips, Michel A. Reniers, Irek Ulidowski:
The Meaning of Ordered SOS.
333-344
Electronic Edition (link) BibTeX
- Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey, Jacob Illum Rasmussen:
Almost Optimal Strategies in One Clock Priced Timed Games.
345-356
Electronic Edition (link) BibTeX
- Didier Galmiche, Dominique Larchey-Wendling:
Expressivity Properties of Boolean.
357-368
Electronic Edition (link) BibTeX
- Fabrice Chevalier, Deepak D'Souza, Pavithra Prabhakar:
On Continuous Timed Automata with Input-Determined Guards.
369-380
Electronic Edition (link) BibTeX
- Ranko Lazic:
Safely Freezing LTL.
381-392
Electronic Edition (link) BibTeX
- Rajeev Alur, Swarat Chaudhuri:
Branching Pushdown Tree Automata.
393-404
Electronic Edition (link) BibTeX
- Gary Wassermann, Zhendong Su:
Validity Checking for Finite Automata over Linear Arithmetic Constraints.
405-416
Electronic Edition (link) BibTeX
- James Laird:
Game Semantics for Higher-Order Concurrency.
417-428
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:12:57 2009
by Michael Ley (ley@uni-trier.de)
