close
1.

電子ブック

EB
edited by Emilio Di Giacomo, Anna Lubiw
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9411
オンライン: http://dx.doi.org/10.1007/978-3-319-27261-0
目次情報: 続きを見る
Large and Dynamic Graphs
Crossing Numbers
Experiments
Area, Bends, Crossings
Intersection Representations
Applications
Drawings with Crossings
Polygons and Convexity
Drawing Graphs on Point Sets
Contact Representations
User Studies
Graph Drawing Contest
Graduate Workshop Report
Posters
Large and Dynamic Graphs
Crossing Numbers
Experiments
2.

電子ブック

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
3.

電子ブック

EB
edited by Rosario Gennaro, Matthew Robshaw
出版情報: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9215
オンライン: http://dx.doi.org/10.1007/978-3-662-47989-6
目次情報: 続きを見る
Lattice-based cryptography
Cryptanalytic insights
Modes and constructions
Multilinear maps and IO
Pseudorandomness
Block cipher cryptanalysis
Integrity
Assumptions
Hash functions and stream cipher cryptanalysis
Implementations
Multiparty computation
Zero-knowledge
Theory
Signatures
Non-signaling and information-theoretic crypto
Attribute-based encryption
New primitives
Fully homomorphic/functional encryption
Lattice-based cryptography
Cryptanalytic insights
Modes and constructions
4.

電子ブック

EB
edited by Gabriela Ochoa, Francisco Chicano
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9026
オンライン: http://dx.doi.org/10.1007/978-3-319-16468-7
目次情報: 続きを見る
A Biased Random-Key Genetic Algorithm for the Cloud Resource Management Problem
A Computational Comparison of Different Algorithms for Very Large p-median Problems
A New Solution Representation for the Firefighter Problem
A Variable Neighborhood Search Approach for the Interdependent Lock Scheduling Problem
A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands
An Iterated Local Search Algorithm for Solving the Orienteering Problem with Time Windows
Analysis of Solution Quality of a Multi objective Optimization-Based Evolutionary Algorithm for Knapsack Problem
Evolving Deep Recurrent Neural Networks Using Ant Colony Optimization
Hyper-heuristic Operator Selection and Acceptance Criteria
Improving the Performance of the Germinal Center Artificial Immune System Using ε-Dominance: A Multi-objective Knapsack Problem
Mixing Network Extremal Optimization for Community Structure Detection
Multi-start Iterated Local Search for the Mixed Fleet Vehicle Routing Problem with Heterogeneous Electric Vehicles
On the Complexity of Searching the Linear Ordering Problem Neighborhoods
Runtime Analysis of (1 + 1) Evolutionary Algorithm Controlled with Q-learning Using Greedy Exploration Strategy on ONEMAX+ZEROMAX Problem
The New Memetic Algorithm HEAD for Graph Coloring: An Easy Way for Managing Diversity
The Sim-EA Algorithm with Operator Auto adaptation for the Multi objective Firefighter Problem
True Pareto Fronts for Multi-objective AI Planning Instances
Upper and Lower Bounds on Unrestricted Black-Box Complexity of JUMPn,l
Using Local Search to Evaluate Dispatching Rules in Dynamic Job Shop Scheduling
A Biased Random-Key Genetic Algorithm for the Cloud Resource Management Problem
A Computational Comparison of Different Algorithms for Very Large p-median Problems
A New Solution Representation for the Firefighter Problem
5.

電子ブック

EB
edited by Penousal Machado, Malcolm I. Heywood, James McDermott, Mauro Castelli, Pablo Garcia-Sanchez, Paolo Burelli, Sebastian Risi, Kevin Sim
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9025
オンライン: http://dx.doi.org/10.1007/978-3-319-16501-1
目次情報: 続きを見る
The Effect of Distinct Geometric Semantic Crossover Operators in Regression Problems
Learning Text Patterns Using Separate-and-Conquer Genetic Programming
Improving Geometric Semantic Genetic Programming with Safe Tree Initialisation
Grant Dick On the Generalization Ability of Geometric Semantic Genetic Programming
Automatic Derivation of Search Objectives for Test-Based Genetic Programming
Evolutionary Design of Transistor Level Digital Circuits Using Discrete Simulation
M3GP ? Multiclass Classification with GP
Evolving Ensembles of Dispatching Rules Using Genetic Programming for Job Shop Scheduling
Attributed Grammatical Evolution Using Shared Memory Spaces and Dynamically Typed Semantic Function Specification
Indirectly Encoded Fitness Predictors Coevolved with Cartesian Programs
Tapped Delay Lines for GP Streaming Data Classification with Label Budgets
Cartesian GP in Optimization of Combinational Circuits with Hundreds of Inputs and Thousands of Gates
Genetic Programming for Feature Selection and Question-Answer Ranking in IBM Watson
Automatic Evolution of Parallel Recursive Programs
Proposal and Preliminary Investigation of a Fitness Function for Partial Differential Models
Evolutionary Methods for the Construction of Cryptographic Boolean Functions
TEMPLAR ? A Framework for Template-Method Hyper-Heuristics
Circuit Approximation Using Single- and Multi-objective Cartesian GP
The Effect of Distinct Geometric Semantic Crossover Operators in Regression Problems
Learning Text Patterns Using Separate-and-Conquer Genetic Programming
Improving Geometric Semantic Genetic Programming with Safe Tree Initialisation
6.

電子ブック

EB
edited by Andrew Phillips, Peng Yin
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9211
オンライン: http://dx.doi.org/10.1007/978-3-319-21999-8
目次情報: 続きを見る
Algorithms and models for computation on biomolecular Systems
Computational processes in vitro and in vivo
Molecular switches, gates, devices, and circuits
Molecular folding and self-assembly of nanostructures
Analysis and theoretical models of laboratory techniques
Molecular motors and molecular robotics
Studies of fault-tolerance and error correction
Software tools for analysis, simulation, and design
Synthetic biology and in vitro Evolution
Applications in engineering, physics, chemistry, biology, and medicine
Algorithms and models for computation on biomolecular Systems
Computational processes in vitro and in vivo
Molecular switches, gates, devices, and circuits
7.

電子ブック

EB
edited by Laura Sanita, Martin Skutella
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9499
オンライン: http://dx.doi.org/10.1007/978-3-319-28684-6
目次情報: 続きを見る
Algorithmic game theory
Algorithmic trading
Coloring and partitioning
Competitive analysis
Computational advertising
Computational finance
Cuts and connectivity
Geometric problems
Graph algorithms
Inapproximability
Mechanism design
Natural algorithms
Network design
Packing and covering.-Paradigms for the design and analysis of approximation and online algorithms.-Parameterized complexity. Scheduling problems. -Real-world applications
Algorithmic game theory
Algorithmic trading
Coloring and partitioning
8.

電子ブック

EB
edited by Giuseppe F Italiano, Giovanni Pighizzini, Donald T. Sannella
出版情報: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9234
オンライン: http://dx.doi.org/10.1007/978-3-662-48057-1
9.

電子ブック

EB
edited by Khaled Elbassioni, Kazuhisa Makino
出版情報: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9472
オンライン: http://dx.doi.org/10.1007/978-3-662-48971-0
10.

電子ブック

EB
edited by Adrian-Horia Dediu, Enrico Formenti, Carlos Martin-Vide, Bianca Truthe
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 8977
オンライン: http://dx.doi.org/10.1007/978-3-319-15579-1
目次情報: 続きを見る
Algorithms
Automata, Logic, and Concurrency
Codes, Semigroups, and Symbolic Dynamics
Combinatorics on Words
Complexity and Recursive Functions
Compression, Inference, Pattern Matching, and Model Checking
Graphs, Term Rewriting, and Networks
Transducers, Tree Automata, and Weighted Automata
Algorithms
Automata, Logic, and Concurrency
Codes, Semigroups, and Symbolic Dynamics
11.

電子ブック

EB
edited by Ferdinando Cicalese, Ely Porat, Ugo Vaccaro
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9133
オンライン: http://dx.doi.org/10.1007/978-3-319-19929-0
目次情報: 続きを見る
On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling
A Framework for Space-Efficient String Kernels
Composite Repetition-Aware Data Structures
Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis
Longest Common Extensions in Trees
Longest Common Extensions in Sublinear Space
Ranked Document Retrieval with Forbidden Pattern
Parameterized Complexity of Superstring Problems
On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem
Fast String Dictionary Lookup with One Error
On the Readability of Overlap Digraphs
Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem
Range Minimum Query Indexes in Higher Dimensions
Alphabet-Dependent String Searching with Wexponential Search Trees
Lempel Ziv Computation in Small Space (LZ-CISS)
Succinct Non-overlapping Indexing
Encodings of Range Maximum-Sum Segment Queries and Applications
Compact Indexes for Flexible Top-k Retrieval
LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding
Combinatorial RNA Design: Designability and Structure-Approximating Algorithm
Dictionary Matching with Uneven Gaps
Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley’s Process
The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets
String Powers in Trees
Online Detection of Repetitions with Backtracking
Greedy Conjecture for Strings of Length 4
Tighter Bounds for the Sum of Irreducible LCP Values
Parallel External Memory Suffix Sorting
On Maximal Unbordered Factors
Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree
Reporting Consecutive Substring Occurrences Under Bounded Gap Constraints
A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS Algorithm
Encoding Nearest Larger Values
Sorting by Cuts, Joins and Whole Chromosome Duplications
On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling
A Framework for Space-Efficient String Kernels
Composite Repetition-Aware Data Structures
12.

電子ブック

EB
edited by Francesco Parisi-Presicce, Bernhard Westfechtel
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9151
オンライン: http://dx.doi.org/10.1007/978-3-319-21145-9
目次情報: 続きを見る
Polymorphic Sesqui-Pushout Graph Rewriting
Predictive Top-Down Parsing for Hyperedge Replacement Grammars
AGREE ? Algebraic Graph Rewriting with Controlled Embedding
Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings
Towards Local Confluence Analysis for Amalgamated Graph Transformation
Multi-amalgamated Triple Graph Grammars
Reconfigurable Petri Nets with Transition Priorities and Inhibitor Arcs
Reachability in Graph Transformation Systems and Slice Languages
Equational Reasoning with Context-Free Families of String Diagrams
Translating Essential OCL Invariants to Nested Graph Constraints Focusing on Set Operations
Characterizing Conflicts Between Rule Application and Rule Evolution in Graph Transformation Systems
Graph Pattern Matching as an Embedded Clojure DSL
Using Graph Transformations for Formalizing Prescriptions and Monitoring
Towards Compliance Verification Between Global and Local Process Models
Inductive Invariant Checking with Partial Negative Application Conditions
Tool Support for Multi-amalgamated Triple Graph Grammars
Uncover: Using Coverability Analysis for Verifying Graph Transformation Systems
Local Search-Based Pattern Matching Features in EMF-INCQUERY
Polymorphic Sesqui-Pushout Graph Rewriting
Predictive Top-Down Parsing for Hyperedge Replacement Grammars
AGREE ? Algebraic Graph Rewriting with Controlled Embedding
13.

電子ブック

EB
edited by Dachuan Xu, Donglei Du, Dingzhu Du
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9198
オンライン: http://dx.doi.org/10.1007/978-3-319-21398-9
目次情報: 続きを見る
Algorithms and data structures
Algorithmic game theory; approximation algorithms and online algorithms
Automata, languages, logic and computability
Complexity theory
Computational learning theory
Cryptography, reliability and security
Database theory, computational biology and bioinformatics
Computational algebra, geometry, number theory, graph drawing and information visualization
Graph theory, communication networks, optimization and parallel and distributed computing
Algorithms and data structures
Algorithmic game theory; approximation algorithms and online algorithms
Automata, languages, logic and computability
14.

電子ブック

EB
edited by Giuseppe F. Italiano, Tiziana Margaria-Steffen, Jaroslav Pokorny, Jean-Jacques Quisquater, Roger Wattenhofer
出版情報: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 8939
オンライン: http://dx.doi.org/10.1007/978-3-662-46078-8
目次情報: 続きを見る
Keynote Talk
What is Computation: An Epistemic Approach
Foundations of Computer Science
Progress (and Lack Thereof) for Graph Coloring Approximation Problems
Recent Results in Scalable Multi-Party Computation
Online Bipartite Matching in Offline Time (Abstract)
Software & Web Engineering
Quo Vadis Explicit-State Model Checking
The Dos and Dont’s of Crowdsourcing Software Development
Data, Information and Knowledge Engineering
Adaptively Approximate Techniques in Distributed Architectures
Back to the Future ? Should SQL Surrender to SPARQL?
Balancing Energy Consumption for the Establishment of Multi-interface Networks
The Maximum k-Differential Coloring Problem
Exact Algorithms for 2-clustering with Size Constraints in the Euclidean Plane
Local Routing in Convex Subdivisions
Nondeterministic Modal Interfaces
Group Search on the Line
Online Makespan Scheduling with Sublinear Advice
Deterministic Rendezvous in Restricted Graphs
Fastest, Average and Quantile Schedule
Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP
Maximally Permissive Controlled System Synthesis for Modal Logic
Approximation Hardness of the Cross-Species Conserved Active Modules Detection Problem
Finding Highly Connected Subgraphs
Fixing Improper Colorings of Graphs
Efficient Online Strategies for Renting Servers in the Cloud
Palk is Linear Recognizable Online
Two Grammatical Equivalents of Flip-Pushdown Automata
On the Hierarchy Classes of Finite Ultrametric Automata
Nash-Williams-type and Chvat´al-type Conditions in One-Conflict Graphs. -Optimal State Reductions of Automata with Partially Specified Behaviors. -Quantum Pushdown Automata with a Garbage Tape
Towards a Characterization of Leaf Powers by Clique Arrangements
Filling Logarithmic Gaps in Distributed Complexity for Global Problems
On Visibly Pushdown Trace Languages
Dominating an s-t-Cut in a Network
Lower Bounds for Linear Decision Trees with Bounded Weights
A Model-Driven Approach to Generate External DSLs from Object-Oriented APIs
Function Based Requirements Engineering and Design ? Towards Efficient and Transparent Plant Engineering
Software Developer Activity as a Source for Identifying Hidden Source Code Dependencies
Discovering Motifs in Real-World Social Networks
Data, Information, and Knowledge Engineering
Exploiting Semantic Activity Labels to Facilitate Consistent Specialization of Abstract Process Activities
Efficient Similarity Search by Combining Indexing and Caching Strategies
Retrieving Documents Related to Database Queries
Advantages of Dependency Parsing for Free Word Order Natural Languages
Detecting Identical Entities in the Semantic Web Data
Conducting a Web Browsing Behaviour Study ? An Educational Scenario
A Uniform Programmning Language for Implementing XML Standards
OntoSDM: An Approach to Improve Quality on Spatial Data Mining Algorithms
Cryptography, Security, and Verification
Attribute-Based Encryption Optimized for Cloud Computing
Trustworthy Virtualization of the ARMv7 Memory Subsystem
True Random Number Generators Secure in a Changing Environment: Improved Security Bounds
Java Loops Are Mainly Polynomial
Keynote Talk
What is Computation: An Epistemic Approach
Foundations of Computer Science
15.

電子ブック

EB
edited by Cetin Kaya Koc, Sihem Mesnager, Erkay Sava?
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9061
オンライン: http://dx.doi.org/10.1007/978-3-319-16277-5
目次情報: 続きを見る
First Invited talk
Computing Discrete Logarithms in F36?137 and F36?163 using Magma
Finite Field Arithmetic
Accelerating Iterative SpMV for the Discrete Logarithm Problem using GPUs
Finding Optimal Chudnovsky-Chudnovsky Multiplication Algorithms
Reducing the Complexity of Normal Basis Multiplication
O
Second Invited talk
Open Questions on Nonlinearity and on APN functions
Boolean and Vectorial Functions
Some Results on Difference Balanced Functions
Affine Equivalency and Nonlinearity Preserving Bijective Mappings over F2
On Verification of Restricted Extended Affine Equivalence of Vectorial Boolean Functions
On o-Equivalence of Niho Bent Functions
Third Invited Talk
L-polynomials of the curve yqn? y = xqh+1? _ over Fqm
Coding Theory and Code-based Cryptography
Efficient Software Implementations of Code-based Hash Functions
Quadratic residue codes over Fp + vFp + v2F.p
First Invited talk
Computing Discrete Logarithms in F36?137 and F36?163 using Magma
Finite Field Arithmetic
16.

電子ブック

EB
edited by Cheng-Lin Liu, Bin Luo, Walter G. Kropatsch, Jian Cheng
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9069
オンライン: http://dx.doi.org/10.1007/978-3-319-18224-7
目次情報: 続きを見る
Graph-based Representation
Approximation of Graph Edit Distance in Quadratic Time
Data Graph Formulation as the Minimum-Weight Maximum-Entropy Problem
An Entropic Edge Assortativity Measure
A Subpath Kernel for Learning Hierarchical Image Representations
Coupled-Feature Hypergraph Representation for Feature Selection
Reeb Graphs Through Local Binary Patterns
Incremental embedding within a dissimilarity-based framework
Graph Matching
A First Step Towards Exact Graph Edit Distance Using Bipartite Graph Matching
Consensus of Two Graph Correspondences through a Generalisation of the Bipartite Graph Matching Algorithm
Revisiting Volegnant-Jonker for Approximating Graph Edit Distance
A Hypergraph Matching Framework for Refining Multi-source Feature Correspondences
Kite Recognition by means of Graph Matching
GEM++: a tool for solving substitution-tolerant subgraph isomorphism
A Graph Database Repository and Performance Evaluation Metrics for Graph Edit Distance
Improving Hausdorff Edit Distance Using Structural Node Context
Learning Graph Model for Different Dimensions Image Matching
VF2 Plus: An Improved Version of VF2 For Biological Graphs
Report on the First Contest on Graph Matching Algorithms for Pattern Search in Biological Databases
Approximate Graph Edit Distance Computation Combining Bipartite Matching and Exact Neighborhood Substructure Distance
Multi-layer Tree Matching Using HSTs
Large-scale Graph Indexing using Binary Embeddings of Node Contexts
Attributed Relational Graph Matching with Sparse Relaxation and Bistochastic Normalization
Graph Clustering and Classification.-On the Influence of Node Centralities on Graph Edit Distance for Graph Classification
A Mixed Weisfeiler-Lehman Graph Kernel
A Quantum Jensen-Shannon Graph Kernel using Discrete-time Quantum Walks
Density Based Cluster Extension and Dominant Sets Clustering
Salient Object Segmentation from Stereoscopic Images
Causal Video Segmentation using Superseeds and Graph Matching
Fast Minimum Spanning Tree based Clustering Algorithms on Local Neighborhood Graph
Graph-based Application
From bags to graphs of stereo subgraphs in order to predict molecule's properties
Thermodynamics of Time Evolving Networks
Isometric Mapping Hashing
Skeletal Graphs from Schrodinger Magnitude and Phase
Graph Based Lymphatic Vessel Wall Localisation and Tracking
A Comic Retrieval System Based on Multilayer Graph Representation and Graph Mining
Learning High-Order Structures for Texture Retrieval
Graph-based Representation
Approximation of Graph Edit Distance in Quadratic Time
Data Graph Formulation as the Minimum-Weight Maximum-Entropy Problem
17.

電子ブック

EB
edited by Said El Hajji, Abderrahmane Nitaj, Claude Carlet, El Mamoun Souidi
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9084
オンライン: http://dx.doi.org/10.1007/978-3-319-18681-8
18.

電子ブック

EB
edited by Emmanuel Vincent, Arie Yeredor, Zbyn?k Koldovsky, Petr Tichavsky
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9237
オンライン: http://dx.doi.org/10.1007/978-3-319-22482-4
目次情報: 続きを見る
Tensor-based methods for blind signal separation
Deep neural networks for supervised speech separation/enhancment
Joined analysis of multiple datasets, data fusion, and related topics
Advances in nonlinear blind source separation
Sparse and low rank modeling for acoustic signal processing
Tensor-based methods for blind signal separation
Deep neural networks for supervised speech separation/enhancment
Joined analysis of multiple datasets, data fusion, and related topics
19.

電子ブック

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

電子ブック

EB
edited by Kratochvil Jan, Mirka Miller, Dalibor Froncek
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 8986
オンライン: http://dx.doi.org/10.1007/978-3-319-19315-1
目次情報: 続きを見る
On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism
Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem
Quantifying Privacy: A Novel Entropy-Based Measure of Disclosure Risk
On the Galois Lattice of Bipartite Distance Hereditary Graphs
Fast Simple Computations Using Prefix Tables under Hamming and Edit Distance
Border Correlations, Lattices and the Subgraph Component Polynomial
Computing Minimum Length Representations of Sets of Words of Uniform Length
Computing Primitively-Rooted Squares and Runs in Partial Words
3-coloring triangle-free planar graphs with a precolored 9-cycle
Computing Heat Kernel Pagerank and a Local Clustering Algorithm
Solving Matching Problems Efficiently in Bipartite Graphs
A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras
On decomposing the complete graph into the union of two disjoint cycles
Reconfiguration of Vertex Covers in a Graph
Space Efficient Data Structures for Nearest Larger Neighbor Playing several variants of Mastermind with constant-size memory is not harder than with unbounded memory
On Maximum Common Subgraph Problems in Series-Parallel Graphs
Profile-based optimal matchings in the Student/Project Allocation Problem
The Min-Max Edge q-Coloring Problem
Speeding up Graph Algorithms via Switching Classes
Metric Dimension for Amalgamations of Graphs
Deterministic Algorithms for the Independent Feedback Vertex Set Problem
Lossless seeds for searching short patterns with high error rates
On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism
Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem
Quantifying Privacy: A Novel Entropy-Based Measure of Disclosure Risk
21.

電子ブック

EB
edited by Lev D. Beklemishev, Daniil V. Musatov
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9139
オンライン: http://dx.doi.org/10.1007/978-3-319-20297-6
目次情報: 続きを見る
Propositional Proofs in Frege and Extended Frege Systems
Circuit Complexity Meets Ontology-Based Data Access
NEXP-Completeness and Universal Hardness Results for Justification Logic
A Combinatorial Algorithm for the Planar Multi flow Problem with Demands Located on Three Holes
Generalized LR Parsing for Grammars with Contexts
On Compiling Structured CNFs to OBDDs
Satisfiability of ECTL* with Tree Constraints
On Growth and Fluctuation of k-Abelian Complexity
A Polynomial-Time Algorithm for Outerplanar Diameter Improvement
Editing to a Planar Graph of Given Degrees
On the Satisfiability of Quantum Circuits of Small Treewidth
Equations over Free Inverse Monoids with Idempotent Variables
A Logical Characterization of Timed Pushdown Languages
An In-place Priority Queue with O(1) Time for Push and lg n + O(1) Comparisons for Pop
Resolution Complexity of Perfect Matching Principles for Sparse Graphs
Operations on Self-verifying Finite Automata
Automath Type Inclusion in Barendregt’s Cube
Circuit Lower Bounds for Average-Case MA
Making Randomness Public in Unbounded-Round Information Complexity
First-Order Logic Definability of Free Languages
Representation of (Left) Ideal Regular Languages by Synchronizing Automata
Some Properties of Antistochastic Strings
Approximation and Exact Algorithms for Special Cases of Connected f-Factors
Rewriting Higher-Order Stack Trees
Interacting with Modal Logics in the Coq Proof Assistant
Delay Games with WMSOtU Winning Conditions
Asymptotically Precise Ranking Functions for Deterministic Size-Change Systems
Propositional Proofs in Frege and Extended Frege Systems
Circuit Complexity Meets Ontology-Based Data Access
NEXP-Completeness and Universal Hardness Results for Justification Logic
22.

電子ブック

EB
edited by Frank Dehne, Jorg-Rudiger Sack, Ulrike Stege
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9214
オンライン: http://dx.doi.org/10.1007/978-3-319-21840-3
目次情報: 続きを見る
Contact Graphs of Circular Arcs
Contact Representations of Graphs in 3D
Minimizing the Aggregate Movements for Interval Coverage
Online Bin Packing with Advice of Small Size
On the Approximability of Orthogonal Order Preserving Layout Adjustment
An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs
Generation of Colourings and Distinguishing Colourings of Graphs
Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time
On Coct-Free Multi-Coloring
Semi-dynamic connectivity in the plane
Interval Selection in the Streaming Model
On the Bounded-Hop Range Assignment Problem
Greedy Is an Almost Optimal Deque
A New Approach for Contact Graph Representations and Its Applications
Communication and Dynamic Networks
Dealing With 4-Variables by Resolution: An Improved MaxSAT Algorithm
Select with Groups of 3 or 4 Approximating Nearest Neighbor Distances
Linearity is Strictly More Powerful than Contiguity for Encoding Graphs
On the Complexity of an Unregulated Traffic Crossing
Finding Pairwise Intersections Inside a Query Range
Cache-Oblivious Iterated Predecessor Queries via Range Coalescing
Polylogarithmic Fully Retroactive Priority Queues
On the Minimum Eccentricity Shortest Path Problem
Convex polygons in geometric triangulations
Straight-line Drawability of a Planar Graph Plus an Edge
Solving Problems on Graphs of High Rank-Width
The Parametric Closure Problem
Rooted Cycle Bases
On the Chain Pair Simplification Problem
Finding Articulation Points of Large Graphs in Linear Time
LP-based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design
Universal Reconstruction of a String
The complexity of dominating set reconfiguration
Editing Graphs into Few Cliques: Complexity, Approximation, and Kernelization Schemes
Competitive Diffusion on Weighted Graphs
Sorting and Selection with Equality Comparisons
Polynomial Delay Algorithm for Listing Minimal Edge Dominating sets in Graphs
Fast and simple connectivity in graph timelines
Dynamic Set Intersection
Time-Space Trade-of is for Triangulations and Voronoi Diagrams
A 2k-Vertex Kernel for Maximum Internal Spanning Tree
Reconfiguration on sparse graphs
Smoothed Analysis of Local Search Algorithms
Optimal Shue Code with Permutation Instructions
Non-Preemptive Scheduling on Machines with Setup Times
A Moderately Exponential Time Algorithm for k -IBDD Satisfiability
On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids
Inferring People's Social Behavior by Exploiting Their Spatiotemporal Location Data
lastic Geometric Shape Matching for Point Sets under Translations
Constant Time Enumeration by Amortization
Computing the Center of Uncertain Points on Tree Networks
Swapping Colored Tokens on Graphs
Contact Graphs of Circular Arcs
Contact Representations of Graphs in 3D
Minimizing the Aggregate Movements for Interval Coverage
23.

電子ブック

EB
edited by Frank Nielsen, Frederic Barbaresco
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9389
オンライン: http://dx.doi.org/10.1007/978-3-319-25040-3
目次情報: 続きを見る
Dimension reduction on Riemannian manifolds
Optimal transport
Optimal transport and applications in imagery/statistics
Shape space and diffeomorphic mappings
Random geometry/homology
Hessian information geometry
Topological forms and Information
Information geometry optimization
Information geometry in image analysis
Divergence geometry
Optimization on manifold
Lie groups and geometric mechanics/thermodynamics
Computational information geometry
Lie groups: novel statistical and computational frontiers
Geometry of time series and linear dynamical systems
Bayesian and information geometry for inverse problems
Dimension reduction on Riemannian manifolds
Optimal transport
Optimal transport and applications in imagery/statistics
24.

電子ブック

EB
edited by Alex Biryukov, Vipul Goyal
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9462
オンライン: http://dx.doi.org/10.1007/978-3-319-26617-6
目次情報: 続きを見る
Public key encryption
Cryptanalysis
Side channel attacks
Information theoretic cryptography
Lightweight cryptography
Public key encryption
Cryptanalysis
Side channel attacks
25.

電子ブック

EB
edited by Zaixin Lu, Donghyun Kim, Weili Wu, Wei Li, Ding-Zhu Du
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9486
オンライン: http://dx.doi.org/10.1007/978-3-319-26626-8
26.

電子ブック

EB
edited by Jens Groth
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9496
オンライン: http://dx.doi.org/10.1007/978-3-319-27239-9
目次情報: 続きを見る
Authentication
Symmetric cryptography
2-party computation
Codes
Boolean functions
Information theory
Leakage resilience
Authentication
Symmetric cryptography
2-party computation
27.

電子ブック

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 ; 9135
オンライン: http://dx.doi.org/10.1007/978-3-662-47666-6
目次情報: 続きを見る
Towards the Graph Minor Theorems for Directed Graphs
Automated Synthesis of Distributed Controllers
Games for Dependent Types
Short Proofs of the Kneser-Lovasz Coloring Principle
Provenance Circuits for Trees and Treelike Instances
Language Emptiness of Continuous-Time Parametric Timed Automata
Analysis of Probabilistic Systems via Generating Functions and Pade Approximation
On Reducing Linearizability to State Reachability
The Complexity of Synthesis from Probabilistic Components
Edit Distance for Pushdown Automata
Solution Sets for Equations over Free Groups Are EDT0L Languages
Limited Set Quantifiers over Countable Linear Orderings
Reachability Is in DynFO
Natural Homology
Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes
Trading Bounds for Memory in Games with Counters
Decision Problems of Tree Transducers with Origin
Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words
The Odds of Staying on Budget
From Sequential Specifications to Eventual Consistency
Fixed-Dimensional Energy Games Are in Pseudo-Polynomial Time
An Algebraic Geometric Approach to Nivat’s Conjecture
Nominal Kleene Coalgebra
On Determinisation of Good-for-Games Automata
Owicki-Gries Reasoning for Weak Memory Models
On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension
Compressed Tree Canonization
Parsimonious Types and Non-uniform Computation
Baire Category Quantifier in Monadic Second Order Logic
Liveness of Parameterized Timed Networks
Symmetric Strategy Improvement
Effect Algebras, Presheaves, Non-locality and Contextuality
On the Complexity of Intersecting Regular, Context-Free, and Tree Languages
Containment of Monadic Datalog Programs via Bounded Clique-Width
An Approach to Computing Downward Closures
How Much Lookahead Is Needed to Win Infinite Games?
Symmetric Graph Properties Have Independent Edges
Polylogarithmic-Time Leader Election in Population Protocols
Core Size and Densification in Preferential Attachment Networks
Maintaining Near-Popular Matchings
Ultra-Fast Load Balancing on Scale-Free Networks
Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms
The Range of Topological Effects on Communication
Secretary Markets with Local Information
A Simple and Optimal Ancestry Labeling Scheme for Trees
Interactive Communication with Unknown Noise Rate
Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs
A Unified Framework for Strong Price of Anarchy in Clustering Games
On the Diameter of Hyperbolic Random Graphs
Tight Bounds for Cost-Sharing in Weighted Congestion Games
Distributed Broadcast Revisited: Towards Universal Optimality
Selling Two Goods Optimally
Adaptively Secure Coin-Flipping, Revisited
Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem
Normalization Phenomena in Asynchronous Networks
Broadcast from Minicast Secure Against General Adversaries
Towards the Graph Minor Theorems for Directed Graphs
Automated Synthesis of Distributed Controllers
Games for Dependent Types
28.

電子ブック

EB
edited by Keisuke Tanaka, Yuji Suga
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9241
オンライン: http://dx.doi.org/10.1007/978-3-319-22425-1
29.

電子ブック

EB
edited by Jean-Daniel Boissonnat, Albert Cohen, Olivier Gibaru, Christian Gout, Tom Lyche, Marie-Laurence Mazure, Larry L. Schumaker
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9213
オンライン: http://dx.doi.org/10.1007/978-3-319-22804-4
目次情報: 続きを見る
Preface
Finite Element Approximation with Hierarchical B-Splines
Non-linear Local Polynomial Regression Multiresolution Methods using ?1-norm Minimization with Application to Signal Processing
A New Class of Interpolatory L-splines with Adjoint End Conditions
On a New Conformal Functional for Simplicial Surfaces
Evaluation of Smooth Spline Blending Surfaces using GPU
Implicit Equations of Non-degenerate Rational Bezier Quadric Triangles
Support Vector Machines for Classification of Geometric Primitives in Point Clouds
Computing Topology Preservation of RBF Transformations for Landmark-Based Image Registration
New Bounds on the Lebesgue Constants of Leja Sequences on the Unit Disc and on ?-Leja Sequences
A Curvature Smooth Lofting Scheme for Singular Point Treatments
A Consistent Statistical Framework for Current-Based Representations of Surfaces
Isotropic M¨obius geometry and i-M circles on singular isotropic Cyclides
Symbolic Computation of Equi-affine Evolute for Plane B-spline Curves
On-line CAD Reconstruction with Accumulated Means of Local Geometric Properties
Analysis of Intrinsic Mode Functions Based on Curvature Motion-like PDEs
Differential Geometry Revisited by Biquaternion Clifford Algebra
Ridgelet Methods for Linear Transport Equations
Basis Functions for Scattered Data Quasi-interpolation
Optimality of a Gradient Bound for Polyhedral Wachspress Coordinates
Mass Smoothers in Geometric Multigrid for Isogeometric Analysis
On the Set of Trajectories of the Control Systems with Limited Control Resources
High Order Reconstruction from Cross-sections
Adaptive Atlas of Connectivity Maps
Matrix Generation in Isogeometric Analysis by Low Rank Tensor Approximation
Combination of Piecewise-geodesic Curves for Interactive Image Segmentation
A Fully-nested Interpolatory Quadrature Based on Fej´er’s Second Rule
CINPACT-splines: A Class of C1 Curves with Compact Support
Error Estimates for Approximate Operator Inversion via Kernel-based Methods
Boundary Controlled Iterated Function Systems
Construction of Smooth Isogeometric Function Spaces on Singularly Parameterized Domains
Reflexive Symmetry Detection in Single Image
Preface
Finite Element Approximation with Hierarchical B-Splines
Non-linear Local Polynomial Regression Multiresolution Methods using ?1-norm Minimization with Application to Signal Processing
30.

電子ブック

EB
edited by Vladimir P. Gerdt, Wolfram Koepf, Werner M. Seiler, Evgenii V. Vorozhtsov
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9301
オンライン: http://dx.doi.org/10.1007/978-3-319-24021-3
31.

電子ブック

EB
edited by Reneta P. Barneva, Bhargab B. Bhattacharya, Valentin E. Brimkov
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9448
オンライン: http://dx.doi.org/10.1007/978-3-319-26145-4
32.

電子ブック

EB
edited by Yevgeniy Dodis, Jesper Buus Nielsen
出版情報: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9014
オンライン: http://dx.doi.org/10.1007/978-3-662-46494-6
目次情報: 続きを見る
Foundations
Symmetric Key
Multiparty Computation
Concurrent and Resettable Security
Non-malleable Codes and Tampering
Privacy Amplification
Encryption and Key Exchange
Foundations
Symmetric Key
Multiparty Computation
33.

電子ブック

EB
edited by M. Sohel Rahman, Etsuji Tomita
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 8973
オンライン: http://dx.doi.org/10.1007/978-3-319-15612-5
目次情報: 続きを見る
Encoding Data Structures
Fast Algorithms for Constrained Graph Density Problems
The Directed Ring Loading with Penalty Cost
Edge-Colorings of Weighted Graphs (Extended Abstract)
Unit Covering in Color-Spanning Set Model
Compact Encodings and Indexes for the Nearest Larger Neighbor Problem
A Practical Succinct Data Structure for Tree-Like Graphs
Forming Plurality at Minimum Cost
Approximate Distance Oracle in O(n2) Time and O(n) Space for Chordal Graphs
Straight-Path Queries in Trajectory Data
Folding a Paper Strip to Minimize Thickness
An Almost Optimal Algorithm for Voronoi Diagrams of Non-disjoint Line Segments (Extended Abstract)
PTAS’s for Some Metric p-source Communication Spanning Tree Problems
Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement
Enumerating Eulerian Trails via Hamiltonian Path Enumeration
The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Trees
An Efficient Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous Networks
Dynamic Online Multiselection in Internal and External Memory
Competitive Analysis for Multi-objective Online Algorithms
Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends
An Improved Algorithm for Parameterized Edge Dominating Set Problem
On Bar (1, j)-Visibility Graphs (Extended Abstract)
Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs
Non-repetitive Strings over Alphabet Lists
Dichotomy Theorems for Homomorphism Polynomials of Graph Classes
Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid
Threshold Circuits for Global Patterns in 2-Dimensional Maps
Superset Generation on Decision Diagrams
On Triangle Cover Contact Graphs
Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs
Encoding Data Structures
Fast Algorithms for Constrained Graph Density Problems
The Directed Ring Loading with Penalty Cost
34.

電子ブック

EB
edited by Vangelis Th. Paschos, Peter Widmayer
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9079
オンライン: http://dx.doi.org/10.1007/978-3-319-18173-8
目次情報: 続きを見る
Communication, Dynamics and Renormalization
Fast and Powerful Hashing using Tabulation
Green Barrier Coverage with Mobile Sensors
A Re?ned Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths
Orthogonal Graph Drawing with In?exible Edges
Linear time Constructions of some d-Restriction Problems
E?ciently Testing T-Interval Connectivity in Dynamic Graphs
Competitive Strategies for Online Clique Clustering
Scheduling with Gaps: New Models and Algorithms
MinMax-Distance Gathering on given Meeting Points
Evacuating Robots from a Disk Using Face-to-Face Communication
Planarity of Streamed Graphs
Clique-width of Graph Classes De?ned by Two Forbidden Induced Subgraphs
Randomized Adaptive Test Cover
Contraction Blockers for Graphs with Forbidden Induced Paths
Label Placement in Road Maps
Discrete Stochastic Submodular Maximization: Adaptive vs. Non-Adaptive vs. O?ine
Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints
Simple strategies versus optimal schedules in multi-agent patrolling
Sharing Non-Anonymous Costs of Multiple Resources Optimally
Algorithms solving the Matching Cut problem
End-Vertices of Graph Search Algorithms
Deciding the On-line Chromatic Number of a Graph with Pre-coloring is PSPACE-complete
A Lex-BFS-based recognition algorithm for Robinsonian matrices
Mixed Map Labeling
Optimal Online Edge Coloring of Planar Graphs with Advice
Approximability of Two Variants of Multiple Knapsack
Block Sorting is Hard
An opportunistic text indexing structure based on run length encoding
PSPACE-completeness of Bloxorz and of Games with 2-Buttons
Advice Complexity of Fine-Grained Job Shop Scheduling
Communication, Dynamics and Renormalization
Fast and Powerful Hashing using Tabulation
Green Barrier Coverage with Mobile Sensors
35.

電子ブック

EB
edited by Jeffrey Shallit, Alexander Okhotin
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9118
オンライン: http://dx.doi.org/10.1007/978-3-319-19225-3
目次情報: 続きを見る
Invited Talks
Regular Functions
Unambiguity in Automata Theory
Contributed Papers
Partial Derivative Automaton for Regular Expressions with Shue
Upper Bound on Syntactic Complexity of Suffix-Free Languages
Nondeterministic Tree Width of Regular Languages
Integer Complexity: Experimental and Analytical Results II
Square on ideal, closed and free languages
A Tentative Approach for the Wadge-Wagner Hierarchy of Regular Tree Languages of Index [0,2]
Compressibility of finite languages by grammars
On the Complexity and Decidability of Some Problems Involving Shue
On the Computational Complexity of Problems Related to Distinguishability Sets
Prefix-Free Subsets of Regular Languages and Descriptional Complexity
Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic Problems
On Simulation Costs of Unary Limited Automata
On some decision problems for stateless deterministic ordered restarting Automata
Quantum queries on permutations
Complement on Free and Ideal Languages
Universal Disjunctive Concatenation and Star
Quasi-Distances and Weighted Finite Automata
The State Complexity of Permutations on Finite Languages Over Binary Alphabets
Star-Complement-Star on Prefix-Free Languages
Groups whose word problem is a Petri net language
Regular realizability problems and context-free languages
Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton
Quantum State Complexity of Formal Languages
Invited Talks
Regular Functions
Unambiguity in Automata Theory
36.

電子ブック

EB
edited by Ivan Dimov, Istvan Farago, Lubin Vulkov
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9045
オンライン: http://dx.doi.org/10.1007/978-3-319-20239-6
目次情報: 続きを見る
Simulation of Flow in Fractured Poroelastic Media: a Comparison of Different Discretization Approaches
A Transparent Boundary Condition for an Elastic Bottom in Underwater Acoustics
Well-Posedness in H¨older Spaces of Elliptic Differential and Difference Equations
Operator Semigroups for Convergence Analysis
The Power of Trefftz Approximations: Finite Difference, Boundary Difference and Discontinuous Galerkin Methods; Nonreflecting Conditions and Non-Asymptotic Homogenization
On Extension of Asymptotic Comparison Principle for Time Periodic Reaction-Diffusion-Advection Systems with Boundary and Internal Layers
The Finite Difference Method for Boundary Value Problem with Singularity
Superconvergence of Some Linear and Quadratic Functionals for Higher-order Finite Elements
Time Step for Numerically Solving Parabolic Problems
Recent Advances in Numerical Solution of HJB Equations Arising in Option Pricing
Applications of Numerical Methods for Stochastic Controlled Switching Diffusions with A Hidden Markov Chain: Case Studies on Distributed Power Management and Communication Resource Allocation
Error Estimates of the Crank-Nicolson-Polylinear FEM with the discrete TBC for the Generalized Schr¨odinger Equation in an Unbounded Parallelepiped
Difference Schemes for Delay Parabolic Equations with Periodic Boundary Conditions
Some Results of FEM Schemes Analysis by Finite Difference Method
Application of Finite Difference TVD Methods in Hypersonic Aerodynamics
Finite Difference Equations for Neutron Flux and Importance Distribution in 3D Heterogeneous Reactor
Matrix-free Iterative Processes for Implementation of Implicit Runge?Kutta Methods
Simulation of Technogenic and Climatic Influences in Permafrost
Iterative Implicit Methods for Solving Nonlinear Dynamical Systems: Application of the Levitron
Modeling Textile Fabric used in Pest Control with a 3 Scale Domain Decomposition Method
The Theory and Applications of the SMIF Method for Correct Mathematical Modeling of the Incompressible Fluid Flows
Determination of the Time-dependent Thermal Conductivity in the Heat Equation with Spacewise Dependent Heat Capacity
Inverse Problems of Simultaneous Determination of the Time-dependent Right-hand Side Term and the Coefficient in a Parabolic Equation
Effectiveness of the parallel implementation of the FEM for the problem of the surface waves propagation
Splitting Scheme for Poroelasticity and Thermoelasticity Problems
Simulation of Flow in Fractured Poroelastic Media: a Comparison of Different Discretization Approaches
A Transparent Boundary Condition for an Elastic Bottom in Underwater Acoustics
Well-Posedness in H¨older Spaces of Elliptic Differential and Difference Equations
37.

電子ブック

EB
edited by Adrian Kosowski, Igor Walukiewicz
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9210
オンライン: http://dx.doi.org/10.1007/978-3-319-22177-9
38.

電子ブック

EB
edited by Jerome Durand-Lose, Benedek Nagy
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9288
オンライン: http://dx.doi.org/10.1007/978-3-319-23111-2
39.

電子ブック

EB
edited by Christian Scheideler
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9439
オンライン: http://dx.doi.org/10.1007/978-3-319-25258-2
目次情報: 続きを見る
Communication Patterns and Input Patterns in Distributed Computing
Clock Synchronization and Estimation in Highly Dynamic Networks: An Information Theoretic Approach
Node Labels in Local Decision
Exact bounds for distributed graph colouring
Essential Traffic Parameters for Shared Memory Switch Performance. -Scheduling Multipacket Frames With Frame Deadlines
A Randomized Algorithm for Online Scheduling
Online Admission Control and Embedding of Service Chains
Optimizing Spread of Inuence in Social Networks via Partial Incentives
Approximation Algorithms For Multi-Budgeted Network Design Problems
Simple Distributed + 1 Coloring in the SINR Model
Nearly Optimal Local Broadcasting in the SINR Model with Feedback
Byzantine Gathering in Networks
Signature-free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus
A Fast Network-Decomposition Algorithm and its Applications to Constant-Time Distributed Computation
Path-Fault-Tolerant Approximate Shortest-Path Trees
A faster computation of all the best swap edges of a tree spanner
Randomized OBDD-Based Graph Algorithms
On Fast and Robust Information Spreading in the Vertex-Congest Model
Under the Hood of the Bakery Algorithm: Mutual Exclusion as a Matter of Priority
The Computability of Relaxed Data Structures: Queues and Stacks as Examples
Comparison-based Interactive Collaborative Filtering
Coalescing walks on rotor-router systems
Communication Patterns and Input Patterns in Distributed Computing
Clock Synchronization and Estimation in Highly Dynamic Networks: An Information Theoretic Approach
Node Labels in Local Decision
40.

電子ブック

EB
edited by Jarkko Kari
出版情報: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9099
オンライン: http://dx.doi.org/10.1007/978-3-662-47221-7
目次情報: 続きを見る
Dynamical, topological, ergodic and algebraic aspects
Algorithmic and complexity issues
Emergent properties
Formal language processing aspects
Symbolic dynamics
Models of parallelism and distributed systems
Timing schemes
Phenomenological descriptions
Scientific modeling
Practical applications
Dynamical, topological, ergodic and algebraic aspects
Algorithmic and complexity issues
Emergent properties
41.

電子ブック

EB
edited by Sumit Ganguly, Ramesh Krishnamurti
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 8959
オンライン: http://dx.doi.org/10.1007/978-3-319-14974-5
目次情報: 続きを見る
Obstruction Characterizations in Graphs and Digraphs
Approximation Algorithms
A PTAS for the Metric Case of the Minimum Sum-Requirement Communication Spanning Tree Problem
Constant Approximation for Broadcasting in k-cycle Graph
Computational Geometry
Three paths to point placement
Vertex Guarding in Weak Visibility Polygons
On Collections of Polygons Cuttable with a Segment Saw
Rectilinear path problems in the presences of rectangular obstacles
Computational Complexity
Parameterized Analogues of Probabilistic Computation
Algebraic Expressions of Rhomboidal Graphs
Solving Hamiltonian Cycle by an EPT Algorithm for a Non-sparse Parameter
Graph Theory. New Polynomial Case for Efficient Domination in P 6-free Graphs
Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties
Separator Theorems for Interval Graphs and Proper Interval Graphs
Bounds for the b-Chromatic Number of Induced Subgraphs and G e
New Characterizations Of Proper Interval Bigraphs and Proper Circular Arc Bigraphs
On Spectra of Corona Graphs
Axiomatic Characterization of the Median and Antimedian Functions on Cocktail-Party Graphs and Complete Graphs
Tree Path Labeling of Hypergraphs A Generalization of the Consecutive Ones Property
On a special class of boxicity 2 graph
Algorithms
Associativity for Binary Parallel Processes: a Quantitative Study
A Tight Bound for Congestion of an Embedding.-Auction/Belief propagation algorithms for constrained assignment problem
Domination in some subclasses of bipartite graphs
Bi-directional Search for Skyline Probability
Cumulative vehicle routing problem: a column generation approach
Energy Efficient Sweep Coverage with Mobile and Static Sensors
Generation of Random Digital Curves using Combinatorial Techniques
Obstruction Characterizations in Graphs and Digraphs
Approximation Algorithms
A PTAS for the Metric Case of the Minimum Sum-Requirement Communication Spanning Tree Problem
42.

電子ブック

EB
edited by Dongdai Lin, Moti Yung, Jianying Zhou
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 8957
オンライン: http://dx.doi.org/10.1007/978-3-319-16745-9
目次情報: 続きを見る
An Efficient Privacy-Preserving E-coupon System
Spatial Bloom Filters: Enabling Privacy in Location-Aware Applications
Security of Direct Anonymous Authentication Using TPM 2.0 Signature
Revocation in Publicly Verifiable Outsourced Computation
Private Aggregation with Custom Collusion Tolerance
Ring Signatures of Constant Size Without Random Oracles
Universally Composable Identity Based Adaptive Oblivious Transfer with Access Control
Three-Round Public-Coin Bounded-Auxiliary-Input Zero-Knowledge Arguments of Knowledge
A Model-Driven Security Requirements Approach to Deduce Security Policies Based on OrBAC
Optimal Proximity Proofs
Simpler CCA-Secure Public Key Encryption from Lossy Trapdoor Functions
Attacking RSA with a Composed Decryption Exponent Using Unravelled Linearization
Fully Homomorphic Encryption with Auxiliary Inputs
Trapdoors for Ideal Lattices with Applications
Speeding Up the Search Algorithm for the Best Differential and Best Linear Trails
The Boomerang Attacks on BLAKE and BLAKE2
Second Preimage Analysis of Whirlwind
Boomerang Attack on Step-Reduced SHA-512
Collision Attack on 4-Branch, Type-2 GFN Based Hash Functions Using Sliced Biclique Cryptanalysis Technique
Rig: A Simple, Secure and Flexible Design for Password Hashing
Efficient Hardware Accelerator for AEGIS-128 Authenticated Encryption
Fully Collusion-Resistant Traceable Key-Policy Attribute-Based Encryption with Sub-linear Size Ciphertexts
Integrating Ciphertext-Policy Attribute-Based Encryption with Identity-Based Ring Signature to Enhance Security and Privacy in Wireless Body Area Networks
Parallelized Software Implementation of Elliptic Curve Scalar Multiplication
A Note on Diem’s Proof
Stand-by Attacks on E-ID Password Authentication
Stegomalware: Playing Hide and Seek with Malicious Components in Smartphone Apps
A Lightweight Security Isolation Approach for Virtual Machines Deployment
A Novel Approach to True Random Number Generation in Wearable Computing Environments Using MEMS Sensors
An Efficient Privacy-Preserving E-coupon System
Spatial Bloom Filters: Enabling Privacy in Location-Aware Applications
Security of Direct Anonymous Authentication Using TPM 2.0 Signature
43.

電子ブック

EB
edited by Evripidis Bampis, Ola Svensson
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 8952
オンライン: http://dx.doi.org/10.1007/978-3-319-18263-6
目次情報: 続きを見る
Improved Approximations for the Max k-Colored Clustering Problem
A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line
Better Algorithms for Online Bin Stretching
Online Colored Bin Packing
Improved Bound for Online Square-into-Square Packing
Improved Approximation Algorithm for Fault-Tolerant Facility Placement
The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem
Online Multi-Coloring with Advice
Approximating Steiner Trees and Forests with Minimum Number of Steiner Points
Energy-Efficient Algorithms for Non-pre-emptive Speed-Scaling
Optimal Online and Offline Algorithms for Robot-Assisted Restoration of Barrier Coverage
Linear-Time Approximation Algorithms for Unit Disk Graphs
The Minimum Feasible Tileset Problem
Online Ad Assignment with an Ad Exchange
Minimum Linear Arrangement of Series-Parallel Graphs
Online Dual Edge Coloring of Paths and Trees
Online Packet Scheduling Under Adversarial Jamming
Generalized Hypergraph Matching via Iterated Packing and Local Ratio
Steiner Trees with Bounded RC-Delay
Multiprocessor Jobs, Pre-emptive Schedules, and One-Competitive Online Algorithms
Routing Under Uncertainty: The a priori Traveling Repairman Problem
Primal-Dual Algorithms for Precedence Constrained Covering Problems
Improved Approximations for the Max k-Colored Clustering Problem
A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line
Better Algorithms for Online Bin Stretching
44.

電子ブック

EB
edited by Jianxin Wang, Chee Yap
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9130
オンライン: http://dx.doi.org/10.1007/978-3-319-19647-3
目次情報: 続きを見る
Graph Modification Problems: A Modern Perspective
Soft Subdivision Search in Motion Planning, II: Axiomatics
On r-Gatherings on the Line
A New Algorithm for Intermediate Dataset Storage in a Cloud-Based Dataflow
Efficient Computation of the Characteristic Polynomial of a Threshold Graph
A Fast and Practical Method to Estimate Volumes of Convex Polytopes
Social Models and Algorithms for Optimization of Contact Immunity of Oral Polio Vaccine
The Directed Dominating Set Problem: Generalized Leaf Removal and Belief Propagation
A Linear Time Algorithm for Ordered Partition
Machine Scheduling with a Maintenance Interval and Job Delivery Coordination
Lower and Upper Bounds for Random Mimimum Satisfiability Problem
On Solving Systems of Diagonal Polynomial Equations Over Finite Fields
Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints
On the Sound Covering Cycle Problem in Paired de Bruijn Graphs
Approximation Algorithms for the Multilevel Facility Location Problem with Linear/Submodular Penalties
Smaller Kernels for Several FPT Problems Based on Simple Observations
ParameterizedMinimum Cost Partition of a Tree with Supply and Demand
The Online Storage Strategy for Automated Storage and Retrieval System with Single Open in One Dimension
Union Closed Tree Convex Sets
Fast Quantum Algorithms for Least Squares Regression and Statistic Leverage Scores
A New Distributed Algorithm for Computing a Dominating Set on Grids
Approximate Model Counting via Extension Rule
Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory
Truthful Strategy and Resource Integration for Multi-tenant Data Center Demand Response
Local Search to Approximate Max NAE-k-Sat Tightly
Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs
Enumeration, Counting, and Random Generation of Ladder Lotteries
Efficient Modular Reduction Algorithm Without Correction Phase
Super Solutions of Random Instances of Satisfiability
A Data Streams Analysis Strategy Based on Hadoop Scheduling Optimization for Smart Grid Application
Graph Modification Problems: A Modern Perspective
Soft Subdivision Search in Motion Planning, II: Axiomatics
On r-Gatherings on the Line
45.

電子ブック

EB
edited by Evripidis Bampis
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9125
オンライン: http://dx.doi.org/10.1007/978-3-319-20086-6
目次情報: 続きを見る
Data Structures
Parallel Construction of Succinct Trees
Tree Compression with Top Trees Revisited
A Bulk-Parallel Priority Queue in External Memory with STXXL
Graph Problems I
Greedily Improving Our Own Centrality in a Network
An Exact Algorithm for Diameters of Large Real Directed Graphs
Graph Partitioning for Independent Sets
Finding Connected Subgraphs of Fixed Minimum Density: Implementation and Experiments
Combinatorial Optimization I
On the Generation of Cutting Planes which Maximize the Bound Improvement
Separation of Generic Cutting Planes in Branch-and-Price Using a Basis
On a Nonconvex MINLP Formulation of the Euclidean Steiner Tree Problem in n-Space
Scheduling and Allocation
Scheduling MapReduce Jobs and Data Shuffle on Unrelated Processors
Station Assignment with Reallocation
Online Knapsack of Unknown Capacity: Energy Optimization for Smartphone Communications
Combinatorial Optimization II
Reoptimization Techniques for MIP Solvers
Submodular Minimization in the Context of Modern LP and MILP Methods and Solvers
Is Nearly-linear the Same in Theory and Practice? A Case Study with a Combinatorial Laplacian Solver
Efficient and Practical Tree Preconditioning for Solving Laplacian Systems
Other Applications I
Efficient Generation of Stable Planar Cages for Chemistry
Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment
Solving k-means on High-Dimensional Big Data
X Contents
Transportation Networks
Public Transit Labeling
On Balanced Separators in Road Networks
SALT. A Unified Framework for All Shortest-Path Query Variants on Road Networks
Other Applications II
Huffman Codes versus Augmented Non-Prefix-Free Codes
Experimental Analysis of an Online Dictionary Matching Algorithm for Regular Expressions with Gaps
in Bimatrix Games
The Effect of Almost-Empty Faces on Planar Kandinsky Drawings
Graph Problems II
An Experimental Analysis of a Polynomial Compression for the Steiner Cycle Problem
On the Quadratic Shortest Path Problem
A Solution Merging Heuristic for the Steiner Problem in Graphs Using Tree Decompositions
Data Structures
Parallel Construction of Succinct Trees
Tree Compression with Top Trees Revisited
46.

電子ブック

EB
edited by Stefan Mangard, Axel Y. Poschmann
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9064
オンライン: http://dx.doi.org/10.1007/978-3-319-21476-4
目次情報: 続きを見る
Side-Channel Attacks
Improving Non-Profiled Attacks on Exponentiations Based on Clustering and Extracting Leakage from Multi-Channel High-Resolution EM Measurements
Template Attacks vs. Machine Learning Revisited (and the Curse of Dimensionality in Side-Channel Analysis)
Efficient Selection of Time Samples for Higher-Order DPA with Projection Pursuits
Exploring the Resilience of Some Lightweight Ciphers Against Profiled Single Trace Attacks
Two Operands of Multipliers in Side-Channel Attack
FPGA Countermeasures
Evaluating the Duplication of Dual-Rail Precharge Logics on FPGAs
Side-Channel Protection by Randomizing Look-Up Tables on Reconfigurable Hardware
Timing Attacks and Countermeasures
A Faster and More Realistic Flush+Reload Attack on AES
Faster software for fast endomorphisms
Toward Secure Implementation of McEliece Decryption
Fault Attacks
Fault Injection with a new favor: Memetic Algorithms make a difference
Differential Fault Intensity Analysis on PRESENT and LED Block Ciphers
A Biased Fault Attack on the Time Redundancy Countermeasure for AES
Countermeasures
Faster Mask Conversion with Lookup Tables
Towards Evaluating DPA Countermeasures for Keccak on a Real ASIC
Hands-on Side-Channel Analysis Side-Channel Security Analysis of Ultra-Low-Power FRAM-based MCUs
Side Channel Attacks on Smartphones and Embedded Devices using Standard Radio Equipment
Side-Channel Attacks
Improving Non-Profiled Attacks on Exponentiations Based on Clustering and Extracting Leakage from Multi-Channel High-Resolution EM Measurements
Template Attacks vs. Machine Learning Revisited (and the Curse of Dimensionality in Side-Channel Analysis)
47.

電子ブック

EB
edited by Igor Potapov
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9168
オンライン: http://dx.doi.org/10.1007/978-3-319-21500-6
目次情報: 続きを見る
Recognisable Languages over Monads
Garside and quadratic normalisation: a survey
Grammar-Based Tree Compression
On decidability of intermediate levels of concatenation hierarchies
Ergodic in Finite permutations of minimal complexity
Diverse Palindromic Factorization is NP-Complete
Factorization in Formal Languages
Consensus Game Acceptors
On the Size of Two-Way Reasonable Automata for the Liveness Problem
Squareable Words
Complexity Analysis: Transformation Monoids of Finite Automata
Palindromic complexity of trees
Deciding proper conjugacy of classes of one-sided Finite-type-Dyck shifts
Transfinite Lyndon words
Unary patterns under permutations
Finite Automata Over In Finite Alphabets: Two Models with Transitions for Local Change
Enumeration formulin neutral sets
On the Density of Context-Free and Counter Languages
Star-Continuous Kleene Omega-Algebras
Unary probabilistic and quantum automata on promise problems
Generalizations of Code Languages with Marginal Errors
Minimal Reversible Deterministic Finite Automata
Multi-Sequential Word Relations
The Boundary of Prefix-Free Languages
A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group
Path Checking for MTL and TPTL over Data Words
On Distinguishing NC1 and NL
Sur minimisation of automata
On the Complexity of k-Piecewise Testability and the Depth of Automata
Interval Exchange Words and the Question of Hof, Knill, and Simon
State Complexity of Neighbourhoods and Approximate Pattern Matching
Deterministic ordered restarting automata that compute functions
Weight Assignment Logic
Complexity Bounds of Constant-Space Quantum Computation
Recognisable Languages over Monads
Garside and quadratic normalisation: a survey
Grammar-Based Tree Compression
48.

電子ブック

EB
edited by David F. Gleich, Julia Komjathy, Nelly Litvak
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9479
オンライン: http://dx.doi.org/10.1007/978-3-319-26784-5
49.

電子ブック

EB
edited by Aske Plaat, Jaap van den Herik, Walter Kosters
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9525
オンライン: http://dx.doi.org/10.1007/978-3-319-27992-3
目次情報: 続きを見る
Monte-Carlo Tree Search and its enhancements
Theoretical aspects and complexity.-Analysis of game characteristics
Search algorithms
Machine learning
Monte-Carlo Tree Search and its enhancements
Theoretical aspects and complexity.-Analysis of game characteristics
Search algorithms
50.

電子ブック

EB
edited by Yevgeniy Dodis, Jesper Buus Nielsen
出版情報: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9015
オンライン: http://dx.doi.org/10.1007/978-3-662-46497-7
目次情報: 続きを見る
Pseudorandom Functions and Applications
Proofs and Verifiable Computation
Differential Privacy
Functional Encryption
Obfuscation
Pseudorandom Functions and Applications
Proofs and Verifiable Computation
Differential Privacy