Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Algorithms and Architectures for Parallel Processing [[electronic resource] ] : 19th International Conference, ICA3PP 2019, Melbourne, VIC, Australia, December 9–11, 2019, Proceedings, Part I / / edited by Sheng Wen, Albert Zomaya, Laurence T. Yang
| Algorithms and Architectures for Parallel Processing [[electronic resource] ] : 19th International Conference, ICA3PP 2019, Melbourne, VIC, Australia, December 9–11, 2019, Proceedings, Part I / / edited by Sheng Wen, Albert Zomaya, Laurence T. Yang |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (XXII, 715 p. 534 illus., 191 illus. in color.) |
| Disciplina | 004.35 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Mathematics—Data processing
Algorithms Computer engineering Computer networks Operating systems (Computers) Computational Mathematics and Numerical Analysis Computer Engineering and Networks Operating Systems |
| ISBN | 3-030-38991-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | PPS: A Low-Latency and Low-Complexity switching architecture based on packet prefetch and arbitration prediction -- SWR: Using Windowed Reordering to Achieve Fast and Balanced Heuristic for Streaming Vertex-Cut Graph Partitioning -- Flexible Data Flow Architecture for Embedded Hardware Accelerators -- HBL-Sketch: a New Three-tier Sketch for Accurate Network Measurement -- Accelerating Large Integer Multiplication Using Intel AVX-512IFMA -- A Communication-Avoiding Algorithm for Molecular Dynamics Simulation -- Out-of-Core GPU-Accelerated Causal Structure Learning -- Accelerating Lattice Boltzmann Method by Fully Exposing Vectorizable Loops -- A Solution for High Availability Memory Access -- Verication of Microservices Using Metamorphic Testing -- A New Robust and Reversible Watermarking Technique Based on Erasure Code -- Exit-Less Hypercall: Asynchronous System Calls in Virtualized Processes -- Automatic Optimization of Python Skeletal Parallel Programs -- Distributed & Parallel & Network-based Computing Impromptu Rendezvous Based Multi-Threaded Algorithm for Shortest Lagrangian Path Problem on Road Networks -- FANG: Fast and E cient Successor-State Generation for Heuristic Optimization on GPUs -- DETER: Streaming Graph Partitioning via Combined Degree and Cluster Information -- Which Node Properties Identify the Propagation Source in Networks? -- t/t-Diagnosability of BCube Network -- Strark-H: A Strategy for Spatial Data Storage to Improve Query Efficiency Based on Spark -- Multitask Assignment Algorithm Based on Decision Tree in Spatial Crowdsourcing Environment -- TIMOM: a novel time in uence multi-objective optimization cloud data storage model for business process management -- RTEF-PP: A Robust Trust Evaluation Framework with Privacy Protection for Cloud Services Providers -- A Privacy-Preserving Access Control Scheme with Veri able and Outsourcing Capabilities in Fog-Cloud Computing -- Utility-aware Edge Server Deployment in Mobile Edge Computing -- Predicting Hard Drive Failures for Cloud Storage Systems -- Efficient Pattern Matching on CPU-GPU Heterogeneous Systems -- Improving Performance of Batch Point-to-point Communications by Active Contention Reduction through Congestion-avoiding Message Scheduling -- Applications of Distributed & Parallel Computing -- An Open Identity Authentication Scheme Based on Blockchain -- RBAC-GLA role-based access control gasless architecture of consortium blockchain -- Developing Patrol Strategies for the Cooperative Opportunistic Criminals -- Deep Learning vs. Traditional Probabilistic Models: Case Study on Short Inputs for Password Guessing. . |
| Record Nr. | UNISA-996418217703316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Architectures for Parallel Processing [[electronic resource] ] : 19th International Conference, ICA3PP 2019, Melbourne, VIC, Australia, December 9–11, 2019, Proceedings, Part II / / edited by Sheng Wen, Albert Zomaya, Laurence T. Yang
| Algorithms and Architectures for Parallel Processing [[electronic resource] ] : 19th International Conference, ICA3PP 2019, Melbourne, VIC, Australia, December 9–11, 2019, Proceedings, Part II / / edited by Sheng Wen, Albert Zomaya, Laurence T. Yang |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (XXI, 699 p. 335 illus., 245 illus. in color.) |
| Disciplina | 004.35 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Mathematics—Data processing
Algorithms Computer engineering Computer networks Operating systems (Computers) Computational Mathematics and Numerical Analysis Computer Engineering and Networks Operating Systems |
| ISBN | 3-030-38961-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | PPS: A Low-Latency and Low-Complexity switching architecture based on packet prefetch and arbitration prediction -- SWR: Using Windowed Reordering to Achieve Fast and Balanced Heuristic for Streaming Vertex-Cut Graph Partitioning -- Flexible Data Flow Architecture for Embedded Hardware Accelerators -- HBL-Sketch: a New Three-tier Sketch for Accurate Network Measurement -- Accelerating Large Integer Multiplication Using Intel AVX-512IFMA -- A Communication-Avoiding Algorithm for Molecular Dynamics Simulation -- Out-of-Core GPU-Accelerated Causal Structure Learning -- Accelerating Lattice Boltzmann Method by Fully Exposing Vectorizable Loops -- A Solution for High Availability Memory Access -- Verication of Microservices Using Metamorphic Testing -- A New Robust and Reversible Watermarking Technique Based on Erasure Code -- Exit-Less Hypercall: Asynchronous System Calls in Virtualized Processes -- Automatic Optimization of Python Skeletal Parallel Programs -- Distributed & Parallel & Network-based Computing Impromptu Rendezvous Based Multi-Threaded Algorithm for Shortest Lagrangian Path Problem on Road Networks -- FANG: Fast and E cient Successor-State Generation for Heuristic Optimization on GPUs -- DETER: Streaming Graph Partitioning via Combined Degree and Cluster Information -- Which Node Properties Identify the Propagation Source in Networks? -- t/t-Diagnosability of BCube Network -- Strark-H: A Strategy for Spatial Data Storage to Improve Query Efficiency Based on Spark -- Multitask Assignment Algorithm Based on Decision Tree in Spatial Crowdsourcing Environment -- TIMOM: a novel time in uence multi-objective optimization cloud data storage model for business process management -- RTEF-PP: A Robust Trust Evaluation Framework with Privacy Protection for Cloud Services Providers -- A Privacy-Preserving Access Control Scheme with Veri able and Outsourcing Capabilities in Fog-Cloud Computing -- Utility-aware Edge Server Deployment in Mobile Edge Computing -- Predicting Hard Drive Failures for Cloud Storage Systems -- Efficient Pattern Matching on CPU-GPU Heterogeneous Systems -- Improving Performance of Batch Point-to-point Communications by Active Contention Reduction through Congestion-avoiding Message Scheduling -- Applications of Distributed & Parallel Computing -- An Open Identity Authentication Scheme Based on Blockchain -- RBAC-GLA role-based access control gasless architecture of consortium blockchain -- Developing Patrol Strategies for the Cooperative Opportunistic Criminals -- Deep Learning vs. Traditional Probabilistic Models: Case Study on Short Inputs for Password Guessing. . |
| Record Nr. | UNISA-996418217903316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Architectures for Parallel Processing [[electronic resource] ] : 20th International Conference, ICA3PP 2020, New York City, NY, USA, October 2–4, 2020, Proceedings, Part I / / edited by Meikang Qiu
| Algorithms and Architectures for Parallel Processing [[electronic resource] ] : 20th International Conference, ICA3PP 2020, New York City, NY, USA, October 2–4, 2020, Proceedings, Part I / / edited by Meikang Qiu |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (XXVII, 734 p. 315 illus.) |
| Disciplina | 004.35 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Mathematics—Data processing
Computer science Computer engineering Computer networks Microprogramming Computer input-output equipment Computational Mathematics and Numerical Analysis Theory of Computation Computer Engineering and Networks Control Structures and Microprogramming Input/Output and Data Communications Computer Communication Networks |
| ISBN | 3-030-60245-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | COMBS: First Open-Source based Benchmark Suite for Multi-Physics Simulation Relevant HPC Research -- Efficient Sorting and Join on NVM-Based Hybrid Memory -- Parallel SCC Detection Based on Reusing Warps and Coloring Partitions on GPUs -- Procedure and Loop Level Speculative Parallelism Analysis in HPEC -- CTA: A Critical Task Aware Scheduling Mechanism for Dataflow Architecture -- An Adaptive Thread Partitioning Approach in Speculative Multithreading -- PMC-based dynamic adaptive CPU and DRAM power modeling -- A Multi-threaded Algorithm for Capacity Constrained Assignment over Road Networks -- A Dynamic Scheduling Strategy of ADMM Sub-problem Optimization Algorithm Based on Hierachical Structure -- An Improved Heterogeneous Dynamic List Schedule Algorithm -- FastThetaJoin: An Optimization on Multi-way Data Stream $\theta$-join with Range Constraints -- A Distributed Framework for Online Stream Data Clustering -- End-System Aware Large File Transfer Solution for Rich Media Applications over 5G Mobile Networks -- Broad Learning System with Proportional-Integral-Differential Gradient Descent -- Accelerating De Novo Assembler WTDBG2 on Commodity Servers -- Typing Everywhere With EMG Keyboard: A Novel Myo Armband-based HCI Tool -- Accelerating Pattern Matching on Intel Xeon Phi Processors -- Redistributing and Optimizing High-Resolution Ocean Model POP2 to Million Sunway Cores -- Performance Optimization for Feature Extraction Section of DeepChem -- Principal Component Analysis Based Fingerprint Positioning -- Priority Based Service Placement Strategy in Heterogeneous Mobile Edge Computing -- VTC: a scheduling framework between soft real-time and hard real-time on multimedia OS -- A BSP Based Approach For NFAs Intersection -- Tight Bound of Parallel Request Latency for Erasure-Coded Distributed Storage System -- High-Performance Simulations on GPUs using Adaptive Time Steps -- Performance Modeling of Stencil Computation on SW26010 Processors -- Optimizing B+-Tree Searches on coupled CPU-GPU architectures -- OCVM: Optimizing the Isolation of Virtual Machines with Open-Channel SSDs -- CANRT: A Client-Active NVM-based Radix Tree for Fast Remote Access -- Distributed and Parallel Ensemble Classification for Big Data Based on Kernel Density Estimation and Random Sample Partition -- SWAF: A Distributed Solar WSN Adaptive Framework -- Formalizing and Verifying Decentralized Systems with Extended Concurrent Separation Logic -- PRIAG: Proximal Reweighted Incremental Aggregated Gradient Algorithm for Distributed Optimizations -- Decentralized Expectation Maximization Algorithm -- Towards a Deep-pipelined Architecture for Accelerating Deep GCN on a Multi-FPGA Platform -- Linear Scalability from Sharding and PoS -- Tree2tree Structural Language Modeling for Compiler Fuzzing -- Research and Design of Distribution Equipment Health Early Warning System -- Parallel Processing Algorithms for the Vehicle Routing Problem and its Variants: A Literature Review with a Look into the Future -- Multi-Scaled Non-Local Means Parallel Filters for Medical Image Denoising -- Optimized HybridSketch: More Efficient with Analysis and Algorithm -- An Overlapping Community Detection Algorithm based on Triangle Reduction Weighted for Large-scale Complex Network -- Parallel Belief Propagation Optimized by Coloring on GPUs -- A Multiplatform Parallel Approach for Lattice Sieving Algorithms -- Effect of Evaporation on Aggregation Kinetics of Clusters: A Monte Carlo Simulation Study -- Processing in Memory Assisted MEC 3C Resource Allocation for Computation Offloading -- Beacons Selection Based Localization in Wireless Sensor Networks -- A Periodic Variable Star Observation System with High Accuracy Based on Star Sensors. |
| Record Nr. | UNISA-996418315603316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Architectures for Parallel Processing [[electronic resource] ] : 20th International Conference, ICA3PP 2020, New York City, NY, USA, October 2–4, 2020, Proceedings, Part III / / edited by Meikang Qiu
| Algorithms and Architectures for Parallel Processing [[electronic resource] ] : 20th International Conference, ICA3PP 2020, New York City, NY, USA, October 2–4, 2020, Proceedings, Part III / / edited by Meikang Qiu |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (XV, 712 p. 250 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Mathematics—Data processing
Application software Computer engineering Computer networks Software engineering Data structures (Computer science) Information theory Data protection Computational Mathematics and Numerical Analysis Computer and Information Systems Applications Computer Engineering and Networks Software Engineering Data Structures and Information Theory Data and Information Security |
| ISBN | 3-030-60248-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Understanding Privacy-preserving Techniques in Digital Cryptocurrencies -- LNBFSM: A Food Safety Management System Using Blockchain and Lightning Network -- Reputation-based Trustworthy Supply Chain Management Using Smart Contract -- Content-aware Anomaly Detection with Network Representation Learning -- Blockchain Based Data Integrity Verification for Cloud Storage with T-Merkle Tree -- IM-ACS： An Access Control Scheme Supporting Informal non-Malleable Security in Mobile Media Sharing System -- Blockchain-Based Secure and Privacy-Preserving Clinical Data Sharing and Integration -- Blockchain Meets DAG: A BlockDAG Consensus Mechanism -- Dynamic Co-located VM Detection and Membership Update for Residency Aware Inter-VM Communication in Virtualized Clouds -- An attack-immune trusted architecture for supervisory intelligent terminal -- A simulation study on block generation algorithm based on TPS model -- Improving iForest for Hydrological Time Series Anomaly Detection -- Machine Learning-based Attack Detection Method in Hadoop -- Profiling-based Big Data Workflow Optimization in a Cross-Layer Coupled Design Framework -- Detection of Loose Tracking Behavior over Trajectory Data -- Behavioral fault modeling and analysis with BIP: A Wheel Brake System Case Study -- H2P: A Novel Model to Study the Propagation of Modern Hybrid Worm in Hierarchical Networks -- Design of six-rotor drone based on target detection for intelligent agriculture -- Consensus in Lens of Consortium Blockchain: An Empirical Study -- Collaborative design service system based on ceramic cloud service platform -- Towards NoC protection of HT-Greyhole attack -- Cross-Shard Transaction Processing in Sharding Blockchains -- Lexicon-Enhanced Transformer With Pointing For Domains Specific Generative Question Answering -- Design of Smart Home System Based on Collaborative Edge Computing and Cloud Computing -- Classification of Depression Based on Local Binary Pattern and Singular Spectrum Analysis -- Cloud Allocation and Consolidation Based on a Scalability Metric -- Adversarial Attacks on Deep Learning Models of Computer Vision: A Survey -- PLRS: Personalized literature hybrid recommendation system with paper influence- FleetChain: A Secure Scalable and Responsive Blockchain Achieving Optimal Sharding -- DSBFT: A Delegation based Scalable Byzantine False Tolerance Consensus Mechanism -- A Privacy-Preserving Approach for Continuous Data Publication -- Web Attack Detection based on User Behaviour Semantics -- A Supervised Anonymous Issuance scheme of Central Bank Digital Currency based on Blockchain -- IncreAIBMF: Incremental Learning for Encrypted Mobile Application Identification -- A Multi-Level Features Fusion Network for Detecting Obstructive Sleep Apnea Hypopnea Syndrome -- BIMP: Blockchain-Based Incentive Mechanism With Privacy Preserving in Location Proof -- Indoor Positioning and Prediction in Smart Elderly Care: Model, System and Applications -- Research on Stylization Algorithm of Ceramic Decorative Pattern Based on Ceramic Cloud Design Service Platform- Blockchain Consensus Mechanisms and Their Applications in IoT: A Literature Survey -- Towards A secure Communication of Data in IoT Networks: A Technical Research Report -- B Efficient Thermography Guided Learning for Breast Cancer Detection -- PTangle: A Parallel Detector for Unverified Blockchain Transactions -- DOS-GAN: A Distributed Over-Sampling Method Based on Generative Adversarial Networks For Distributed Class-Imbalance Learning -- Effective Sentiment Analysis for Multimodal Review Data on the Web -- Digital Currency Investment Strategy Framework Based on Ranking- Authentication Study for Brain-based Computer Interfaces using Music Stimulations -- An Ensemble Learning Approach to Detect Malwares Based on Static Information -- Automatic Medical Image Report Generation With Multi-View and Multi-Modal Attention Mechanism. |
| Record Nr. | UNISA-996418319203316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Architectures for Parallel Processing [[electronic resource] ] : 20th International Conference, ICA3PP 2020, New York City, NY, USA, October 2–4, 2020, Proceedings, Part II / / edited by Meikang Qiu
| Algorithms and Architectures for Parallel Processing [[electronic resource] ] : 20th International Conference, ICA3PP 2020, New York City, NY, USA, October 2–4, 2020, Proceedings, Part II / / edited by Meikang Qiu |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (XV, 732 p. 401 illus., 204 illus. in color.) |
| Disciplina | 004.35 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Mathematics—Data processing
Computer science Computer engineering Computer networks Computational Mathematics and Numerical Analysis Theory of Computation Computer Engineering and Networks |
| ISBN | 3-030-60239-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Distributing Data in Real Time Spatial Data Warehouse -- Accelerating Sparse Convolutional Neural Networks Based on Dataflow Architecture -- DAFEE: A Scalable Distributed Automatic Feature Engineering Algorithm for Relational Datasets -- Embedding Augmented Cubes into Grid Networks for Minimum Wirelength -- ELVMC: A predictive energy-aware algorithm for virtual machine consolidation in cloud computing -- Design of a convolutional neural network instruction set based on RISC-V and its microarchitecture implementation -- Optimizing accelerator on FPGA for Deep Convolutional Neural Networks -- HpQC: A new efficient quantum computing simulator -- Outsourced Privacy-Preserving Reduced SVM among Multiple Institutions -- A Distributed Business-aware Storage Execution Environment Towards Large-scale Applications -- QoS-Aware and Fault-Tolerant Replica Placement -- Neural network compression and acceleration by federated pruning -- Scalable Aggregation Service for Satellite Remote Sensing Data -- Edge-assisted Federated Learning: An Empirical Study from Software Decomposition Perspective -- A Dynamic Partitioning Framework for Edge-assisted Cloud Computing -- An OpenMP-based Parallel Execution of Neural Networks Specified in NNEF -- Deep Reinforcement Learning for Intelligent Migration of Fog Services in Smart Cities -- A Novel Clustering-based Filter Pruning Method for Efficient Deep Neural Networks -- Fast Segmentation-based Object Tracking Model for Autonomous Vehicles -- Defending Adversarial Examples in Computer Vision based on Data Augmentation Techniques -- User Recruitment with Budget Redistribution in Edge-aided Mobile Crowdsensing -- Multi-user Service Migration for Mobile Edge Computing Empowered Connected and Autonomous Vehicles -- A Precise Telecom Customer Tariff Promotion Method Based on Multi-route Radial Basis Kernel Fuzzy C-means Clustering -- Clustering by Unified Principal Component Analysis and Fuzzy c-means with Sparsity Constraint -- A Hierarchical-Tree-based Method for Generative Zero-Shot Learning -- Fast Computation of the Exact Number of Magic Series with an Improved Montgomery Multiplication Algorithm -- I am Smartglasses, and I can Assist Your Reading -- CHEAPS2AGA: Bounding Space Usage in Variance-Reduced Stochastic Gradient Descent over Streaming Data and its Asynchronous Parallel Variants -- A Quantum Computer Operating System -- Dynamic Knowledge Graph Completion with Jointly Structural and Textual Dependency -- MEFE: A Multi-fEature Knowledge Fusion and Evaluation method based on BERT -- Comparative Analysis of Three Kinds of Laser SLAM Algorithms -- Aspect-level Sentiment Difference Feature Interaction Matching Model based on Multi-round Decision Mechanism -- Horus: An Interference-aware Resource Manager for Deep Learning Systems -- Attribute Bagging-Based Extreme Learning Machine -- A Semi-Supervised Joint Entity and Relation Extraction Model Based on Tagging Scheme and Information Gain -- Research Progress of Zero-Shot Learning Beyond Computer Vision -- An Optimization of Deep Sensor Fusion Based on Generalized Intersection over Union -- A Hot/Cold Task Partition for Energy-efficient Neural Network Deployment on Heterogeneous Edge Device -- Towards energy efficient architecture for spaceborne Neural Networks computation -- Roda: A Flexible Framework for Real-time On-demand Data Aggregation -- Structured Data Encoder for Neural Networks Based on Gradient Boosting Decision Tree -- Stochastic Model-based Quantitative Analysis of Edge UPF Service Dependability -- QoE Estimation of DASH-based Mobile Video Application using Deep Reinforcement Learning -- Modeling and Analyzing for Data Durability Towards Cloud Storage Services -- CC-MOEA: A Parallel Multi-objective Evolutionary Algorithm for Recommendation Systems -- CS-Dict: Accurate Indoor Localization with CSI Selective Amplitude and Phase based Regularized Dictionary Learning -- Recommendation with Temporal Dynamics Based on Sequence Similarity Search -- A Software Stack for Composable Cloud Robotics System. |
| Record Nr. | UNISA-996418315903316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Computation [[electronic resource] ] : 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings / / edited by Ying Fei Dong, Ding-Zhu Du, Oscar H. Ibarra
| Algorithms and Computation [[electronic resource] ] : 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings / / edited by Ying Fei Dong, Ding-Zhu Du, Oscar H. Ibarra |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XXIX, 1228 p.) |
| Disciplina | 004n/a |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Artificial intelligence—Data processing
Computer science—Mathematics Mathematics—Data processing Algorithms Discrete mathematics Data Science Mathematics of Computing Computational Mathematics and Numerical Analysis Discrete Mathematics in Computer Science |
| ISBN |
1-280-38331-3
9786613561237 3-642-10631-5 |
| Classificazione |
DAT 530f
SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Bubblesort and Juggling Sequences -- A Proof of the Molecular Conjecture -- Exact Algorithms for Dominating Clique Problems -- Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming -- Exact Algorithms for the Bottleneck Steiner Tree Problem -- Exact Algorithms for Set Multicover and Multiset Multicover Problems -- Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm -- Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems -- On Protein Structure Alignment under Distance Constraint -- A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability -- Max-Coloring Paths: Tight Bounds and Extensions -- Fréchet Distance Problems in Weighted Regions -- The Complexity of Solving Stochastic Games on Graphs -- Computational Complexity of Cast Puzzles -- New Bounds on the Average Distance from the Fermat-Weber Center of a Planar Convex Body -- Reconstructing Numbers from Pairwise Function Values -- Hilbert’s Thirteenth Problem and Circuit Complexity -- Interval Stabbing Problems in Small Integer Ranges -- Online Sorted Range Reporting -- Data Structures for Approximate Orthogonal Range Counting -- Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time -- Untangled Monotonic Chains and Adaptive Range Search -- Geodesic Spanners on Polyhedral Surfaces -- Approximating Points by a Piecewise Linear Function: I -- Approximating Points by a Piecewise Linear Function: II. Dealing with Outliers -- Computing the Map of Geometric Minimal Cuts -- On the Camera Placement Problem -- Graph Orientations with Set Connectivity Requirements -- A Linear Vertex Kernel for Maximum Internal Spanning Tree -- Geometric Minimum Diameter Minimum Cost Spanning Tree Problem -- On Shortest Disjoint Paths in Planar Graphs -- An Optimal Labeling for Node Connectivity -- SOFA: Strategyproof Online Frequency Allocation for Multihop Wireless Networks -- 1-Bounded Space Algorithms for 2-Dimensional Bin Packing -- On the Advice Complexity of Online Problems -- Online Knapsack Problems with Limited Cuts -- Online Paging for Flash Memory Devices -- Shifting Strategy for Geometric Graphs without Geometry -- Approximation Algorithms for Variable Voltage Processors: Min Energy, Max Throughput and Online Heuristics -- Approximation Algorithms for Min-Max Path Cover Problems with Service Handling Time -- Minimum Covering with Travel Cost -- Route-Enabling Graph Orientation Problems -- Complexity of Approximating the Vertex Centroid of a Polyhedron -- Popular Matchings with Variable Job Capacities -- On the Tightness of the Buhrman-Cleve-Wigderson Simulation -- Bounds on Contention Management Algorithms -- Algorithmic Folding Complexity -- Min-Energy Scheduling for Aligned Jobs in Accelerate Model -- Posi-modular Systems with Modulotone Requirements under Permutation Constraints -- Generalized Reduction to Compute Toric Ideals -- Linear and Sublinear Time Algorithms for Basis of Abelian Groups -- Good Programming in Transactional Memory -- Induced Packing of Odd Cycles in a Planar Graph -- On the Infinitesimal Rigidity of Bar-and-Slider Frameworks -- Exploration of Periodically Varying Graphs -- Parameterized Complexity of Arc-Weighted Directed Steiner Problems -- Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries -- Minimum Cycle Bases of Weighted Outerplanar Graphs -- Bandwidth on AT-Free Graphs -- Editing Graphs into Disjoint Unions of Dense Clusters -- A Certifying Algorithm for 3-Colorability of P 5-Free Graphs -- Parameterizing Cut Sets in a Graph by the Number of Their Components -- Inapproximability of Maximal Strip Recovery -- The Complexity of Perfect Matching Problems on Dense Hypergraphs -- On Lower Bounds for Constant Width Arithmetic Circuits -- Spending Is Not Easier Than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria -- The Identity Correspondence Problem and Its Applications -- Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs -- An Improved Approximation Algorithm for the Traveling Tournament Problem -- The Fault-Tolerant Facility Allocation Problem -- Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks -- Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms -- The Directed Hausdorff Distance between Imprecise Point Sets -- Computing Multidimensional Persistence -- Locating an Obnoxious Line among Planar Objects -- Finding Fullerene Patches in Polynomial Time -- Convex Drawings of Internally Triconnected Plane Graphs on O(n 2) Grids -- A Self-stabilizing and Local Delaunay Graph Construction -- Succinct Greedy Geometric Routing in the Euclidean Plane -- Electric Routing and Concurrent Flow Cutting -- A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths -- Strong Robustness of Randomized Rumor Spreading Protocols -- Data Structures for Range Median Queries -- Deletion without Rebalancing in Multiway Search Trees -- Counting in the Presence of Memory Faults -- A Simple, Fast, and Compact Static Dictionary -- Reconstructing Polygons from Scanner Data -- Computing Large Matchings in Planar Graphs with Fixed Minimum Degree -- Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs -- Covering a Graph with a Constrained Forest (Extended Abstract) -- Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs -- Upward Star-Shaped Polyhedral Graphs -- Conditional Hardness of Approximating Satisfiable Max 3CSP-q -- The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata (Extended Abstract) -- Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement -- Step-Assembly with a Constant Number of Tile Types -- Lower Bounds on Fast Searching -- Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity -- Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n 1?+?? ) Time -- PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k -- Optimal Randomized Algorithm for the Density Selection Problem -- New Results on Simple Stochastic Games -- Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences -- Succinct Index for Dynamic Dictionary Matching -- Range Non-overlapping Indexing -- Querying Two Boundary Points for Shortest Paths in a Polygonal Domain -- Pattern Matching for 321-Avoiding Permutations -- Folding a Better Checkerboard -- Finding All Approximate Gapped Palindromes -- General Pseudo-random Generators from Weaker Models of Computation -- Random Generation and Enumeration of Bipartite Permutation Graphs -- A Combinatorial Algorithm for Horn Programs -- Online Maximum Directed Cut -- Maintaining Nets and Net Trees under Incremental Motion -- Distributed Scheduling of Parallel Hybrid Computations -- I/O-Efficient Contour Tree Simplification -- Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes -- I/O and Space-Efficient Path Traversal in Planar Graphs -- Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model -- Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract) -- Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets -- On Partitioning a Graph into Two Connected Subgraphs. |
| Record Nr. | UNISA-996465913603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Computation [[electronic resource] ] : 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings / / edited by Seok-Hee Hong, Hiroshi Nagamochi, Takuro Fukunaga
| Algorithms and Computation [[electronic resource] ] : 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings / / edited by Seok-Hee Hong, Hiroshi Nagamochi, Takuro Fukunaga |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XIX, 948 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Artificial intelligence—Data processing
Computer science Mathematics—Data processing Algorithms Computer science—Mathematics Discrete mathematics Numerical analysis Data Science Theory of Computation Computational Mathematics and Numerical Analysis Discrete Mathematics in Computer Science Numerical Analysis |
| ISBN | 3-540-92182-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk -- Constant-Working-Space Algorithms: How Fast Can We Solve Problems without Using Any Extra Array? -- Some Constrained Notions of Planarity -- Reachability Problems on Directed Graphs -- 1A Approximation Algorithm I -- Greedy Construction of 2-Approximation Minimum Manhattan Network -- The Complexity of Minimum Convex Coloring -- On the Complexity of Reconfiguration Problems -- Multiobjective Disk Cover Admits a PTAS -- 1B Online Algorithm -- Data Stream Algorithms via Expander Graphs -- Improving the Competitive Ratio of the Online OVSF Code Assignment Problem -- Optimal Key Tree Structure for Deleting Two or More Leaves -- Comparing First-Fit and Next-Fit for Online Edge Coloring -- 2A Data Structure and Algorithm -- Selecting Sums in Arrays -- Succinct and I/O Efficient Data Structures for Traversal in Trees -- Space-Time Tradeoffs for Longest-Common-Prefix Array Computation -- Power Domination in Using Reference Search Trees -- 2B Game Theory -- The Isolation Game: A Game of Distances -- On a Non-cooperative Model for Wavelength Assignment in Multifiber Optical Networks -- The Complexity of Rationalizing Matchings -- A Game Theoretic Approach for Efficient Graph Coloring -- 3A Graph Algorithm I -- Partitioning a Weighted Tree to Subtrees of Almost Uniform Size -- An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts -- On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures -- An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem -- The Balanced Edge Cover Problem -- 3B Fixed Parameter Tractability -- Firefighting on Trees: (1???1/e)–Approximation, Fixed Parameter Tractability and a Subexponential Algorithm -- A New Algorithm for Finding Trees with Many Leaves -- Faster Parameterized Algorithms for Minimum Fill-In -- Graph Layout Problems Parameterized by Vertex Cover -- A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs -- 4A Distributed Algorithm -- How to Guard a Graph? -- Tree Decontamination with Temporary Immunity -- Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves -- Squaring the Circle with Weak Mobile Robots -- 4B Database -- Evaluation of General Set Expressions -- Computing with Priced Information: When the Value Makes the Price -- Deductive Inference for the Interiors and Exteriors of Horn Theories -- Leaf Powers and Their Properties: Using the Trees -- 5A Approximation Algorithm II -- Deterministic Sparse Column Based Matrix Reconstruction via Greedy Approximation of SVD -- Minimizing Total Flow-Time: The Unrelated Case -- Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects -- Space-Efficient Informational Redundancy -- 5B Computational Biology -- Minkowski Sum Selection and Finding -- Constructing the Simplest Possible Phylogenetic Network from Triplets -- New Results on Optimizing Rooted Triplets Consistency -- A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching -- 6A Computational Geometry I -- Inducing Polygons of Line Arrangements -- Free-Form Surface Partition in 3-D -- Approximate Nearest Neighbor Search under Translation Invariant Hausdorff Distance -- Preprocessing Imprecise Points and Splitting Triangulations -- Efficient Output-Sensitive Construction of Reeb Graphs -- 6B Complexity I -- Signature Theory in Holographic Algorithms -- The Complexity of SPP Formula Minimization -- Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol -- Negation-Limited Inverters of Linear Size -- 3-Message NP Arguments in the BPK Model with Optimal Soundness and Zero-Knowledge -- 7A Computational Geometry II -- A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths -- Detecting Commuting Patterns by Clustering Subtrajectories -- On the Stretch Factor of Convex Delaunay Graphs -- Covering a Simple Polygon by Monotone Directions -- 7B Network -- On the Stability of Web Crawling and Web Search -- Average Update Times for Fully-Dynamic All-Pairs Shortest Paths -- Computing Frequency Dominators and Related Problems -- Computing Best Swaps in Optimal Tree Spanners -- 8A Optimization -- Covering a Point Set by Two Disjoint Rectangles -- Computing the Maximum Detour of a Plane Graph in Subquadratic Time -- Finding Long Paths, Cycles and Circuits -- Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces -- 8B Routing -- On Labeled Traveling Salesman Problems -- Navigating in a Graph by Aid of Its Spanning Tree -- Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times -- Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks -- 9A Graph Algorithm II -- Bandwidth of Bipartite Permutation Graphs -- König Deletion Sets and Vertex Covers above the Matching Size -- Independent Sets of Maximum Weight in Apple-Free Graphs -- Enumeration of Perfect Sequences of Chordal Graph -- From Tree-Width to Clique-Width: Excluding a Unit Interval Graph -- 9B Complexity II -- New Results on the Most Significant Bit of Integer Multiplication -- Sorting with Complete Networks of Stacks -- Quantum Query Complexity of Boolean Functions with Small On-Sets -- Unbounded-Error Quantum Query Complexity -- Super-Exponential Size Advantage of Quantum Finite Automata with Mixed States. |
| Record Nr. | UNISA-996465545303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Discrete Applied Mathematics [[electronic resource] ] : 7th International Conference, CALDAM 2021, Rupnagar, India, February 11–13, 2021, Proceedings / / edited by Apurva Mudgal, C. R. Subramanian
| Algorithms and Discrete Applied Mathematics [[electronic resource] ] : 7th International Conference, CALDAM 2021, Rupnagar, India, February 11–13, 2021, Proceedings / / edited by Apurva Mudgal, C. R. Subramanian |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (519 pages) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Algorithms Data structures (Computer science) Information theory Mathematics—Data processing Mathematics of Computing Design and Analysis of Algorithms Data Structures and Information Theory Computational Mathematics and Numerical Analysis Algorismes Geometria Teoria de grafs |
| Soggetto genere / forma |
Congressos
Llibres electrònics |
| ISBN | 3-030-67899-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Approximation Algorithms -- Online bin packing with overload cost -- Scheduling Trains with Small Stretch on a Unidirectional Line -- Algorithmic Aspects of Total Roman and Total Double Roman Domination in Graphs -- Approximation Algorithms for Orthogonal Line Centers -- Semitotal Domination on AT-free Graphs and Circle Graphs -- Burning Grids and Intervals -- Parameterized Algorithms -- On Parameterized Complexity of Liquid Democracy -- Acyclic coloring parameterized by directed clique-width. - On Structural Parameterizations of Load Coloring -- One-Sided Discrete Terrain Guarding and Chordal Graphs -- Parameterized Complexity of Locally Minimal Defensive Alliances -- Computational Geometry -- New variants of Perfect Non-crossing Matchings -- Cause I’m a Genial Imprecise Point: Outlier Detection for Uncertain Data -- A Worst-case Optimal Algorithm to Compute the Minkowski Sum of Convex Polytopes -- On the Intersections of Non-homotopic Loops -- Graph Theory -- On cd-coloring of trees and co-bipartite graphs -- Cut Vertex Transit Functions of Hypergraphs -- Lexicographic Product of Digraphs and Related Boundary-Type Sets -- The Connected Domination Number of Grids -- On degree sequences and eccentricities in pseudoline arrangement graphs. - Cops and Robber on Butterflies and Solid Grids -- b-Coloring of Some Powers of Hypercubes -- Chromatic Bounds for the Subclasses of $pK_2$ -Free Graphs -- Axiomatic characterization of the median function of a block graph -- On Coupon Coloring of Cartesian Product of Some Graphs -- On the Connectivity and the Diameter of Betweenness-Uniform Graphs. -Combinatorics and Algorithms -- On algorithms to find p-ordering -- Experimental Evaluation of a Local Search Approximation Algorithm for the Multiway Cut Problem -- Algorithmic analysis of priority-based bin packing -- Recursive methods for some problems in coding and random permutations -- Achieving positive rates with predetermined dictionaries -- Characterization of Dense Patterns Having Distinct Squares -- Graph Algorithms -- Failure and communication in a synchronized multi-drone system -- Memory Optimal Dispersion by Anonymous Mobile Robots -- Quantum and approximation algorithms for maximum witnesses of Boolean matrix products. -Template-driven Rainbow Coloring of Proper Interval Graphs -- Minimum Consistent Subset of Simple Graph Classes. - Computational Complexity -- Balanced Connected Graph Partition -- Hardness Results of Global Roman Domination in Graphs. . |
| Record Nr. | UNISA-996464385203316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Discrete Applied Mathematics [[electronic resource] ] : 6th International Conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020, Proceedings / / edited by Manoj Changat, Sandip Das
| Algorithms and Discrete Applied Mathematics [[electronic resource] ] : 6th International Conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020, Proceedings / / edited by Manoj Changat, Sandip Das |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (XX, 490 p. 151 illus., 36 illus. in color.) |
| Disciplina | 518 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Mathematics—Data processing
Computer science—Mathematics Computer science Data structures (Computer science) Information theory Computational Mathematics and Numerical Analysis Mathematics of Computing Theory of Computation Data Structures and Information Theory |
| ISBN | 3-030-39219-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 0-1 Timed Matching in Bipartite Temporal Graphs -- Partitioning cographs into two forests and one independent set -- Monitoring the edges of a graph using distances -- Forbidden structure characterization of graphs having a threshold cover of size two: a simpler proof using the lexicographic method -- Approximating Modular Decomposition is Hard -- Vertex Edge Dominating Set in Unit Disk Graphs -- Geometric Planar Networks on Bichromatic Points -- Algorithmic Aspects of Global Total k-Domination in Graphs -- Hardness and approximation for the geodetic set problem in some graph classes -- Maximum Weighted Edge Biclique Problem on Bipartite Graphs -- Determining Number of Generalized and Double Generalized Petersen Graph -- Self-centeredness of generalized Petersen Graphs -- Weak Roman Bondage Number of a Graph -- On the geodetic and hull numbers of shadow Graphs -- Indicated coloring of complete expansion and lexicographic product of graphs -- Smallest C2l+1-critical graphs of odd-girth 2k + 1 -- Ramsey Numbers for Line Graphs -- On Cartesian products of signed graphs -- List distinguishing number of pth power of hypercube and Cartesian powers of a graph -- On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs -- On the relative oriented clique number of planar graphs -- On the minimmum satisfiability problem -- Waiting for Trains: Complexity Results -- Oriented Diameter of Star Graphs -- Gathering over Meeting Nodes of Infinite Grid -- 0-1 Timed Matching in Bipartite Temporal Graphs -- Arbitrary Pattern Formation by Opaque Fat Robots with Lights -- Greedy universal cycle constructions for weak orders -- A New Model in Firefighting Theory -- An Algorithm for Strong Stability in the Student-Project Allocation Problem with Ties -- Overlaying a hypergraph with a graph with bounded maximum degree -- Parameterized Algorithms for Directed Modular Width -- On the Complexity of Spanning Trees with a Small Vertex Cover -- Minimum Conflict free Colouring Parameterized by Treewidth -- Planar projections of graphs -- New Algorithms and Bounds for Halving Pseudolines -- Algorithms for Radon Partitions with Tolerance. . |
| Record Nr. | UNISA-996418221603316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Applied Parallel and Scientific Computing [[electronic resource] ] : 10th International Conference, PARA 2010, Reykjavík, Iceland, June 6-9, 2010, Revised Selected Papers, Part II / / edited by Kristján Jónasson
| Applied Parallel and Scientific Computing [[electronic resource] ] : 10th International Conference, PARA 2010, Reykjavík, Iceland, June 6-9, 2010, Revised Selected Papers, Part II / / edited by Kristján Jónasson |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XXVIII, 477 p. 170 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Software engineering Algorithms Dynamics Nonlinear theories Mathematics—Data processing Computer networks Mathematics of Computing Software Engineering Applied Dynamical Systems Computational Mathematics and Numerical Analysis Computer Communication Networks |
| ISBN | 3-642-28145-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465961203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
