| 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.） |
| Mobile Agent Rendezvous: A Survey Adapting to Point Contention with Long-Lived Safe Agreement Sensor Networks: Distributed Algorithms Reloaded or Revolutions? Local Algorithms for Autonomous Robot Systems How to Meet in Anonymous Network Setting Port Numbers for Fast Graph Exploration Distributed Chasing of Network Intruders Election in the Qualitative World Fast Deterministic Distributed Algorithms for Sparse Spanners Efficient Distributed Weighted Matchings on Trees Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs Short Labels by Traversal and Jumping An Optimal Rebuilding Strategy for a Decremental Tree Problem Optimal Delay for Media-on-Demand with Pre-loading and Pre-buffering Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures On Fractional Dynamic Faults with Threshold Discovering Network Topology in the Presence of Byzantine Faults Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks 3-D Minimum Energy Broadcasting Average-Time Complexity of Gossiping in Radio Networks L(h,l,1)-Labeling of Outerplanar Graphs Combinatorial Algorithms for Compressed Sensing On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem Dynamic Asymmetric Communication Approximate Top-k Queries in Sensor Networks Self-stabilizing Space Optimal Synchronization Algorithms on Trees Distance-k Information in Self-stabilizing Algorithms Author Index |
内容加载中，请稍后...
商品评论（0条）