最 低 价：￥699.70
| 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 resarch forum available. The scope of LNCS,including its subseries LNAI,spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields.The type of material publised traditionally includes. -proceedings(published in time for the respective conference) -post-proceedings(consisting of thoroughly revised final full papers) -research monographs(which may be basde on outstanding PhD work,research projects,technical reports,etc.). |
| Invited Presentations Functorial Boxes in String Diagrams Some Results on a Game-Semantic Approach to Verifying Finitely-Presentable Infinite Structures(Extended Abatract) Automata and Logics and Their Algebraic Foundations Conributions Semi-continuous Sized Types and Termination Visibly Pushdown Automata:From Language Equivalence to Simulation and Bisimulation A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata The Power of Linear Functions Logical Omniscience Via Proof Complexity Verication of Ptime Reducibility for System F Terms Via Dual Light Affine Logic MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay Abstracting Allocation Collapsibility in Infinite-Domain Quantified Constraint Satisfaction Towards an Implicit Characterization of NC On Rational Trees Reasoning About States of Probabilistic Sequential Programs Concurrent Games with Tail Objectives Nash Equilibrium for Upward-Closed Objectives Algorithms for Omega-Ragular Games with Imperfect Information Relating Two Standard Notions of Secrecy Jump form Parallel to Sequential Proofs:Multplicatives First-Order Queries Over One Unary Function Infinite State Model-Checking of Propositional Dynamic Logics Weak Bisimulation Approximants Complete Problems for Higher Order Logics Solving Games Without Determinization …… Appendix Author Index |
内容加载中，请稍后...
商品评论（0条）