FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science  26th International Conference, Kolkata, India, December 13-15, 2006, Proceedings /  [electronic resource] : 
edited by S. Arun-Kumar, Naveen Garg. 
 - 1st ed. 2006. 
 - XIII, 434 p.  online resource. 
 - Theoretical Computer Science and General Issues,  4337  2512-2029 ; .
 - Theoretical Computer Science and General Issues,  4337 .
<br/><br/>Invited 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. 
<br/><br/><label>ISBN: </label>9783540499954 
<br/><br/><label>Standard No.: </label>10.1007/11944836  doi 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Application software.<br/>Computer science.<br/>Compilers (Computer programs).<br/>Machine theory.<br/>Algorithms.<br/>Computer and Information Systems Applications.<br/>Computer Science Logic and Foundations of Programming.<br/>Compilers and Interpreters.<br/>Formal Languages and Automata Theory.<br/>Algorithms.<br/>Theory of Computation.
<br/><br/><label>LC Class. No.: </label>QA76.76.A65 
<br/><br/><label>Dewey Class. No.: </label>005.3