ESTTCS2006：软件技术与理论计算机学基础/会议录LNCS-4337: FSTTCS 2006
点此进入淘宝搜索页搜索分類: 图书,进口原版书,科学与技术 Science & Techology ,
作者： S. Arun-Kumar 著
出 版 社： 湖南文艺出版社
出版时间： 2006-12-1字数：版次： 1页数： 430印刷时间： 2006/12/01开本：印次：纸张： 胶版纸I S B N ： 9783540499947包装： 平装编辑推荐
The LNCS series reports state-of-the-art results in computer science research, development, and education, at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community, with numerous individuals, as well as with prestigious organizations and Societies, LNCS has grown into the most comprehensive computer science research forum available.
The scope of LNCS, including its sub series LNAI, spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields. The type of material published traditionally includes
- Proceedings（published in time for the respective conference）
- Post-proceedings（consisting of thoroughly revised final full papers）
-research monographs（which may be based on outstanding PhD work, research projects, technical reports, etc.）
内容简介
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.
The 34 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 155 submissions. A broad variety of current topics from the theory of computing are addressed, ranging from software science, programming theory, systems design and analysis, formal methods, mathematical logic, mathematical foundations, discrete mathematics, combinatorial mathematics, complexity theory, and automata theory to theoretical computer science in general.
目录
Invited Papers
Shared-Variable Concurrency: A Proposal
Hennessy-Plotkin-Brookes Revisited
Approximation Algorithms for 2-Stage Stochastic OptimizationProblems
The Number of Crossing Free Configurations on Finite Point Setsin 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 Findingthe 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~.
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 ReinforceInent Learning
On Decidability of LTL Model Checking for Process Rewrite Systems
Monitoring of Real-Time Properties
……
Author Index
