FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science

26th International Conference, Kolkata, India, December 13-15, 2006, Proceedings

AvS. Arun-Kumar,Naveen Garg

Häftad, Engelska, 2006

Del i serien Lecture Notes in Computer Science

573 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This 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.

Produktinformation

Utgivningsdatum:2006-11-27
Mått:155 x 235 x 25 mm
Vikt:680 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:434
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540499947

Utforska kategorier

Affärsapplikationer inom Data och IT

Innehållsförteckning

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.

Du kanske också är intresserad av

FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science

Naveen Garg, S. Arun-Kumar

E-bok

2006

739 kr

Handbook of Vibroacoustics, Noise and Harshness

Naveen Garg, Chitra Gautam, Shanay Rab, Meher Wan, Ravinder Agarwal, Sanjay Yadav

Inbunden, 2024

6 600 kr

Recent Advances in Metrology

Venu Gopal Achanta, Harish Kumar, Shiv Kumar Jaiswal, Shankar G. Aggarwal, Naveen Garg, Sanjay Yadav

E-bok

2023

3 148 kr

Environmental Noise Control

Naveen Garg

E-bok

2022

2 340 kr

Building Acoustics and Noise Control Engineering

Naveen Garg, Chitra Gautam

Inbunden, 2026

2 476 kr

Building Acoustics and Noise Control Engineering

Chitra Gautam, Naveen Garg

E-bok

2026

989 kr

Advances in Engineering Design

Sachin S. Gautam, Naveen Garg, Ravindra Kannojiya, Rohit Sharma

E-bok

2023

2 384 kr

Recent Advances in Metrology: Select Proceedings of Admet 2022

Sanjay Yadav, Naveen Garg

Inbunden, 2023

3 850 kr

Del 906

Recent Advances in Metrology

Sanjay Yadav, K.P. Chaudhary, Ajay Gahlot, Yogendra Arya, Aman Dahiya, Naveen Garg

Inbunden, 2022

2 534 kr

Advances in Metrology

Sanjay Yadav, Naveen Garg, Mukesh Kumar, Shankar G. Aggarwal, Shiv Kumar Jaiswal, Manoj Kumar

Häftad, 2025

1 875 kr

FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science

26th International Conference, Kolkata, India, December 13-15, 2006, Proceedings

AvS. Arun-Kumar,Naveen Garg

Häftad, Engelska, 2006

Del i serien Lecture Notes in Computer Science

573 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

Produktinformation

Utgivningsdatum:2006-11-27
Mått:155 x 235 x 25 mm
Vikt:680 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:434
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540499947

Utforska kategorier

Affärsapplikationer inom Data och IT

Innehållsförteckning

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.