2005年/會議錄 STACS 2005

內(nèi)容概要

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

書籍目錄

Invited Talks　Automorphisms of Finite Rings and Applications to Complexity of　Problems　Algebraic Generating Functions in Enumerative Combinatorics and　Context-Free Languages　Algorithmics in Exponential TimeSession 1A　Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics　Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms　Truthful Approximation Mechanisms for Scheduling Selfish Related MachinesSession 1B　Counting in the Two Variable Guarded Logic with Transitivity　The Variable Hierarchy of the #-Calculus Is Strict　The Core of a Countably Categorical StructureSession 2A　How Common Can Be Universality for Cellular Automata?　Cellular Automata: Real-Time Equivalence Between One-Dimensional NeighborhoodsSession 2B　On the Decidability of Temporal Properties of Probabilistic Pushdown Automata　Deciding Properties of Contract-Signing Protocols Session 3A　Polylog-Time Reductions Decrease Dot-Depth　On the Computational Complexity of the Forcing Chromatic Number　More Efficient Queries in PCPs for NP and Improved Approximation Hardness of Maximum CSPSession 3B　Three Optimal Algorithms for Balls of Three Colors　Cost Sharing and Strategyproof Mechanisms for Set Cover Games　On Weighted Balls-into-Bins Games Session 4A　Computing Minimal Multi-homogeneous Bdzout Numbers Is HardSession 4BSession 5ASession 5BSession 6ASession 6BSession 7ASession 8BSession 8ASession 8BSession 9ASession 9BSession 10ASession 10B

圖書封面

評論、評分、閱讀與下載

---

    2005年/會議錄 STACS 2005 PDF格式下載

---