Indian Statistical Institute

Kolkata, INDIA

**Paperno:**003**Title:**Rational Behaviour and Strategy Construction in Infinite Multiplayer Games**Authors:**M. Ummels**Paperno:**015**Title:**Normal and Feature Approximations from Noisy Point Clouds**Authors:**Tamal K. Dey and Jian Sun**Paperno:**023**Title:**Coresets for Discrete Integration and Clustering**Authors:**S. Har-Peled**Paperno:**034**Title:**The anatomy of innocence revisited**Authors:**R. Harmer, O. Laurent**Paperno:**037**Title:**Self-assembling classes of shapes, fast and with a minimal number of tiles**Authors:**F Becker, I Rapaport, E Rémila**Paperno:**038**Title:**Testing Probabilistic Equivalence through Reinforcement Learning**Authors:**J. Desharnais, F. Laviolette, S. Zhioua**Paperno:**058**Title:**One-input-face MPCVP is Hard for L, but in LogDCFL**Authors:**T. Chakraborty, S. Datta**Paperno:**064**Title:**On Decidability of LTL Model Checking for Process Rewrite Systems**Authors:**L. Bozzelli, M. Kretinsky, V. Rehak, and J. Strejcek**Paperno:**077**Title:**Hardness of Approximation results for the problem of finding the Stopping Distance in Tanner Graphs**Authors:**K. Murali Krishnan, L. Sunil Chandran**Paperno:**079**Title:**Multi-Stack Boundary Labeling Problems**Authors:**M. A. Bekos, M. Kaufmann, K. Potika, A. Symvonis**Paperno:**080**Title:**Computing a Center-Transversal Line**Authors:**P. K. Agarwal, S. Cabello, J. A. Sellarès, and M. Sharir**Paperno:**108**Title:**On obtaining pseudorandomness from error-correcting codes**Authors:**S Kalyanaraman and C Umans**Paperno:**110**Title:**Fast edge colorings with fixed number of colors to minimize imbalance**Authors:**G. Calinescu and M.J. Pelsmajer**Paperno:**118**Title:**Zero-error list decoding capacity of the*q/(q-1)*channel**Authors:**Sourav Chakraborty, Jaikumar Radhakrishnan, Nandakumar Raghunathan, Prashant Sasatte**Paperno:**145**Title:**Monitoring of Realtime Properties**Authors:**A. Bauer, M. Leucker, C. Schallhart**Paperno:**158**Title:**Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems**Authors:**S. Gupta, V. Raman and S. Saurabh**Paperno:**199**Title:**A Proof System for the Linear Time μ-Calculus**Authors:**C Dax and M Hofmann and M Lange**Paperno:**201**Title:**Tree automata make ordinal theory easy**Authors:**T Cachat**Paperno:**204**Title:**Solving Connected Dominating Set Faster than*2*^{n}**Authors:**F. V. Fomin, F. Grandoni, and D. Kratsch**Paperno:**206**Title:**Linear-time Algorithms for Two Subtree-Comparison Problems on Phylogenetic Trees with Different Species**Authors:**Sun-Yuan Hsieh**Paperno:**207**Title:**Context-Sensitive Dependency Pairs**Authors:**B. Alarcón, R. Gutiérrez, and S. Lucas**Paperno:**213**Title:**On reduction criteria for probabilistic reward models**Authors:**M. Groesser, G. Norman, C. Baier, F. Ciesinski, M. Kwiatkowska, D. Parker**Paperno:**215**Title:**Distributed synthesis for well-connected architectures**Authors:**P. Gastin, N. Sznajder, M. Zeitoun**Paperno:**231**Title:**The Meaning of Ordered SOS**Authors:**M.R. Mousavi, I.C.C. Phillips, M.A. Reniers, I. Ulidowski**Paperno:**232**Title:**Almost Optimal Strategies in One Clock Priced Timed Automata**Authors:**P. Bouyer, K. G. Larsen, N. Markey, J. I. Rasmussen**Paperno:**234**Title:**Expressivity properties of Boolean BI through relational models**Authors:**D. Galmiche and D. Larchey-Wendling**Paperno:**241**Title:**Computationally Sound Symbolic Secrecy in the Presence of Hash Functions**Authors:**V Cortier, S. Kremer, R. Kusters, B. Warinschi**Paperno:**242**Title:**Some Results on Average-case Hardness Within the Polynomial Hierarchy**Authors:**A. Pavan, R. Santhanam, V. Vinodchandran**Paperno:**250**Title:**On continuous timed automata with input-determined guards**Authors:**F. Chevalier, D. D'Souza, P. Prabhakar**Paperno:**257**Title:**Unbiased Rounding of Rational Matrices**Authors:**B. Doerr, C. Klein**Paperno:**260**Title:**Branching pushdown tree automata**Authors:**R. Alur, S. Chaudhuri**Paperno:**264**Title:**Validity Checking for Finite Automata over Linear Arithmetic Constraints**Authors:**G. Wassermann, Z. Su**Paperno:**267**Title:**Game semantics For Higher-Order Concurrency**Authors:**Jim Laird

Last modified: Tue Nov 7 15:06:30 2006