top

  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.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.

Biblioteca

MARC Lista (tabellare)
Algorithms and Discrete Applied Mathematics : First International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings / / edited by Sumit Ganguly, Ramesh Krishnamurti
Algorithms and Discrete Applied Mathematics : First International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings / / edited by Sumit Ganguly, Ramesh Krishnamurti
Edizione [1st ed. 2015.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015
Descrizione fisica 1 online resource (XVI, 300 p. 91 illus.) : online resource
Disciplina 005.3
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Artificial intelligence—Data processing
Computer science—Mathematics
Discrete mathematics
Numerical analysis
Computer graphics
Data Science
Discrete Mathematics in Computer Science
Numerical Analysis
Computer Graphics
ISBN 3-319-14974-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 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.
Record Nr. UNINA-9910483087103321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithms and Models for the Web Graph [[electronic resource] ] : 16th International Workshop, WAW 2019, Brisbane, QLD, Australia, July 6–7, 2019, Proceedings / / edited by Konstantin Avrachenkov, Paweł Prałat, Nan Ye
Algorithms and Models for the Web Graph [[electronic resource] ] : 16th International Workshop, WAW 2019, Brisbane, QLD, Australia, July 6–7, 2019, Proceedings / / edited by Konstantin Avrachenkov, Paweł Prałat, Nan Ye
Edizione [1st ed. 2019.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Descrizione fisica 1 online resource (IX, 131 p. 24 illus., 14 illus. in color.)
Disciplina 005.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer science—Mathematics
Discrete mathematics
Artificial intelligence—Data processing
Artificial intelligence
Computer graphics
Discrete Mathematics in Computer Science
Data Science
Artificial Intelligence
Computer Graphics
ISBN 3-030-25070-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Using Synthetic Networks for Parameter Tuning in Community Detection -- Efficiency of Transformations of Proximity Measures for Graph Clustering -- Almost Exact Recovery in Label Spreading -- Strongly n-e.c. Graphs and Independent Distinguishing Labellings -- The Robot Crawler Model on Complete k-Partite and Erdős-Rényi Random Graphs -- Estimating the Parameters of the Waxman Random Graph -- Understanding the Effectiveness of Data Reduction in Public Transportation Networks -- A Spatial Small-World Graph Arising from Activity-Based Reinforcement -- SimpleHypergraphs.jl - Novel Software Framework for Modelling and Analysis of Hypergraphs. .
Record Nr. UNISA-996466371703316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithms and Models for the Web Graph : 16th International Workshop, WAW 2019, Brisbane, QLD, Australia, July 6–7, 2019, Proceedings / / edited by Konstantin Avrachenkov, Paweł Prałat, Nan Ye
Algorithms and Models for the Web Graph : 16th International Workshop, WAW 2019, Brisbane, QLD, Australia, July 6–7, 2019, Proceedings / / edited by Konstantin Avrachenkov, Paweł Prałat, Nan Ye
Edizione [1st ed. 2019.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Descrizione fisica 1 online resource (IX, 131 p. 24 illus., 14 illus. in color.)
Disciplina 005.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer science—Mathematics
Discrete mathematics
Artificial intelligence—Data processing
Artificial intelligence
Computer graphics
Discrete Mathematics in Computer Science
Data Science
Artificial Intelligence
Computer Graphics
ISBN 3-030-25070-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Using Synthetic Networks for Parameter Tuning in Community Detection -- Efficiency of Transformations of Proximity Measures for Graph Clustering -- Almost Exact Recovery in Label Spreading -- Strongly n-e.c. Graphs and Independent Distinguishing Labellings -- The Robot Crawler Model on Complete k-Partite and Erdős-Rényi Random Graphs -- Estimating the Parameters of the Waxman Random Graph -- Understanding the Effectiveness of Data Reduction in Public Transportation Networks -- A Spatial Small-World Graph Arising from Activity-Based Reinforcement -- SimpleHypergraphs.jl - Novel Software Framework for Modelling and Analysis of Hypergraphs. .
Record Nr. UNINA-9910349314503321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithms – ESA 2005 [[electronic resource] ] : 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings / / edited by Gerth S. Brodal, Stefano Leonardi
Algorithms – ESA 2005 [[electronic resource] ] : 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings / / edited by Gerth S. Brodal, Stefano Leonardi
Edizione [1st ed. 2005.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005
Descrizione fisica 1 online resource (XVIII, 901 p.)
Disciplina 005.11
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer programming
Algorithms
Computer networks
Artificial intelligence—Data processing
Numerical analysis
Computer science—Mathematics
Discrete mathematics
Programming Techniques
Computer Communication Networks
Data Science
Numerical Analysis
Discrete Mathematics in Computer Science
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Designing Reliable Algorithms in Unreliable Memories -- From Balanced Graph Partitioning to Balanced Metric Labeling -- Fearful Symmetries: Quantum Computing, Factoring, and Graph Isomorphism -- Exploring an Unknown Graph Efficiently -- Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio -- Heuristic Improvements for Computing Maximum Multicommodity Flow and Minimum Multicut -- Relax-and-Cut for Capacitated Network Design -- On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games,, -- The Complexity of Games on Highly Regular Graphs -- Computing Equilibrium Prices: Does Theory Meet Practice? -- Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions -- An Algorithm for the SAT Problem for Formulae of Linear Length -- Linear-Time Enumeration of Isolated Cliques -- Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs -- Delineating Boundaries for Imprecise Regions -- Exacus: Efficient and Exact Algorithms for Curves and Surfaces -- Min Sum Clustering with Penalties -- Improved Approximation Algorithms for Metric Max TSP -- Unbalanced Graph Cuts -- Low Degree Connectivity in Ad-Hoc Networks -- 5-Regular Graphs are 3-Colorable with Positive Probability -- Optimal Integer Alphabetic Trees in Linear Time -- Predecessor Queries in Constant Time? -- An Algorithm for Node-Capacitated Ring Routing -- On Degree Constrained Shortest Paths -- A New Template for Solving p-Median Problems for Trees in Sub-quadratic Time -- Roll Cutting in the Curtain Industry -- Space Efficient Algorithms for the Burrows-Wheeler Backtransformation -- Cache-Oblivious Comparison-Based Algorithms on Multisets -- Oblivious vs. Distribution-Based Sorting: An Experimental Evaluation -- Allocating Memory in a Lock-Free Manner -- Generating Realistic Terrains with Higher-Order Delaunay Triangulations -- I/O-Efficient Construction of Constrained Delaunay Triangulations -- Convex Hull and Voronoi Diagram of Additively Weighted Points -- New Tools and Simpler Algorithms for Branchwidth -- Treewidth Lower Bounds with Brambles -- Minimal Interval Completions -- A 2-Approximation Algorithm for Sorting by Prefix Reversals -- Approximating the 2-Interval Pattern Problem -- A Loopless Gray Code for Minimal Signed-Binary Representations -- Efficient Approximation Schemes for Geometric Problems? -- Geometric Clustering to Minimize the Sum of Cluster Sizes -- Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs -- Packet Routing and Information Gathering in Lines, Rings and Trees -- Jitter Regulation for Multiple Streams -- Efficient c-Oriented Range Searching with DOP-Trees -- Matching Point Sets with Respect to the Earth Mover’s Distance -- Small Stretch Spanners on Dynamic Graphs -- An Experimental Study of Algorithms for Fully Dynamic Transitive Closure -- Experimental Study of Geometric t-Spanners -- Highway Hierarchies Hasten Exact Shortest Path Queries -- Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays -- Fairness-Free Periodic Scheduling with Vacations -- Online Bin Packing with Cardinality Constraints -- Fast Monotone 3-Approximation Algorithm for Scheduling Related Machines -- Engineering Planar Separator Algorithms -- Stxxl: Standard Template Library for XXL Data Sets -- Negative Cycle Detection Problem -- An Optimal Algorithm for Querying Priced Information: Monotone Boolean Functions and Game Trees -- Online View Maintenance Under a Response-Time Constraint -- Online Primal-Dual Algorithms for Covering and Packing Problems -- Efficient Algorithms for Shared Backup Allocation in Networks with Partial Information -- Using Fractional Primal-Dual to Schedule Split Intervals with Demands -- An Approximation Algorithm for the Minimum Latency Set Cover Problem -- Workload-Optimal Histograms on Streams -- Finding Frequent Patterns in a String in Sublinear Time -- Online Occlusion Culling -- Shortest Paths in Matrix Multiplication Time -- Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs -- Greedy Routing in Tree-Decomposed Graphs -- Making Chord Robust to Byzantine Attacks -- Bucket Game with Applications to Set Multicover and Dynamic Page Migration -- Bootstrapping a Hop-Optimal Network in the Weak Sensor Model -- Approximating Integer Quadratic Programs and MAXCUT in Subdense Graphs -- A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment Problem -- Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack -- Robust Approximate Zeros -- Optimizing a 2D Function Satisfying Unimodality Properties.
Record Nr. UNISA-996465865103316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithms – ESA 2005 : 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings / / edited by Gerth S. Brodal, Stefano Leonardi
Algorithms – ESA 2005 : 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings / / edited by Gerth S. Brodal, Stefano Leonardi
Edizione [1st ed. 2005.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005
Descrizione fisica 1 online resource (XVIII, 901 p.)
Disciplina 005.11
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer programming
Algorithms
Computer networks
Artificial intelligence—Data processing
Numerical analysis
Computer science—Mathematics
Discrete mathematics
Programming Techniques
Computer Communication Networks
Data Science
Numerical Analysis
Discrete Mathematics in Computer Science
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Designing Reliable Algorithms in Unreliable Memories -- From Balanced Graph Partitioning to Balanced Metric Labeling -- Fearful Symmetries: Quantum Computing, Factoring, and Graph Isomorphism -- Exploring an Unknown Graph Efficiently -- Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio -- Heuristic Improvements for Computing Maximum Multicommodity Flow and Minimum Multicut -- Relax-and-Cut for Capacitated Network Design -- On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games,, -- The Complexity of Games on Highly Regular Graphs -- Computing Equilibrium Prices: Does Theory Meet Practice? -- Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions -- An Algorithm for the SAT Problem for Formulae of Linear Length -- Linear-Time Enumeration of Isolated Cliques -- Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs -- Delineating Boundaries for Imprecise Regions -- Exacus: Efficient and Exact Algorithms for Curves and Surfaces -- Min Sum Clustering with Penalties -- Improved Approximation Algorithms for Metric Max TSP -- Unbalanced Graph Cuts -- Low Degree Connectivity in Ad-Hoc Networks -- 5-Regular Graphs are 3-Colorable with Positive Probability -- Optimal Integer Alphabetic Trees in Linear Time -- Predecessor Queries in Constant Time? -- An Algorithm for Node-Capacitated Ring Routing -- On Degree Constrained Shortest Paths -- A New Template for Solving p-Median Problems for Trees in Sub-quadratic Time -- Roll Cutting in the Curtain Industry -- Space Efficient Algorithms for the Burrows-Wheeler Backtransformation -- Cache-Oblivious Comparison-Based Algorithms on Multisets -- Oblivious vs. Distribution-Based Sorting: An Experimental Evaluation -- Allocating Memory in a Lock-Free Manner -- Generating Realistic Terrains with Higher-Order Delaunay Triangulations -- I/O-Efficient Construction of Constrained Delaunay Triangulations -- Convex Hull and Voronoi Diagram of Additively Weighted Points -- New Tools and Simpler Algorithms for Branchwidth -- Treewidth Lower Bounds with Brambles -- Minimal Interval Completions -- A 2-Approximation Algorithm for Sorting by Prefix Reversals -- Approximating the 2-Interval Pattern Problem -- A Loopless Gray Code for Minimal Signed-Binary Representations -- Efficient Approximation Schemes for Geometric Problems? -- Geometric Clustering to Minimize the Sum of Cluster Sizes -- Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs -- Packet Routing and Information Gathering in Lines, Rings and Trees -- Jitter Regulation for Multiple Streams -- Efficient c-Oriented Range Searching with DOP-Trees -- Matching Point Sets with Respect to the Earth Mover’s Distance -- Small Stretch Spanners on Dynamic Graphs -- An Experimental Study of Algorithms for Fully Dynamic Transitive Closure -- Experimental Study of Geometric t-Spanners -- Highway Hierarchies Hasten Exact Shortest Path Queries -- Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays -- Fairness-Free Periodic Scheduling with Vacations -- Online Bin Packing with Cardinality Constraints -- Fast Monotone 3-Approximation Algorithm for Scheduling Related Machines -- Engineering Planar Separator Algorithms -- Stxxl: Standard Template Library for XXL Data Sets -- Negative Cycle Detection Problem -- An Optimal Algorithm for Querying Priced Information: Monotone Boolean Functions and Game Trees -- Online View Maintenance Under a Response-Time Constraint -- Online Primal-Dual Algorithms for Covering and Packing Problems -- Efficient Algorithms for Shared Backup Allocation in Networks with Partial Information -- Using Fractional Primal-Dual to Schedule Split Intervals with Demands -- An Approximation Algorithm for the Minimum Latency Set Cover Problem -- Workload-Optimal Histograms on Streams -- Finding Frequent Patterns in a String in Sublinear Time -- Online Occlusion Culling -- Shortest Paths in Matrix Multiplication Time -- Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs -- Greedy Routing in Tree-Decomposed Graphs -- Making Chord Robust to Byzantine Attacks -- Bucket Game with Applications to Set Multicover and Dynamic Page Migration -- Bootstrapping a Hop-Optimal Network in the Weak Sensor Model -- Approximating Integer Quadratic Programs and MAXCUT in Subdense Graphs -- A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment Problem -- Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack -- Robust Approximate Zeros -- Optimizing a 2D Function Satisfying Unimodality Properties.
Record Nr. UNINA-9910483710303321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithms – ESA 2013 [[electronic resource] ] : 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings / / edited by Hans L. Bodlaender, Giuseppe F. Italiano
Algorithms – ESA 2013 [[electronic resource] ] : 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings / / edited by Hans L. Bodlaender, Giuseppe F. Italiano
Edizione [1st ed. 2013.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013
Descrizione fisica 1 online resource (XVIII, 829 p. 134 illus.)
Disciplina 005.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer networks
Computer science—Mathematics
Discrete mathematics
Computer graphics
Numerical analysis
Artificial intelligence—Data processing
Computer Communication Networks
Discrete Mathematics in Computer Science
Computer Graphics
Numerical Analysis
Data Science
ISBN 3-642-40450-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Algorithm engineering -- Algorithmic aspects of networks -- Algorithmic game theory -- Approximation algorithms -- Computational biology -- Computational finance -- Computational geometry -- Combinatorial optimization -- Data compression -- Data structures -- Databases and information retrieval -- Distributed and parallel computing -- Graph algorithms -- Hierarchical memories -- Heuristics and meta-heuristics -- Mathematical programming -- Mobile computing -- On-line algorithms -- Parameterized complexity -- Pattern matching -- Quantum computing -- Randomized algorithms -- Scheduling and resource allocation problems -- Streaming algorithms.
Record Nr. UNISA-996465943803316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithms – ESA 2013 : 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings / / edited by Hans L. Bodlaender, Giuseppe F. Italiano
Algorithms – ESA 2013 : 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings / / edited by Hans L. Bodlaender, Giuseppe F. Italiano
Edizione [1st ed. 2013.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013
Descrizione fisica 1 online resource (XVIII, 829 p. 134 illus.)
Disciplina 005.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer networks
Computer science—Mathematics
Discrete mathematics
Computer graphics
Numerical analysis
Artificial intelligence—Data processing
Computer Communication Networks
Discrete Mathematics in Computer Science
Computer Graphics
Numerical Analysis
Data Science
ISBN 3-642-40450-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Algorithm engineering -- Algorithmic aspects of networks -- Algorithmic game theory -- Approximation algorithms -- Computational biology -- Computational finance -- Computational geometry -- Combinatorial optimization -- Data compression -- Data structures -- Databases and information retrieval -- Distributed and parallel computing -- Graph algorithms -- Hierarchical memories -- Heuristics and meta-heuristics -- Mathematical programming -- Mobile computing -- On-line algorithms -- Parameterized complexity -- Pattern matching -- Quantum computing -- Randomized algorithms -- Scheduling and resource allocation problems -- Streaming algorithms.
Record Nr. UNINA-9910485025703321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithms –- ESA 2012 [[electronic resource] ] : 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings / / edited by Leah Epstein, Paolo Ferragina
Algorithms –- ESA 2012 [[electronic resource] ] : 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings / / edited by Leah Epstein, Paolo Ferragina
Edizione [1st ed. 2012.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012
Descrizione fisica 1 online resource (XX, 839 p. 147 illus.)
Disciplina 005.7/3
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer networks
Computer science—Mathematics
Discrete mathematics
Computer graphics
Numerical analysis
Artificial intelligence—Data processing
Computer Communication Networks
Discrete Mathematics in Computer Science
Computer Graphics
Numerical Analysis
Data Science
ISBN 3-642-33090-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Algorithm engineering -- algorithmic aspects of networks -- algorithmic game theory -- approximation algorithms -- computational biology -- computational finance -- computational geometry -- combinatorial optimization -- data compression -- data structures.-databases and information retrieval -- distributed and parallel computing -- graph algorithms -- hierarchical memories -- heuristics and meta-heuristics -- mathematical programming -- mobile computing -- on-line algorithms -- parameterized complexity -- pattern matching, quantum computing -- randomized algorithms -- scheduling and resource allocation problems -- streaming algorithms.
Record Nr. UNISA-996465557503316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithms, Probability, Networks, and Games [[electronic resource] ] : Scientific Papers and Essays Dedicated to Paul G. Spirakis on the Occasion of His 60th Birthday / / edited by Christos Zaroliagis, Grammati Pantziou, Spyros Kontogiannis
Algorithms, Probability, Networks, and Games [[electronic resource] ] : Scientific Papers and Essays Dedicated to Paul G. Spirakis on the Occasion of His 60th Birthday / / edited by Christos Zaroliagis, Grammati Pantziou, Spyros Kontogiannis
Edizione [1st ed. 2015.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015
Descrizione fisica 1 online resource (XVI, 409 p. 64 illus. in color.)
Disciplina 519.3
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer networks
Computer science
Artificial intelligence—Data processing
Application software
Software engineering
Computer Communication Networks
Theory of Computation
Data Science
Computer and Information Systems Applications
Software Engineering
ISBN 3-319-24024-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Intro -- Preface -- Acknowledgements -- List of Contributors -- Contents -- Part I -- A Glimpse at Paul G. Spirakis -- 1 Introduction -- 2 Childhood, Education and Career -- 3 Teaching, Mentoring, and Publications -- 4 Awards and Distinctions -- 5 Research -- 5.1 Probabilistic and Randomized Algorithms -- 5.2 Parallel Algorithms and Complexity -- 5.3 Networks and Distributed Computing -- 5.4 Internet, Mobile, and Evolution Networks -- 5.5 Algorithmic Game Theory -- 5.6 Population Protocols and Temporal Graphs -- 6 Other Professional Activities -- 7 Contributions to the Scientific Community -- 8 Personal -- 9 Epilogue -- References -- The Reality Game Theory Imposes (Short Summary) -- References -- On Neural Networks and Paul Spirakis -- Concurrency, Parallelism, Asynchrony and Life -- Invited Talks -- Rationality Authority for Provable Rational Behavior -- 1 Introduction -- 2 Preliminaries -- 3 Verifying a Nash Equilibrium Using Coq -- 4 Provable Rationality Using Interactive Proofs -- 5 Equilibrium Consultant with Provable Advices -- 6 On-line Network Congestion Games -- 7 Discussions -- References -- Weighted Boolean Formula Games -- 1 Introduction -- 1.1 Succinct Games and Equilibria Problems -- 1.2 Weighted Boolean Formula Games -- 1.3 Summary of Results and Significance -- 1.4 Related Work and Comparison -- 1.5 Road Map -- 2 Framework and Background -- 2.1 Notation -- 2.2 Games and Equilibria -- 2.3 Isomorphisms and Monomorphisms -- 2.4 Potential Games and Classes of Congestion Games -- 2.5 Complexity Theory -- 3 Weighted Boolean Formula Games -- 3.1 Definition -- 3.2 Decision and Search Problems -- 4 Mutual Weighted Boolean Formula Games -- 5 Pure Equilibria -- 6 Payoff-Dominant Equilibria -- 6.1 Upper Bounds -- 6.2 Completeness Results -- 7 Open Problems -- References.
On the Implementation of Combinatorial Algorithms for the Linear Exchange Market -- 1 Introduction -- 2 The Algorithm -- 3 A Glimpse of the Analysis -- 4 Questions -- References -- Regular Contributions -- On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-completeness and Approximations -- 1 Introduction, Our Results and Related Work -- 1.1 Motivation -- 1.2 Summary of Our Results -- 1.3 Related Work and Comparison -- 2 Preliminaries -- 3 The Complexity of the Radiocoloring Problem -- 3.1 The NP-Completeness of RCP for Planar Graphs -- 3.2 The PSPACE-Completeness of RCP for Hierarchical Planar Graphs -- 4 Approximations to RCP for WS Fully Planar Graphs -- 4.1 A 10/3-Approximation Algorithm RC_Approx -- 4.2 A 3-Approximation Algorithm RC_Levels -- 5 Discussion and Open Problems -- References -- Performance Evaluation of Routing Mechanisms for VANETs in Urban Areas -- 1 Introduction -- 2 Overview of Routing in MANETs and VANETs -- 2.1 Routing Protocols -- 2.2 Challenges -- 3 Proposed Enhancement to GPSR -- 3.1 Overview of the Proposed Enhancement -- 3.2 Algorithm and Architecture -- 4 Simulation Settings -- 4.1 Reference Scenario -- 4.2 Experiments and Parameters -- 5 Results and Discussion -- 6 Conclusions and Future Work -- References -- Pioneering the Establishment of the Foundations of the Internet of Things -- 1 The Internet of Things and Intermittent Connectivity -- 2 Modeling Mobile and Dynamic Networks -- 3 A Network Organization Framework for Dynamic Mobile Networks -- 4 Basic Communication Algorithms for Dynamic Mobile Networks -- 4.1 Alternative Implementations of the Support -- 5 Exploiting the Theoretical and Practical Dimensions of Research in Parallel -- 6 Closing Remarks -- References -- An Optimal Parallel Algorithm for Minimum Spanning Trees in Planar Graphs -- 1 Introduction -- 2 Preliminaries -- 3 The Algorithm.
4 Finding a (c,f(c))-Connector in a Degree-3 Graph -- 5 Extensions of Our Results -- 6 Conclusions -- References -- Weighted Random Sampling over Data Streams -- 1 Introduction -- 2 Weighted Random Sampling (WRS) -- 3 The Two Core Algorithms -- 3.1 A-Chao -- 3.2 A-ES -- 3.3 Algorithm A-Chao with Jumps -- 4 Algorithms for WRS Problems -- 4.1 Basic Problems -- 4.2 Sampling with a Bounded Number of Replacements -- 4.3 Sampling Problems in the Presence of Stream Evolution -- 5 An Abstract Data Structure for WRS -- 6 The Role of Weights -- 7 Discussion -- References -- Random Instances of Problems in NP -- Algorithms and Statistical Physics -- 1 Introduction -- 1.1 Algorithms for rCSP -- 2 Predictions from Statistical Physics - ``Cavity Method'' -- 2.1 Rigorous Results -- 3 Satisfiability Thresholds -- 4 Algorithm Dynamics -- 4.1 Convergence of Glauber Dynamics -- 4.2 Dynamics and Optimization -- 5 Algorithms Beyond Dynamics -- 5.1 Combinatorial Algorithms -- 5.2 Numerical Algorithms - Message Passing -- References -- A Selective Tour Through Congestion Games -- 1 Introduction -- 1.1 Organization -- 2 Congestion Games and Nash Equilibria -- 2.1 Price of Anarchy and Price of Stability -- 2.2 Potential Functions and Best Responses -- 2.3 Non-atomic Congestion Games -- 3 Potential Functions for Weighted Players -- 4 Reaching a Pure Nash Equilibrium -- 4.1 Series-Parallel Networks -- 4.2 Extension-Parallel Networks -- 5 The Price of Anarchy and How to Deal with It -- 5.1 The Price of Anarchy for Extension-Parallel Networks -- 5.2 Optimal Tolls for Atomic Congestion Games -- 5.3 Stackelberg Routing -- 5.4 Approximate Network Design for Non-Atomic Games -- References -- Data-Streaming and Concurrent Data-Object Co-design: Overview and Algorithmic Challenges -- 1 Introduction -- 2 Concurrent object Algorithmic Implementations - Preliminaries.
3 Data Streaming - Preliminaries -- 3.1 Parallel Data Streaming and Deterministic Processing -- 4 Inter-thread Communication in SPEs Architecture -- 5 Leveraging Concurrent Data Structures in SPEs -- 6 ScaleGate: A Novel, Concurrency- and Streaming-Aware Data Object -- 7 Evaluation Study -- 8 Conclusions -- References -- Stability in Heterogeneous Dynamic Multimedia Networks -- 1 Introduction -- 2 Related Work -- 3 Theoretical Framework -- 4 Instability of FIFO Protocol Compositions Under AQMDS Model -- 5 Instability of a FIFO Composition with Other Protocols Under AQMDC Model -- 6 Experimental Evaluation -- 7 Conclusions -- References -- Advances in the Parallelization of the Simplex Method -- 1 Introduction -- 2 Background -- 2.1 The Primal Revised Simplex Method -- 2.2 The Dual Revised Simplex Method -- 3 Overview of Simplex Parallelization -- 3.1 Parallelizing the Standard Simplex Method -- 3.2 Parallelizing the Revised Simplex Method -- 4 Recent Advances on the Parallelization of the Dual Revised Simplex Method -- 4.1 Design and Implementation (Key Issues) -- 4.2 Experimental Results -- 5 Parallel Distributed-Memory Simplex for Large-Scale Stochastic LP Problems -- 5.1 Design and Implementation (Key Issues) -- 5.2 Experimental Results -- 6 Revisiting the Parallelization of Standard Full Tableau Simplex Method -- 6.1 Design and Implementation (Key Issues) -- 6.2 Experimental Results -- 7 GPU-Based Simplex Parallelization Efforts -- 8 Conclusion -- References -- An Introduction to Temporal Graphs: An Algorithmic Perspective -- 1 Introduction -- 2 Modeling and Basic Properties -- 2.1 Journeys -- 3 Connectivity and Menger's Theorem -- 4 Dissemination and Gathering of Information -- 5 Design Problems -- 6 Temporal Versions of Other Standard Graph Problems: Complexity and Solutions -- 7 Linear Availabilities -- 8 Random Temporal Graphs -- References.
Random Surfing Without Teleportation -- 1 Introduction and Motivation -- 2 NCDawareRank Model -- 2.1 Notation -- 2.2 Definitions -- 3 Necessary and Sufficient Conditions for Random Surfing Without Teleportation -- 3.1 Preliminaries -- 3.2 NCDawareRank Primitivity Criterion -- 4 Generalizing the NCDawareRank Model -- 4.1 The Case of Overlapping Blocks -- 5 Discussion and Future Work -- References -- Of Concurrent Data Structures and Iterations -- 1 Introduction -- 2 System Model -- 3 Framework of Consistency Definitions for Concurrent Iterations -- 4 An Overview of Iteration Algorithms and Implementations -- 5 Possible Applications and Research Questions -- References -- On Some Combinatorial Properties of Random Intersection Graphs -- 1 Introduction and Motivation -- 1.1 Definitions and a First Look at RIGs -- 2 An Overview of Selected Combinatorial Problems -- 2.1 Independent Sets -- 2.2 Hamilton Cycles -- 2.3 Coloring -- 2.4 Expansion and Random Walks -- 3 Maximum Cliques -- 4 Epilogue -- References -- Efficient Equilibrium Concepts in Non-cooperative Network Formation -- 1 Introduction -- 2 Notation and Graph-Theoretic Background -- 3 The Basic Network Creation Game -- 4 The Asymmetric Basic Network Creation Game -- 5 The Greedy Buy Basic Network Creation Game -- 6 The Local Cost Basic Network Creation Game -- 7 Dynamics of Equilibria -- 7.1 Symmetric, Asymmetric, and Greedy Swap Equilibria -- 7.2 Local Cost Swap Equilibria -- 8 Conclusions and Open Issues -- References -- Simple Parallel Algorithms for Dynamic Range Products -- 1 Introduction -- 1.1 The Problem -- 1.2 Applications -- 1.3 Our Contribution and Related Work -- 2 Tree Partitioning -- 3 Dynamic Range Products -- 4 Conclusions -- References -- Author Index.
Record Nr. UNISA-996466450603316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithms, Probability, Networks, and Games : Scientific Papers and Essays Dedicated to Paul G. Spirakis on the Occasion of His 60th Birthday / / edited by Christos Zaroliagis, Grammati Pantziou, Spyros Kontogiannis
Algorithms, Probability, Networks, and Games : Scientific Papers and Essays Dedicated to Paul G. Spirakis on the Occasion of His 60th Birthday / / edited by Christos Zaroliagis, Grammati Pantziou, Spyros Kontogiannis
Edizione [1st ed. 2015.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015
Descrizione fisica 1 online resource (XVI, 409 p. 64 illus. in color.)
Disciplina 519.3
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer networks
Computer science
Artificial intelligence—Data processing
Application software
Software engineering
Computer Communication Networks
Theory of Computation
Data Science
Computer and Information Systems Applications
Software Engineering
ISBN 3-319-24024-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Intro -- Preface -- Acknowledgements -- List of Contributors -- Contents -- Part I -- A Glimpse at Paul G. Spirakis -- 1 Introduction -- 2 Childhood, Education and Career -- 3 Teaching, Mentoring, and Publications -- 4 Awards and Distinctions -- 5 Research -- 5.1 Probabilistic and Randomized Algorithms -- 5.2 Parallel Algorithms and Complexity -- 5.3 Networks and Distributed Computing -- 5.4 Internet, Mobile, and Evolution Networks -- 5.5 Algorithmic Game Theory -- 5.6 Population Protocols and Temporal Graphs -- 6 Other Professional Activities -- 7 Contributions to the Scientific Community -- 8 Personal -- 9 Epilogue -- References -- The Reality Game Theory Imposes (Short Summary) -- References -- On Neural Networks and Paul Spirakis -- Concurrency, Parallelism, Asynchrony and Life -- Invited Talks -- Rationality Authority for Provable Rational Behavior -- 1 Introduction -- 2 Preliminaries -- 3 Verifying a Nash Equilibrium Using Coq -- 4 Provable Rationality Using Interactive Proofs -- 5 Equilibrium Consultant with Provable Advices -- 6 On-line Network Congestion Games -- 7 Discussions -- References -- Weighted Boolean Formula Games -- 1 Introduction -- 1.1 Succinct Games and Equilibria Problems -- 1.2 Weighted Boolean Formula Games -- 1.3 Summary of Results and Significance -- 1.4 Related Work and Comparison -- 1.5 Road Map -- 2 Framework and Background -- 2.1 Notation -- 2.2 Games and Equilibria -- 2.3 Isomorphisms and Monomorphisms -- 2.4 Potential Games and Classes of Congestion Games -- 2.5 Complexity Theory -- 3 Weighted Boolean Formula Games -- 3.1 Definition -- 3.2 Decision and Search Problems -- 4 Mutual Weighted Boolean Formula Games -- 5 Pure Equilibria -- 6 Payoff-Dominant Equilibria -- 6.1 Upper Bounds -- 6.2 Completeness Results -- 7 Open Problems -- References.
On the Implementation of Combinatorial Algorithms for the Linear Exchange Market -- 1 Introduction -- 2 The Algorithm -- 3 A Glimpse of the Analysis -- 4 Questions -- References -- Regular Contributions -- On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-completeness and Approximations -- 1 Introduction, Our Results and Related Work -- 1.1 Motivation -- 1.2 Summary of Our Results -- 1.3 Related Work and Comparison -- 2 Preliminaries -- 3 The Complexity of the Radiocoloring Problem -- 3.1 The NP-Completeness of RCP for Planar Graphs -- 3.2 The PSPACE-Completeness of RCP for Hierarchical Planar Graphs -- 4 Approximations to RCP for WS Fully Planar Graphs -- 4.1 A 10/3-Approximation Algorithm RC_Approx -- 4.2 A 3-Approximation Algorithm RC_Levels -- 5 Discussion and Open Problems -- References -- Performance Evaluation of Routing Mechanisms for VANETs in Urban Areas -- 1 Introduction -- 2 Overview of Routing in MANETs and VANETs -- 2.1 Routing Protocols -- 2.2 Challenges -- 3 Proposed Enhancement to GPSR -- 3.1 Overview of the Proposed Enhancement -- 3.2 Algorithm and Architecture -- 4 Simulation Settings -- 4.1 Reference Scenario -- 4.2 Experiments and Parameters -- 5 Results and Discussion -- 6 Conclusions and Future Work -- References -- Pioneering the Establishment of the Foundations of the Internet of Things -- 1 The Internet of Things and Intermittent Connectivity -- 2 Modeling Mobile and Dynamic Networks -- 3 A Network Organization Framework for Dynamic Mobile Networks -- 4 Basic Communication Algorithms for Dynamic Mobile Networks -- 4.1 Alternative Implementations of the Support -- 5 Exploiting the Theoretical and Practical Dimensions of Research in Parallel -- 6 Closing Remarks -- References -- An Optimal Parallel Algorithm for Minimum Spanning Trees in Planar Graphs -- 1 Introduction -- 2 Preliminaries -- 3 The Algorithm.
4 Finding a (c,f(c))-Connector in a Degree-3 Graph -- 5 Extensions of Our Results -- 6 Conclusions -- References -- Weighted Random Sampling over Data Streams -- 1 Introduction -- 2 Weighted Random Sampling (WRS) -- 3 The Two Core Algorithms -- 3.1 A-Chao -- 3.2 A-ES -- 3.3 Algorithm A-Chao with Jumps -- 4 Algorithms for WRS Problems -- 4.1 Basic Problems -- 4.2 Sampling with a Bounded Number of Replacements -- 4.3 Sampling Problems in the Presence of Stream Evolution -- 5 An Abstract Data Structure for WRS -- 6 The Role of Weights -- 7 Discussion -- References -- Random Instances of Problems in NP -- Algorithms and Statistical Physics -- 1 Introduction -- 1.1 Algorithms for rCSP -- 2 Predictions from Statistical Physics - ``Cavity Method'' -- 2.1 Rigorous Results -- 3 Satisfiability Thresholds -- 4 Algorithm Dynamics -- 4.1 Convergence of Glauber Dynamics -- 4.2 Dynamics and Optimization -- 5 Algorithms Beyond Dynamics -- 5.1 Combinatorial Algorithms -- 5.2 Numerical Algorithms - Message Passing -- References -- A Selective Tour Through Congestion Games -- 1 Introduction -- 1.1 Organization -- 2 Congestion Games and Nash Equilibria -- 2.1 Price of Anarchy and Price of Stability -- 2.2 Potential Functions and Best Responses -- 2.3 Non-atomic Congestion Games -- 3 Potential Functions for Weighted Players -- 4 Reaching a Pure Nash Equilibrium -- 4.1 Series-Parallel Networks -- 4.2 Extension-Parallel Networks -- 5 The Price of Anarchy and How to Deal with It -- 5.1 The Price of Anarchy for Extension-Parallel Networks -- 5.2 Optimal Tolls for Atomic Congestion Games -- 5.3 Stackelberg Routing -- 5.4 Approximate Network Design for Non-Atomic Games -- References -- Data-Streaming and Concurrent Data-Object Co-design: Overview and Algorithmic Challenges -- 1 Introduction -- 2 Concurrent object Algorithmic Implementations - Preliminaries.
3 Data Streaming - Preliminaries -- 3.1 Parallel Data Streaming and Deterministic Processing -- 4 Inter-thread Communication in SPEs Architecture -- 5 Leveraging Concurrent Data Structures in SPEs -- 6 ScaleGate: A Novel, Concurrency- and Streaming-Aware Data Object -- 7 Evaluation Study -- 8 Conclusions -- References -- Stability in Heterogeneous Dynamic Multimedia Networks -- 1 Introduction -- 2 Related Work -- 3 Theoretical Framework -- 4 Instability of FIFO Protocol Compositions Under AQMDS Model -- 5 Instability of a FIFO Composition with Other Protocols Under AQMDC Model -- 6 Experimental Evaluation -- 7 Conclusions -- References -- Advances in the Parallelization of the Simplex Method -- 1 Introduction -- 2 Background -- 2.1 The Primal Revised Simplex Method -- 2.2 The Dual Revised Simplex Method -- 3 Overview of Simplex Parallelization -- 3.1 Parallelizing the Standard Simplex Method -- 3.2 Parallelizing the Revised Simplex Method -- 4 Recent Advances on the Parallelization of the Dual Revised Simplex Method -- 4.1 Design and Implementation (Key Issues) -- 4.2 Experimental Results -- 5 Parallel Distributed-Memory Simplex for Large-Scale Stochastic LP Problems -- 5.1 Design and Implementation (Key Issues) -- 5.2 Experimental Results -- 6 Revisiting the Parallelization of Standard Full Tableau Simplex Method -- 6.1 Design and Implementation (Key Issues) -- 6.2 Experimental Results -- 7 GPU-Based Simplex Parallelization Efforts -- 8 Conclusion -- References -- An Introduction to Temporal Graphs: An Algorithmic Perspective -- 1 Introduction -- 2 Modeling and Basic Properties -- 2.1 Journeys -- 3 Connectivity and Menger's Theorem -- 4 Dissemination and Gathering of Information -- 5 Design Problems -- 6 Temporal Versions of Other Standard Graph Problems: Complexity and Solutions -- 7 Linear Availabilities -- 8 Random Temporal Graphs -- References.
Random Surfing Without Teleportation -- 1 Introduction and Motivation -- 2 NCDawareRank Model -- 2.1 Notation -- 2.2 Definitions -- 3 Necessary and Sufficient Conditions for Random Surfing Without Teleportation -- 3.1 Preliminaries -- 3.2 NCDawareRank Primitivity Criterion -- 4 Generalizing the NCDawareRank Model -- 4.1 The Case of Overlapping Blocks -- 5 Discussion and Future Work -- References -- Of Concurrent Data Structures and Iterations -- 1 Introduction -- 2 System Model -- 3 Framework of Consistency Definitions for Concurrent Iterations -- 4 An Overview of Iteration Algorithms and Implementations -- 5 Possible Applications and Research Questions -- References -- On Some Combinatorial Properties of Random Intersection Graphs -- 1 Introduction and Motivation -- 1.1 Definitions and a First Look at RIGs -- 2 An Overview of Selected Combinatorial Problems -- 2.1 Independent Sets -- 2.2 Hamilton Cycles -- 2.3 Coloring -- 2.4 Expansion and Random Walks -- 3 Maximum Cliques -- 4 Epilogue -- References -- Efficient Equilibrium Concepts in Non-cooperative Network Formation -- 1 Introduction -- 2 Notation and Graph-Theoretic Background -- 3 The Basic Network Creation Game -- 4 The Asymmetric Basic Network Creation Game -- 5 The Greedy Buy Basic Network Creation Game -- 6 The Local Cost Basic Network Creation Game -- 7 Dynamics of Equilibria -- 7.1 Symmetric, Asymmetric, and Greedy Swap Equilibria -- 7.2 Local Cost Swap Equilibria -- 8 Conclusions and Open Issues -- References -- Simple Parallel Algorithms for Dynamic Range Products -- 1 Introduction -- 1.1 The Problem -- 1.2 Applications -- 1.3 Our Contribution and Related Work -- 2 Tree Partitioning -- 3 Dynamic Range Products -- 4 Conclusions -- References -- Author Index.
Record Nr. UNINA-9910484935203321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui