%{search_type} search results

• Fast Performance Estimation and Design Space Exploration of SSD Using AI Techniques.- Combining Task- and Data-level Parallelism for High-throughput CNN Inference on Embedded CPUs-GPUs MPSoCs.- AMAIX: A Generic Analytical Model for Deep Learning Accelerators.- Data Mining in System-Level Design Space Exploration of Embedded Systems.- CoPTA: Contiguous Pattern Speculating TLB Architecture.- A Fine-Granularity Image Pyramid Accelerator for Embedded Processors.- Rec2Poly: Converting Recursions to Polyhedral Optimized Loops Using an Inspector-Executor Strategy.- DRAMSys4
• .0: A Fast and Cycle-Accurate SystemC/TLM-Based DRAM Simulator.- Transpiling Python to Rust for Optimized Performance.- A Fast Heuristic to Pipeline SDF Graphs.- System Simulation of Memristor Based Computation in Memory Platforms.- Compiler Optimizations for Safe Insertion of Checkpoints in Intermittently Powered Systems.- Fine-Grained Power Modeling of Multicore Processors using FFNNs.- From High-Level Synthesis to Bundled-Data Circuits.- Energy-aware Partial-Duplication Task Mapping under Real-Time and Reliability Constraints.- A Quantitative Study of Locality in GPU Caches.- SPECIAL SESSION: Innovative Architectures for Security.- CHASM: Security Evaluation of Cache Mapping Schemes.- DeePar-SCA: Breaking Parallel Architectures of Lattice Cryptography via Learning Based Side-Channel Attacks.- Profiling Dilithium Digital Signature Traces for Correlation Differential Side Channel Attacks.- S-NET: A Confusion Based Countermeasure Against Power Attacks for SBOX.- Risk and Architecture factors in Digital Exposure Notification.- SPECIAL SESSION: European Projects on Embedded and High Performance Computing for Health Applications.- Introduction to the Special Session on "European Projects on Embedded and High Performance Computing for Health Applications".- VGM-Bench: FPU Benchmark Suite for Computer Vision, Computer Graphics and Machine Learning applications.- Decision Support Systems to Promote Health and Well-being of People of Working Age: the Case of the WorkingAge EU Project.- Technical Debt Management and Energy Consumption Evaluation in Implantable Medical Devices: The SDK4ED Approach.- Distributed Training on a Highly Heterogeneus HPC System.
• (source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 20th International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation, SAMOS 2020, held in Samos, Greece, in July 2020.*The 16 regular papers presented were carefully reviewed and selected from 35 submissions. In addition, 9 papers from two special sessions were included, which were organized on topics of current interest: innovative architectures for security and European projects on embedded and high performance computing for health applications. * The conference was held virtually due to the COVID-19 pandemic.
(source: Nielsen Book Data)

• On the Semantics of Polychronous Polytimed Specifications.- Backward Symbolic Optimal Reachability in Weighted Timed Automata.- Certifying Emptiness of Timed Buchi Automata.- Learning Specifications for Labelled Patterns.- On Subgame Perfect Equilibria in Turn-Based Reachability Timed Games.- Computing Maximally-Permissive Strategies in Acyclic Timed Games.- Dynamic Causes for the Violation of Timed Reachability Properties.- Active Learning of Timed Automata with Unknown Resets.- Computation of Transient in Max-Plus Linear Systems via SMT-Solving.- Clairvoyant Monitoring for Signal Temporal Logic Patterns.- Embedding Online RV for Fault Disambiguation on Robonaut2.- Guarded Autonomous Transitions Increase Conciseness and Expressiveness of Timed Automata.- Probabilistic Guarantees for Safe Deep Reinforcement Learning.- Incremental Methods for Checking Real-Time Consistency.- Reachability Analysis of Nonlinear Systems Using Hybridization and Dynamics Scaling.- Weakness Monitors for Fail-Aware Systems.
• (source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 18th International Conference on Formal Modeling and Analysis of Timed Systems, FORMATS 2020, held in Vienna, Austria, in September 2020. The 16 full papers and 2 short papers presented in this volume were carefully reviewed and selected from 42 submissions. The papers focus on topics such as foundations and semantics, methods and tools, techniques, algorithms, data structures, and software tools for analyzing timed systems and resolving temporal constraints. Due to the Corona pandemic this conference was held as a virtual event.
(source: Nielsen Book Data)

• Intro
• Preface
• Organization
• Contents
• Complexity Results for the Proper Disconnection of Graphs
• 1 Introduction
• 2 Hardness Results for Graphs with Maximum Degree Four
• 3 Hardness Results for Bipartite Graphs
• References
• A Polynomial Delay Algorithm for Enumerating 2-Edge-Connected Induced Subgraphs
• 1 Introduction
• 2 Preliminary
• 2.1 Graphs and Notations
• 2.2 Enumeration Algorithms
• 3 Family Tree of 2-Edge-Connected Induced Subgraphs
• 4 Enumeration Algorithm
• References
• An Optimal Algorithm for Bisection for Bounded-Treewidth Graph
• 1 Introduction

• 2 Preliminaries
• 3 Bounded-Treewidth Graphs
• 3.1 An O(2tn3)-Time Algorithm
• 3.2 A Refined Analysis for Join Nodes
• 3.3 Optimality of Our Algorithm
• 4 Hardness on Graph Classes
• 5 Line Graphs
• 6 Conclusion
• References
• Influence Maximization Under the Non-progressive Linear Threshold Model
• 1 Introduction
• 2 Preliminaries
• 3 Hardness of Maximization Problem
• 4 Acyclic Information Networks
• 4.1 Connection to the Random Walk
• 4.2 Submodularity of Acyclic NLT
• 5 Conclusions
• References
• Car-Sharing: Online Scheduling k Cars Between Two Locations
• 1 Introduction

• 1.1 Related Work
• 1.2 Problem Description and Preliminaries
• 1.3 Main Results
• 2 Lower Bounds
• 3 Upper Bounds
• 3.1 Greedy Dispatching (GD) Algorithm
• 3.2 Balanced Dispatching (BD)
• 4 Conclusions
• References
• Buffer Minimization with Conflicts on a Line
• 1 Introduction
• 1.1 Overview of Results
• 1.2 Related Literature
• 2 Definitions
• 3 The Competitive Ratio of the Path with Four Machines
• 4 Bounds on the Competitive Ratio for Five Machines
• 5 Results on m Machines
• References
• Single Machine Scheduling Problem with a Flexible Maintenance Revisited

• 1 Introduction
• 2 The Exact Worst-Case Bound
• 3 Initial Start Time Sensitivity Analysis
• References
• Minimizing Energy on Homogeneous Processors with Shared Memory
• 1 Introduction
• 2 Preliminaries
• 2.1 System and Task Model
• 2.2 Problem Definition
• 3 Warm-Up: Single Core Case
• 4 Multi-core Case
• 4.1 Computing Optimal Schedule for a Given Task Assignment
• 4.2 Task Assignment
• References
• Approximation Schemes for Subset Sum Ratio Problems
• 1 Introduction
• 2 Families of Variations of SSR
• 3 A Framework Yielding FPTAS for Problems in F-SSR
• 4 2-Set SSR

• 5 Approximation of SSR and Factor-r SSR
• References
• Two-Way Jumping Automata
• 1 Introduction
• 2 Preliminaries
• 2.1 Tape Head Modes
• 3 Two-Way Jumping Mode
• 4 Equivalence with Alternatively Defined RLDFA
• 5 Avoiding Infinite Loops
• References
• A Loopless Algorithm for Generating (k, m)-ary Trees in Gray-Code Order
• 1 Introduction
• 2 Preliminaries
• 3 A Loopless Algorithm
• 4 Concluding Remarks
• References
• An LP-Rounding Based Algorithm for a Uniform Capacitated Facility Location Problem with Penalties
• 1 Introduction
• 1.1 Background
• 1.2 Literature Reviews

This book constitutes the proceedings of the 14th International Workshop on Frontiers in Algorithmics, FAW 2020, held in Haikou, China, in May 2020. The conference was held virtually due to the COVID-19 pandemic. The 12 full papers presented in this volume were carefully reviewed and selected from 15 submissions. The workshop provides a focused forum on current trends of research on algorithms, discrete structures, and their applications, and brings together international experts at the research frontiers in these areas to exchange ideas and to present significant new results. The papers detail graph theory, scheduling and algorithm and complexity.
(source: Nielsen Book Data)

• Theoretical Advances.- Conditional Bigraphs.- Confluence up to Garbage.- Computing embeddings of directed bigraphs.- A Categorical Semantics for Guarded Petri Nets.- Unfolding Symbolic Attributed Graph Grammars.- Single Pushout Rewriting in Comprehensive Systems.- Initial Conflicts for Transformation Rules with Nested Application Conditions.- Patch Graph Rewriting.- Hypergraph basic categorial grammars.- Multilevel Typed Graph Transformations.- Application Domains.- Rewriting Theory for the Life Sciences: A Unifying Framework for CTMC Semantics.- Algebras for tree decomposable graphs.- Graph Parsing as Graph Transformation - Correctness of Predictive Top-Down Parsers.- Graph Consistency as a Graduated Property: Consistency-Sustaining and -Improving Graph Transformations.- Formal Verification of Invariants for Attributed Graph Transformation Systems Based on Nested Attributed Graph Conditions.- Optimistic and Pessimistic On-the- y Analysis for Metric Temporal Graph Logic.- Tool Presentations.- A Flexible and Easy-to-Use Library for the Rapid Development of Graph Tools in Java.- Multiscale graph grammars can generate Cayley graphs of groups and monoids.- The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants.- A Simulator for Probabilistic Timed Graph Transformation Systems with Complex Large-Scale Topologies.
• (source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 13th International Conference on Graph Transformation, ICGT 2020, in Bergen, Norway, in June 2020.*The 16 research papers and 4 tool paper presented in this book were carefully reviewed and selected from 40 submissions. One invited paper is also included. The papers deal with the following topics: theoretical advances; application domains; and tool presentations. *The conference was held virtually due to the COVID-19 pandemic.
(source: Nielsen Book Data)

• Search and Recommendation.- Improving Search Snippets in Context-aware Web Search Scenarios.- Investigating Fine-grained Usefulness Perception Process in Mobile Search.- ResFusion: A Residual Learning based Fusion Framework for CTR Prediction.- NLP for IR.- A Framework for Identifying Event's Relevance Comments in Twitter.- Enriching Pre-trained Language Model with Dependency Syntactic Information for Chemical-Protein Interaction Extraction.- Leveraging Label Semantics and Correlations for Judgment Prediction.- Position-aware hybrid attention network for Aspect-level Sentiment Analysis.- IR in Finance.- An Integrated Machine Learning Framework for Stock Price Prediction.- Empirical Research on Futures Trading Strategy Based on Time Series Algorithm.- Hierarchical Attention Network in Stock Prediction.- Online Topic Detection and Tracking System and its Application on Stock Market in China.- Semi-Supervised Sentiment Analysis for Chinese Stock Texts in Scarce Labeled Data Scenario and Price Prediction.
• (source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 26th China Conference on Information Retrieval, CCIR 2020, held in Xi'an, China, in August 2020.*The 12 full papers presented were carefully reviewed and selected from 102 submissions. The papers are organized in topical sections: search and recommendation, NLP for IR, and IR in finance. * Due to the COVID-19 pandemic the conference was held online supplemented with local on-site events.
(source: Nielsen Book Data)

• Algorithmic.- Hypergraph Decompositions.- Multi-Agent Path Finding.- New Constraint Programming Model.- On-Demand Multimodal Transit Systems.- Integer programming techniques.- Constrained Clustering.- Deep Neural Networks.- *Inference and relaxation methods.- Innovative applications of CP/AI/OR techniques.
• (source: Nielsen Book Data)

The volume LNCS 12296 constitutes the papers of the 17th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research which will be held online in September 2020. The 32 regular papers presented together with 4 abstracts of fast-track papers were carefully reviewed and selected from a total of 72 submissions. Additionally, this volume includes the 4 abstracts and 2 invited papers by plenary speakers. The conference program also included a Master Class on the topic "Recent Advances in Optimization Paradigms and Solving Technology".
(source: Nielsen Book Data)

• Section 1: Invited talks
• Section 2: Discrete optimization
• Section 3: Mathematical Programming
• Section 4: Game theory
• Section 5: Scheduling problem
• Section 6: Heuristics and Metaheuristics
• Section 7: Operational Research Applications.

This book constitutes the proceedings of the 19th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2020, held in Novosibirsk, Russia, in July 2020. The 31 full papers presented in this volume were carefully reviewed and selected from 102 submissions. The papers are grouped in these topical sections: discrete optimization; mathematical programming; game theory; scheduling problem; heuristics and metaheuristics; and operational research applications.
(source: Nielsen Book Data)

• Foundations of Reversible Computation
• Software and Reversible Systems: A Survey of Recent Activities
• Simulation and Design of Quantum Circuits
• Research on Reversible Functions Having Component Functions with Specified Properties
• An Overview
• A Case Study for Reversible Computing: Reversible Debugging
• Towards Choreographic-Based Monitoring
• Reversibility in Chemical Reactions
• Reversible Control of Robots
• Reversible Languages and Incremental State Saving in Optimistic Parallel Discrete Event Simulation
• Reversible Computation in Wireless Communications
• Error Reconciliation in Quantum Key Distribution Protocols.

This open access State-of-the-Art Survey presents the main recent scientific outcomes in the area of reversible computation, focusing on those that have emerged during COST Action IC1405 "Reversible Computation - Extending Horizons of Computing", a European research network that operated from May 2015 to April 2019. Reversible computation is a new paradigm that extends the traditional forwards-only mode of computation with the ability to execute in reverse, so that computation can run backwards as easily and naturally as forwards. It aims to deliver novel computing devices and software, and to enhance existing systems by equipping them with reversibility. There are many potential applications of reversible computation, including languages and software tools for reliable and recovery-oriented distributed systems and revolutionary reversible logic gates and circuits, but they can only be realized and have lasting effect if conceptual and firm theoretical foundations are established first

• Data Structures.- Algorithms.- Information Retrieval.- Compression.- Combinatorics on Words.- Computational Biology.
• (source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 27th International Symposium on String Processing and Information Retrieval, SPIRE 2020, held in Orlando, FL, USA, in October 2020. The 17 full papers and 4 short papers presented in this volume were carefully reviewed and selected from 32 submissions. They cover topics such as: data structures; algorithms; information retrieval; compression; combinatorics on words; and computational biology.
(source: Nielsen Book Data)

• Invited Papers.- Mobile Robots.- Dynamic Graphs.- Network Communication.- Multi-agent Systems.- Communication Complexity.- Game Theory.
• (source: Nielsen Book Data)

This book constitutes the refereed conference proceedings of the 27th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2020, held in Paderborn, Germany, in June 2020.* The 19 full papers and 2 invited papers presented in this book were carefully reviewed and selected from 41 submissions. They are divided into seven sections, i.e. invited papers; mobile robots; dynamic graphs; network communication; multi-agent systems; communication complexity; and game theory. * The conference was held virtually due to the COVID-19 pandemic.
(source: Nielsen Book Data)

• Session I
• File Systems, Storage and Communication.- A BeeGFS-based Caching File System for Data-intensive Parallel Computing.- Multiple HPC Environments-Aware Container Image Configuration Workflow for Large-Scale All-to-All Protein-Protein Docking Calculations.- DAOS: A Scale-out High Performance Storage Stack for Storage Class Memory.- Cloud Platform Optimization for HPC.- Session II
• Applications and Scheduling.- swGBDT: Efficient Gradient Boosted Decision Tree on Sunway Many-core Processor.- Numerical Simulations of Serrated Propellers to Reduce Noise.- High-performance Computing in Maritime and Offshore Applications.- Correcting Job Walltime in a Resource-Constrained Environment.

This open access book constitutes the refereed proceedings of the 6th Asian Supercomputing Conference, SCFA 2020, which was planned to be held in February 2020, but unfortunately, the physical conference was cancelled due to the COVID-19 pandemic. The 8 full papers presented in this book were carefully reviewed and selected from 22 submissions. They cover a range of topics including file systems, memory hierarchy, HPC cloud platform, container image configuration workflow, large-scale applications, and scheduling.

• Dirac-based Reduction Techniques for Quantitative Analysis of Discrete-time Markov Models.- Combining Machine and Automata Learning for Network Traffic Classification.- On the complexity of the upper r-tolerant edge cover problem.- Margin-based Semi-supervised Learning Using Apollonius circle.- Computing Boundary Cycle of a Pseudo-Triangle Polygon from its Visibility Graph.- Improved Algorithms for Distributed Balanced Clustering.- Finite Interval-Time Transition System for Real-Time Actors.- Path Planning with Objectives Minimum Length and Maximum Clearance.
• (source: Nielsen Book Data)

This book constitutes the refereed proceedings of the Third IFIP WG 1.8 International Conference on Topics in Theoretical Computer Science, TTCS 2020, held in Tehran, Iran, in July 2020. The conference was held virtually due to the COVID-19 pandemic. The 8 papers presented in this volume were carefully reviewed and selected from 24 submissions. They focus on novel and high-quality research in all areas of theoretical computer science, such as algorithms and complexity; logic, semantics, and programming theory; and more.
(source: Nielsen Book Data)

• Seeing Arboretum for the (partial k) Trees / Stefan Arnborg, Andrzej Proskurowski-- Collaborating With Hans: Some Remaining Wonderments / Michael R. Fellows, Frances A. Rosamond
• Hans Bodlaender and the Theory of Kernelization Lower Bounds / Danny Hermelin-- Algorithms, Complexity, and Hans / Jan van Leeuwen-- Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs / Mark de Berg, Sándor Kisfaludi-Bak
• As Time Goes By: Reflections on Treewidth for Temporal Graphs / Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche
• Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs / Alexander Grigoriev
• Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds / Bart M. P. Jansen
• Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths / Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
• Four shorts stories on surprising algorithmic uses of treewidth / Dániel Marx
• Algorithms for NP-Hard Problems via Rank-related Parameters of Matrices / Jesper Nederlof
• A Survey on Spanning Tree Congestion / Yota Otachi
• Surprising Applications of Treewidth Bounds for Planar Graphs / Marcin Pilipczuk
• Computing tree decompositions / Michał Pilipczuk
• Experimental analysis of treewidth / Hisao Tamaki
• A Retrospective on (Meta) Kernelization / Dimitrios M. Thilikos
• Games, Puzzles and Treewidth / Tom C. van der Zanden
• Fast Algorithms for Join Operations on Tree Decompositions / Johan M. M. van Rooij.

This Festschrift was published in honor of Hans L. Bodlaender on the occasion of his 60th birthday. The 14 full and 5 short contributions included in this volume show the many transformative discoveries made by H.L. Bodlaender in the areas of graph algorithms, parameterized complexity, kernelization and combinatorial games. The papers are written by his former Ph. D. students and colleagues as well as by his former Ph. D. advisor, Jan van Leeuwen.

• 1. Minimization of testing costs in capacity-constrained database migration / K. Subramani, Bugra Caskurlu, and Alvaro Velasquez
• 2. Community detection via neighborhood overlap and spanning tree computations / Ketki Kulkarni, Aris Pagourtzis, Katerina Potika, Petros Potikas, and Dora Souliou
• 3. Colocation, colocation, colocation : optimizing placement in the hybrid cloud / Srinivas Aiyar, Karan Gupta, Rajmohan Rajaraman, Bochao Shen, Zhifeng Sun, and Ravi Sundaram
• 4. A peer-to-peer based cloud storage supporting orthogonal range queries of arbitrary dimension / Markus Benter, Till Knollmann, Friedhelm Meyer auf der Heide, Alexander Setzer, and Jannik Sundermeier
• 5. A fully polynomial time approximation scheme for packing while traveling / Frank Neumann, Sergey Polyakovskiy, Martin Skutella, Leen Stougie, and Junhua Wu
• 6. Multi-commodity flow with in-network processing / Moses Charikar, Yonatan Naamad, Jenifer Rexford, and X. Kelvin Zou
• 7. On-line big-data processing for visual analytics with Argus-Panoptes / Panayiotis I. Vlantis and Alex Delis
• 8. An overview of big data issues in privacy-preserving record linkage / Dinusha Vatsalan, Dimitrios Karapiperis, and Aris Gkoulalas-Divanis
• 9. Web frameworks metrics and benchmarks for data handling and visualization / Alexandros Gazis and Eleftheria Katsiri
• 10. Algorithms for cloud-based smart mobility / Kalliopi Giannakopoulou
• 11. A frequent itemset hiding toolbox / Aris Gkoulalas-Divanis, Vasileios Kagklis, and Elias C. Stavropoulos.

This book constitutes the refereed post-conference proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing, ALGOCLOUD 2018, held in Helsinki, Finland, in August 2018. The 11 revised full papers were carefully reviewed and selected from 29 submissions. The aim of the symposium is to present research activities and results on topics related to algorithmic, design, and development aspects of modern cloud-based systems.
(source: Nielsen Book Data)

• Homage from Friends.- Observational Semantics.- Coordination Models and Languages.- Logics and Types.- Distributed Systems Modelling.- Security.
• (source: Nielsen Book Data)

This volume was published in honor of Rocco De Nicola's 65th birthday. The Festschrift volume contains 27 papers written by close collaborators and friends of Rocco De Nicola and was presented to Rocco on the 1st of July 2019 during a two-day symposium held in Lucca, Italy. The papers present many research ideas that have been influenced by Rocco's work. They testify his intellectual curiosity, versatility and tireless research activity, and provide an overview of further developments to come. The volume consists of six sections. The first one contains a laudation illustrating the distinguished career and the main scientific contributions by Rocco and a witness of working experiences with Rocco. The remaining five sections comprise scientific papers related to specific research interests of Rocco and are ordered according to his scientific evolution: Observational Semantics; Logics and Types; Coordination Models and Languages; Distributed Systems Modelling; Security.
(source: Nielsen Book Data)

• Data compression
• Information retrieval
• String algorithms
• Algorithms
• Computational biology
• Indexing and compression
• Compressed data structures.

This volume constitutes the refereed proceedings of the 26th International Symposium on String Processing and Information Retrieval, SPIRE 2019, held in Segovia, Spain, in October 2019. The 28 full papers and 8 short papers presented in this volume were carefully reviewed and selected from 59 submissions. They cover topics such as: data compression; information retrieval; string algorithms; algorithms; computational biology; indexing and compression; and compressed data structures.

• A Topological Perspective on Distributed Network Algorithms
• On Sense of Direction and Mobile Agents
• Locality of not-so-weak coloring
• Near-gathering of energy-constrained mobile agents
• Optimal Multi Broadcast with Beeps using Group Testing
• Tracking Routes in Communication Networks
• Positional Encoding by Robots with Non-Rigid Movements
• Arbitrary Pattern Formation by Asynchronous Opaque Robots with Lights
• Breaking the Linear-Memory Barrier in MPC: Fast MIS on Trees with Strongly Sublinear Memory
• Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Robots
• Asynchronous Rendezvous with Different Maps
• Gathering Synchronous Robots in Graphs: from general properties to dense and symmetric topologies
• Time-Energy Tradeoffs for Evacuation by Two Robots in the Wireless Model
• Evacuating Two Robots from a Disk: A Second Cut
• Distributed pattern formation in a ring
• On Distributed Merlin-Arthur Decision Protocols
• Anonymous Read/Write Memory: Leader Election and Desanonymization
• Faster Construction of Overlay Networks
• Partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings
• Set Agreement Power is not a Precise Characterization for Oblivious Deterministic Anonymous Objects
• Making Randomized Algorithms Self-Stabilizing
• How to Color a French Flag{Biologically Inspired Algorithms for Scale-Invariant Patterning
• Self-Adjusting Line Networks
• Mutual Visibility for Asynchronous Robots
• Infinite Grid Exploration by Disoriented Robots
• A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks
• Mobile Robots with Uncertain Visibility Sensors: Possibility Results and Lower Bounds
• A strongly-stabilizing protocol for spanning tree construction against a mobile Byzantine fault
• Average-based Population Protocols : Explicit and Tight Bounds of the Convergence Time
• Visiting Infinitely Often the Unit Interval while Minimizin g the Idle-time of High Priority Points.

This book constitutes the refereed conference proceedings of the 26th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2019, held in LAquila, Italy, in July 2019. The 19 full papers and 9 short papers presented in this book were carefully reviewed and selected from 39 submissions. They are devoted to the study of the interplay between structural knowledge, communication, and computing in decentralized systems of multiple communicating entities.

• 1. Colocation of potential parallelism in a distributed adaptive run-time system for parallel Haskell / Evgenij Belikov, Hans-Wolfgang Loidl, Greg Michaelson
• 2. Reversible session-based concurrency in Haskell / Folkert de Vries, Jorge A. Pérez
• 3. Intrinsic currying for C++ template metaprograms / Paul Keir, Andrew Gozillon, Seyed Hossein Haeri
• 4. Towards optic-based algebraic theories : the case of lenses / J. López-González, Juan M. Serrano
• 5. Saint : an API-generic type-safe interpreter / Maximilian Algehed, Patrick Jansson, Sólrún Halla Einarsdóttir, Alex Gerdes
• 6. Improving Haskell / Martin A.T. Handley, Graham Hutton
• 7. High-performance defunctionalisation in Futhark / Anders Kiel Hovgaard, Troels Henriksen, Martin Elsman.

This book constitutes the thoroughly refereed revised selected papers of the 19th International Symposium on Trends in Functional Programming, TFP 2018, held in Gothenburg, Sweden, in June 2018. The 7 revised full papers were selected from 13 submissions and present papers in all aspects of functional programming, taking a broad view of current and future trends in the area. It aspires to be a lively environment for presenting the latest research results, and other contributions, described in draft papers submitted prior to the symposium.
(source: Nielsen Book Data)

• Minimum Diameter $k$-Steiner Forest.- Factors Impacting the Label Denoising of Neural Relation Extraction.- Makespan Minimization on Unrelated Parallel Machines with a Few Bags.- Channel Assignment with r-Dynamic Coloring.- Profit Maximization Problem with Coupons in Social Networks.- A Bicriteria Approximation Algorithm for Minimum Submodular Cost Partial Multi-Cover Problem.- A Novel Approach to Verifying Context Free Properties of Programs.- Determination of Dual Distances for a Kind of Perfect Mixed Codes.- Approximation and Competitive Algorithms for Single-Minded Selling Problem.- An Empirical Analysis of Feasibility Checking Algorithms for UTVPI Constraints.- Quality-aware Online Task Assignment Using Latent Topic Model.- Calibration Scheduling with Time Slot Cost.- The k-power domination problem in weighted trees.- General Rumor Blocking: An Efficient Random Algorithm with Martingale Approach.- A Robust Power Optimization Algorithm to Balance Base Stations' Load in LTE-A Network.- Faster Compression of Patterns to Rectangle Rule Lists.- Algorithm Designs for Dynamic Ridesharing System.- New LP Relaxations for Minimum Cycle/Path/Tree Cover Problems.- Computation of Kullback-Leibler Divergence between Labeled Stochastic Systems with Non-Identical State Spaces.- Order preserving barrier coverage with weighted sensors on a line.- Achieving Location Truthfulness in Rebalancing Supply-Demand Distribution for Bike Sharing.- Approximation algorithms and a hardness result for the three-machine proportionate mixed-shop problem.- A New Algorithm Design Technique for Hard Problems, Building on Methods of Complexity Theory.- Community-based Acceptance Probability Maximization for Target Users on Social Networks.- Knowledge Graph Embedding Based on Subgraph-aware Proximity.
• (source: Nielsen Book Data)

This volume constitutes the proceedings of the 12th International Conference on Algorithmic Aspects in Information and Management, AAIM 2018, held in Dallas, Texas, USA, in December 2018. The 25 full papers presented were carefully reviewed and selected. The papers deal with current trends of research on algorithms, data structures, operation research, combinatorial optimization and their applications.
(source: Nielsen Book Data)

• Various dimensions of parallel algorithms and architectures.- Fundamental theoretical approaches.- Practical experimental projects.- Commercial components and systems.- Beyond the limits of existing technologies.- Experimental efforts, innovative systems, and investigations.- identify weaknesses in existing parallel processing technology.
• (source: Nielsen Book Data)

This book constitutes the refereed workshop proceedings of the 16th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2016, held in Granada, Spain, in December 2016. The 30 full papers presented were carefully reviewed and selected from 58 submissions. They cover many dimensions of parallel algorithms and architectures, encompassing fundamental theoretical approaches, practical experimental projects, and commercial components and systems trying to push beyond the limits of existing technologies, including experimental efforts, innovative systems, and investigations that identify weaknesses in existing parallel processing technology.
(source: Nielsen Book Data)