close
1.

電子ブック

EB
edited by Prosenjit Bose, Leszek Antoni G?sieniec, Kay Romer, Roger Wattenhofer
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9536
オンライン: http://dx.doi.org/10.1007/978-3-319-28472-9
目次情報: 続きを見る
Plane and Planarity Thresholds for Random Geometric Graphs
Connectivity of a dense mesh of randomly oriented directional antennas under a realistic fading model
Maintaining Intruder Detection Capability in a Rectangular Domain with Sensors
The Weakest Oracle for Symmetric Consensus in Population Protocols
Exact and Approximation Algorithms for Data Mule Scheduling in a Sensor Network
Limitations of Current Wireless Scheduling Algorithms
Deterministic rendezvous with detection using beeps
Minimizing total sensor movement for barrier coverage by non-uniform sensors on a line
A comprehensive and lightweight security architecture to secure the IoT throughout the lifecycle of a device based on HIMMO
Maximizing Throughput in Energy-Harvesting Sensor Nodes
On verifying and maintaining connectivity of interval temporal networks
Beachcombing on Strips and Islands
Radio Aggregation Scheduling
Gathering of Robots on Meeting-Points
Mutual Visibility with an Optimal Number of Colors
Mobile Agents Rendezvous in spite of a Malicious Agent
Plane and Planarity Thresholds for Random Geometric Graphs
Connectivity of a dense mesh of randomly oriented directional antennas under a realistic fading model
Maintaining Intruder Detection Capability in a Rectangular Domain with Sensors
2.

電子ブック

EB
edited by Gilles Pesant
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9255
オンライン: http://dx.doi.org/10.1007/978-3-319-23219-5
3.

電子ブック

EB
edited by Jie Gao, Alon Efrat, Sandor P. Fekete, Yanyong Zhang
出版情報: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 8847
オンライン: http://dx.doi.org/10.1007/978-3-662-46018-4
目次情報: 続きを見る
Robot Planning
The Multi-source Beachcombers Problem
Multi-Robot Foremost Coverage of Time-Varying Graphs
Strategies for Parallel Unaware Cleaners
Minimum-Traveled-Distance Gathering of Oblivious Robots over Given Meeting Points
Algorithms and Data Structures on Graphs Fast Rendezvous with Advice
Computing the Dynamic Diameter of Non-Deterministic Dynamic Networks is Hard
Improved Spanners in Networks with Symmetric Directional Antennas
Wireless Networks
Exploiting Geometry in the SINRk Model
Interference Minimization in Asymmetric Sensor Networks
Minimum Latency Aggregation Scheduling in Wireless Sensor Networks
Robot Planning
The Multi-source Beachcombers Problem
Multi-Robot Foremost Coverage of Time-Varying Graphs
4.

電子ブック

EB
edited by Rahul Jain, Sanjay Jain, Frank Stephan
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9076
オンライン: http://dx.doi.org/10.1007/978-3-319-17142-5
目次情報: 続きを見る
Recursion theory and mathematical logic
Computational complexity and Boolean functions
Graph theory
Quantum computing
Parallelism and statistics
Learning, automata and probabilistic models
Parameterised complexity
Recursion theory and mathematical logic
Computational complexity and Boolean functions
Graph theory
5.

電子ブック

EB
edited by Arnold Beckmann, Victor Mitrana, Mariya Soskova
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9136
オンライン: http://dx.doi.org/10.1007/978-3-319-20028-6
目次情報: 続きを見る
Computers and the Mechanics of Communication. Outline of a Vision from the Work of Petri and Holt
Error and predicativity
Is Human Mind Fully Algorithmic? Remarks on Kurt Godel's Incompleteness Theorems
A New Approach to the Paperfolding Sequences
Covering the Recursive Sets
On Distributed Monitoring and Synthesis
Newton's Forward Difference Equation for Functions from Words to Words
Degrees of unsolvability: a tutorial
Universality in Molecular and Cellular Computing
Some results on interactive proofs for real computations
Prime Model with No Degree of Autostability Relative to Strong Constructivizations
Immune Systems in Computer Virology
ITRM-Recognizability from Random Oracles
Systems with Parallel Rewriting for Chain Code Picture Languages
Base-Complexity Classifications of QCB0-Spaces (Extended Abstract)
Maximal Vector Spaces form an Automorphism Basis
New Bounds on Optimal Sorting Networks
Nonexistence of Minimal Pairs in L[d]
Intuitionistic Provability versus Uniform Provability in RCA
Randomness and Differentiability of Convex Functions
Weighted automata on infinite words in the context of Attacker-Defender games
Turing jumps through provability
Rice's Theorem in Effectively Enumerable Topological Spaces
Decidability of Termination Problems for Sequential P Systems with Active Membranes
Weihrauch degrees of finding equilibria in sequential games
Prefix and Right-Partial Derivative Automata
A Note on the Computable Categoricity of l^p Spaces
n the Computational Content of Termination Proofs
Local compactness for computable Polish metric spaces is $\Pi^1_1$-complete
Iterative forcing and hyperimmunity in reverse mathematics
Completely regular Bishop spaces
Computing Equality-Free String Factorisations
Towards the Effective Descriptive Set Theory
On Computability of Navier-Stokes' Equation
Undecidability as a Consequence of Incompleteness
How to compare Buchholz-style ordinal notation systems with Gordeev-style notation systems
Computers and the Mechanics of Communication. Outline of a Vision from the Work of Petri and Holt
Error and predicativity
Is Human Mind Fully Algorithmic? Remarks on Kurt Godel's Incompleteness Theorems