LEADER 05659nam 22008175 450 001 9910483189703321 005 20251226200209.0 010 $a3-540-49995-4 024 7 $a10.1007/11944836 035 $a(CKB)1000000000283857 035 $a(SSID)ssj0000317816 035 $a(PQKBManifestationID)11208042 035 $a(PQKBTitleCode)TC0000317816 035 $a(PQKBWorkID)10307489 035 $a(PQKB)10971062 035 $a(DE-He213)978-3-540-49995-4 035 $a(MiAaPQ)EBC3068580 035 $a(PPN)123139910 035 $a(BIP)34164529 035 $a(BIP)13888200 035 $a(EXLCZ)991000000000283857 100 $a20100301d2006 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aFSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science $e26th International Conference, Kolkata, India, December 13-15, 2006, Proceedings /$fedited by S. Arun-Kumar, Naveen Garg 205 $a1st ed. 2006. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2006. 215 $a1 online resource (XIII, 434 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4337 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-49994-6 320 $aIncludes bibliographical references and index. 327 $aInvited Papers -- Shared-Variable Concurrency: A Proposal -- Hennessy-Plotkin-Brookes Revisited -- Approximation Algorithms for 2-Stage Stochastic Optimization Problems -- The Number of Crossing Free Configurations on Finite Point Sets in the Plane -- Contributed Papers ? Track A -- Normal and Feature Approximations from Noisy Point Clouds -- Coresets for Discrete Integration and Clustering -- Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time -- One-Input-Face MPCVP Is Hard for L, But in LogDCFL -- Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs -- Multi-stack Boundary Labeling Problems -- Computing a Center-Transversal Line -- On Obtaining Pseudorandomness from Error-Correcting Codes -- Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance -- Zero Error List-Decoding Capacity of the q/(q?1) Channel -- Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems -- Solving Connected Dominating Set Faster Than 2 n -- Linear-Time Algorithms for Two Subtree-Comparison Problems on Phylogenetic Trees with Different Species -- Computationally Sound Symbolic Secrecy in the Presence of Hash Functions -- Some Results on Average-Case Hardness Within the Polynomial Hierarchy -- Unbiased Rounding of Rational Matrices -- Contributed Papers ? Track B -- Rational Behaviour and Strategy Construction in Infinite Multiplayer Games -- The Anatomy of Innocence Revisited -- Testing Probabilistic Equivalence Through Reinforcement Learning -- On Decidability of LTL Model Checking for Process Rewrite Systems -- Monitoring of Real-Time Properties -- A Proof System for the Linear Time ?-Calculus -- Tree Automata Make Ordinal Theory Easy -- Context-Sensitive Dependency Pairs -- On Reduction Criteriafor Probabilistic Reward Models -- Distributed Synthesis for Well-Connected Architectures -- The Meaning of Ordered SOS -- Almost Optimal Strategies in One Clock Priced Timed Games -- Expressivity Properties of Boolean BI Through Relational Models -- On Continuous Timed Automata with Input-Determined Guards -- Safely Freezing LTL -- Branching Pushdown Tree Automata -- Validity Checking for Finite Automata over Linear Arithmetic Constraints -- Game Semantics for Higher-Order Concurrency. 330 $aThis book constitutes the refereed proceedings of the 26th International Conference on the Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2006, held in Kolkata, India, in December 2006. It contains 38 papers that cover a broad variety of current topics from the theory of computing, ranging from formal methods, discrete mathematics, complexity theory, and automata theory to theoretical computer science in general. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4337 606 $aApplication software 606 $aComputer science 606 $aCompilers (Computer programs) 606 $aMachine theory 606 $aAlgorithms 606 $aComputer and Information Systems Applications 606 $aComputer Science Logic and Foundations of Programming 606 $aCompilers and Interpreters 606 $aFormal Languages and Automata Theory 606 $aAlgorithms 606 $aTheory of Computation 615 0$aApplication software. 615 0$aComputer science. 615 0$aCompilers (Computer programs). 615 0$aMachine theory. 615 0$aAlgorithms. 615 14$aComputer and Information Systems Applications. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aCompilers and Interpreters. 615 24$aFormal Languages and Automata Theory. 615 24$aAlgorithms. 615 24$aTheory of Computation. 676 $a005.1 701 $aArun-Kumar$b S$01384963 701 $aGarg$b Naveen$01220495 712 12$aConference on Foundations of Software Technology and Theoretical Computer Science 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483189703321 996 $aFSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science$94522358 997 $aUNINA