Pages that link to "Item:Q5385967"

The following pages link to FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science (Q5385967):

Displaying 36 items.

• Approximation Algorithms for 2-Stage Stochastic Optimization Problems (Q5385968) (← links)
• The Number of Crossing Free Configurations on Finite Point Sets in the Plane (Q5385969) (← links)
• Normal and Feature Approximations from Noisy Point Clouds (Q5385970) (← links)
• Coresets for Discrete Integration and Clustering (Q5385971) (← links)
• Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time (Q5385972) (← links)
• One-Input-Face MPCVP Is Hard for L, But in LogDCFL (Q5385973) (← links)
• Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs (Q5385974) (← links)
• Multi-stack Boundary Labeling Problems (Q5385975) (← links)
• Computing a Center-Transversal Line (Q5385976) (← links)
• On Obtaining Pseudorandomness from Error-Correcting Codes (Q5385977) (← links)
• Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance (Q5385978) (← links)
• Zero Error List-Decoding Capacity of the q/(q–1) Channel (Q5385980) (← links)
• Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems (Q5385981) (← links)
• Solving Connected Dominating Set Faster Than 2 n (Q5385982) (← links)
• Linear-Time Algorithms for Two Subtree-Comparison Problems on Phylogenetic Trees with Different Species (Q5385983) (← links)
• Computationally Sound Symbolic Secrecy in the Presence of Hash Functions (Q5385984) (← links)
• Some Results on Average-Case Hardness Within the Polynomial Hierarchy (Q5385985) (← links)
• Unbiased Rounding of Rational Matrices (Q5385986) (← links)
• Rational Behaviour and Strategy Construction in Infinite Multiplayer Games (Q5385987) (← links)
• The Anatomy of Innocence Revisited (Q5385988) (← links)
• Testing Probabilistic Equivalence Through Reinforcement Learning (Q5385989) (← links)
• On Decidability of LTL Model Checking for Process Rewrite Systems (Q5385990) (← links)
• Monitoring of Real-Time Properties (Q5385991) (← links)
• A Proof System for the Linear Time μ-Calculus (Q5385992) (← links)
• Tree Automata Make Ordinal Theory Easy (Q5385993) (← links)
• Context-Sensitive Dependency Pairs (Q5385994) (← links)
• On Reduction Criteria for Probabilistic Reward Models (Q5385995) (← links)
• Distributed Synthesis for Well-Connected Architectures (Q5385996) (← links)
• The Meaning of Ordered SOS (Q5385997) (← links)
• Almost Optimal Strategies in One Clock Priced Timed Games (Q5385998) (← links)
• Expressivity Properties of Boolean BI Through Relational Models (Q5385999) (← links)
• On Continuous Timed Automata with Input-Determined Guards (Q5386000) (← links)
• Safely Freezing LTL (Q5386001) (← links)
• Branching Pushdown Tree Automata (Q5386002) (← links)
• Validity Checking for Finite Automata over Linear Arithmetic Constraints (Q5386003) (← links)
• Game Semantics for Higher-Order Concurrency (Q5386004) (← links)