| 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 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 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.） |
| Exploring Gafni's Reduction Land: From ~2k to Wait-Free Adaptive Renaming Via k-Set Agreement Renaming in Message Passing Systems with Byzantine Failures Built-In Coloring for Highly-Concurrent Doubly-Linked Lists Fault-Tolerant and Self-stabilizing Mobile Robots Gathering Fast Computation by Population Protocols with a Leader On Self-stabilizing Search Trees Efficient Dynamic Aggregation Groupings and Pairings in Anonymous Networks A New Proof of the GHS Minimum Spanning Tree Algorithm A Knowledge-Based Analysis of Global Function Computation Checking a Multithreaded Algorithm with TCAL Capturing Register and Control Dependence in Memory Consistency Models with Applications to the Itanium Architecture Conflict Detection and Validation Strategies for Software Transactional Memory Transactional Locking II Less Is More: Consensus Gaps Between Restricted and Unrestricted Objects One-Step Consensus Solvability Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols On Consistency of Encrypted Files Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data A Lazy Snapshot Algorithm with Eager Validation Bounded Wait-Free f-Resilient Atomic Byzantine Data Storage Systems for an Unbounded Number of Clients Time and Communication Efficient Consensus for Crash Failures Subconsensus Tasks: Renaming Is Weaker Than Set Agreement Exact Distance Labelings Yield Additive-Stretch Compact Routing Schemes …… |
内容加载中，请稍后...
商品评论（0条）