close
1.

電子ブック

EB
edited by Mohammad Reza Mousavi, Christian Berger
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9361
オンライン: http://dx.doi.org/10.1007/978-3-319-25141-7
2.

電子ブック

EB
edited by Guojun Wang, Albert Zomaya, Gregorio Martinez Perez, Kenli Li
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9532
オンライン: http://dx.doi.org/10.1007/978-3-319-27161-3
目次情報: 続きを見る
Trust, security and privacy for Big Data
Trust, security and privacy for emerging applications
Network optimization and performance evaluation
Sensor-cloud systems
Security and privacy protection in computer and network Systems
Dependability in sensor, cloud, and Big Data systems
Trust, security and privacy for Big Data
Trust, security and privacy for emerging applications
Network optimization and performance evaluation
3.

電子ブック

EB
edited by Magnus M. Halldorsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann
出版情報: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9134
オンライン: http://dx.doi.org/10.1007/978-3-662-47672-7
目次情報: 続きを見る
Statistical Randomized Encodings: A Complexity Theoretic View
Tighter Fourier Transform Lower Bounds
Quantifying Competitiveness in Paging with Locality of Reference
Approximation Algorithms for Computing Maximin Share Allocations
Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare
Batched Point Location in SINR Diagrams via Algebraic Tools
On the Randomized Competitive Ratio of Reordering Buffer Management with Non-uniform Costs
Serving in the Dark Should Be Done Non-uniformly
Finding the Median (Obliviously) with Bounded Space
Approximation Algorithms for Min-Sum k-Clustering
Solving Linear Programming with Constraints Unknown
Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources
Limitations of Algebraic Approaches to Graph Isomorphism Testing
Fully Dynamic Matching in Bipartite Graphs
Feasible Interpolation for QBF Resolution Calculi
Simultaneous Approximation of Constraint Satisfaction Problems
Design of Dynamic Algorithms via Primal-Dual Method
What Percentage of Programs Halt?
The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems
Spotting Trees with Few Leaves
Constraint Satisfaction Problems over the Integers with Successor
Hardness Amplification and the Approximate Degree of Constant-Depth Circuits
Algorithms and Complexity for Turaev-Viro Invariants
Big Data on the Rise? ? Testing Monotonicity of Distributions
Unit Interval Editing Is Fixed-Parameter Tractable
Streaming Algorithms for Submodular Function Maximization
Multilinear Pseudorandom Functions
Zero-Fixing Extractors for Sub-Logarithmic Entropy
Interactive Proofs with Approximately Commuting Provers
Popular Matchings with Two-Sided Preferences and One-Sided Ties
Block Interpolation: A Framework for Tight Exponential-Time Counting Complexity
On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols
Scheduling Bidirectional Traffic on a Path
On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace
On Planar Boolean CSP
On Temporal Graph Exploration
Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful Degradation
A (1+e)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
Lower Bounds for the Graph Homomorphism Problem
Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree
Relative Discrepancy Does not Separate Information and Communication Complexity
A Galois Connection for Valued Constraint Languages of Infinite Size
Approximately Counting H Colourings Is #BIS-Hard
Taylor Polynomial Estimator for Estimating Frequency Moments
ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria
Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets
Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search
Optimal Encodings for Range Top-k, Selection, and Min-Max
2-Vertex Connectivity in Directed Graphs
Ground State Connectivity of Local Hamiltonians
Uniform Kernelization Complexity of Hitting Forbidden Minors
Counting Homomorphisms to Square-Free Graphs, Modulo 2
Approximately Counting Locally-Optimal Structures
Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs (Extended Abstract)
Fast Algorithms for Diameter-Optimally Augmenting Paths
Hollow Heaps
Linear-Time List Recovery of High-Rate Expander Codes
Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time
Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs
Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities
Local Reductions
Query Complexity in Expectation
Near-Linear Query Complexity for Graph Inference
A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set
Finding a Path in Group-Labeled Graphs with Two Labels Forbidden
Lower Bounds for Sums of Powers of Low Degree Univariates
Approximating CSPs Using LP Relaxation
Comparator Circuits over Finite Bounded Posets
Algebraic Properties of Valued Constraint Satisfaction Problem
Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic
On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy
Replacing Mark Bits with Randomness in Fibonacci Heaps
A PTAS for the Weighted Unit Disk Cover Problem
Approximating the Expected Values for Combinatorial Optimization Problems Over Stochastic Points
Deterministic Truncation of Linear Matroids
Linear Time Parameterized Algorithms for Subset Feedback Vertex Set
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains
Amplification of One-Way Information Complexity via Codes and Noise Sensitivity
A (2+e)-Approximation Algorithm for the Storage Allocation Problem
Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas
Computing the Frechet Distance Between Polygons with Holes
An Improved Private Mechanism for Small Databases
Binary Pattern Tile Set Synthesis Is NP-Hard
Near-Optimal Upper Bound on Fourier Dimension of Boolean Functions in Terms of Fourier Sparsity
Condensed Unpredictability
Sherali-Adams Relaxations for Valued CSPs
Two-Sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm
The Simultaneous Communication of Disjointness with Applications to Data Streams
An Improved Combinatorial Algorithm for Boolean Matrix Multiplication
Statistical Randomized Encodings: A Complexity Theoretic View
Tighter Fourier Transform Lower Bounds
Quantifying Competitiveness in Paging with Locality of Reference
4.

電子ブック

EB
edited by Walfredo Cirne, Narayan Desai
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 8828
オンライン: http://dx.doi.org/10.1007/978-3-319-15789-4
目次情報: 続きを見る
Bubble Task:?A Dynamic Execution Throttling Method for Multi-core Resource Management
Real-World Clustering for Task Graphs on Shared Memory Systems
Experimental Analysis of the Tardiness of Parallel Tasks in Soft Real-time Systems
Multi-Resource Aware Fairsharing for Heterogeneous Systems
Priority Operators for Fairshare Scheduling
User-Aware Metrics for Measuring Quality of Parallel Job Schedules
Prediction of Queue Waiting Times for Metascheduling on Parallel Batch Systems
Dynamically Scheduling a Component-Based Framework in Clusters
How to Design a Job Scheduling Algorithm
Bubble Task:?A Dynamic Execution Throttling Method for Multi-core Resource Management
Real-World Clustering for Task Graphs on Shared Memory Systems
Experimental Analysis of the Tardiness of Parallel Tasks in Soft Real-time Systems
5.

電子ブック

EB
edited by Magnus Jonsson, Alexey Vinel, Boris Bellalta, Olav Tirkkonen
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9305
オンライン: http://dx.doi.org/10.1007/978-3-319-23440-3
目次情報: 続きを見る
Wireless sensor networks
Physical layer techniques
Resources handling and allocation
Medium access control protocols and video coding
Wireless sensor networks
Physical layer techniques
Resources handling and allocation
6.

電子ブック

EB
edited by Rajat Subhra Chakraborty, Peter Schwabe, Jon Solworth
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9354
オンライン: http://dx.doi.org/10.1007/978-3-319-24126-5
7.

電子ブック

EB
edited by Ion Bica, David Naccache, Emil Simion
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9522
オンライン: http://dx.doi.org/10.1007/978-3-319-27179-8
目次情報: 続きを見る
Authenticated-Encryption: Security Notions, Designs and Applications
New Results on Identity-based Encryption from Quadratic Residuosity
Efficient techniques for extracting secrets from electronic devices
Secure and Trusted Application Execution on Embedded Devices
A Number-Theoretic Error-Correcting Code
Full duplex OTP cryptosystem based on DNA key for text transmissions
Evaluation of Lightweight Block Ciphers for Embedded Systems
SCA Resistance Analysis on FPGA Implementations of Sponge based MAC-PHOTON
A Novel Fast and Secure Chaos-Based Algorithm for Image Encryption
A Novel Key Management for Virtually Limitless Key Size
Efficient Montgomery Multiplication on GPUs
Applying Cryptographic Acceleration Techniques to Error Correction
A Cooperative Black Hole Node Detection and Mitigation Approach for MANETs
Up-high to Down-low: Applying Machine Learning to an Exploit Database
Detecting Computers in the Cyber Space Maliciously Exploited as SSH Proxies
On a Lightweight Authentication Protocol for RFID
Spam Filtering using Automated Classifying Services Over a Cloud Computing Infrastructure
Contributions to Steganographic Techniques on Mobile Devices
Secure implementation of Stream cipher: Trivium
Fast Searching in Image Databases Using Multi-Hash Robust Fingerprinting
Authenticated-Encryption: Security Notions, Designs and Applications
New Results on Identity-based Encryption from Quadratic Residuosity
Efficient techniques for extracting secrets from electronic devices
8.

電子ブック

EB
edited by Riccardo Focardi, Andrew Myers
出版情報: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9036
オンライン: http://dx.doi.org/10.1007/978-3-662-46666-7
目次情報: 続きを見る
Quantitative Approaches to the Protection of Private Information: State of the Art and Some Open Challenges
IFC Inside: Retrofitting Languages with Dynamic Information Flow Control
Very Static Enforcement of Dynamic Policies
The Foundational Cryptography Framework
On the Flow of Data, Information, and Time
Pareto Efficient Solutions of Attack-Defence Trees
Analysis of XACML Policies with SMT
Automatically Checking Commitment Protocols in ProVerif without False Attacks
Generalizing Multi-party Contract Signing
Leakiness is Decidable for Well-Founded Protocols
Abstractions for Security Protocol Verification
Automated Backward Analysis of PKCS#11 v2.20
A Safe Update Mechanism for Smart Cards
Discrete vs. Dense Times in the Analysis of Cyber-Physical Security Protocols
Timing Attacks in Security Protocols: Symbolic Framework and Proof Techniques
Type-Based Verification of Electronic Voting Protocols
Composing Security Protocols: From Confidentiality to Privacy
PriCL: Creating a Precedent, a Framework for Reasoning about Privacy Case Law
Quantitative Approaches to the Protection of Private Information: State of the Art and Some Open Challenges
IFC Inside: Retrofitting Languages with Dynamic Information Flow Control
Very Static Enforcement of Dynamic Policies
9.

電子ブック

EB
edited by Luis Miguel Pinho Pinho, Wolfgang Karl, Albert Cohen, Uwe Brinkschulte
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9017
オンライン: http://dx.doi.org/10.1007/978-3-319-16086-3
目次情報: 続きを見る
Hardware
Design
Applications
Trust and privacy
Real-time issues
Best papers session
Hardware
Design
Applications
10.

電子ブック

EB
edited by Teijiro Isokawa, Katsunobu Imai, Nobuyuki Matsui, Ferdinand Peper, Hiroshi Umeo
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 8996
オンライン: http://dx.doi.org/10.1007/978-3-319-18812-6
目次情報: 続きを見る
Complexity of One-Way Cellular Automata
Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles
5-State Rotation-Symmetric Number-Conserving Cellular Automata are not Strongly Universal
A Universal Cellular Automaton Without Sensitive Subsystems
Real-Time Reversible One-Way Cellular Automata
Cycle Equivalence of Finite Dynamical Systems Containing Symmetries
Generalized FSSP on Hexagonal Tiling: Towards Arbitrary Regular Spaces
Strict Majority Bootstrap Percolation on Augmented Tori and Random Regular Graphs: Experimental Results
Rapaport Language Recognition by Reversible Partitioned Cellular Automata
Complexity of Conjugacy, Factoring and Embedding for Countable Sofic Shifts of Rank 2
Plane-Walking Automata
Complexity of One-Way Cellular Automata
Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles
5-State Rotation-Symmetric Number-Conserving Cellular Automata are not Strongly Universal