Info
Control theoretic splines [[electronic resource] ] : optimal control, statistics, and path planning / / Magnus Egerstedt and Clyde Martin
| Control theoretic splines [[electronic resource] ] : optimal control, statistics, and path planning / / Magnus Egerstedt and Clyde Martin |
| Autore | Egerstedt Magnus |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, : Princeton University Press, c2010 |
| Descrizione fisica | 1 online resource (227 p.) |
| Disciplina | 511/.42 |
| Altri autori (Persone) | MartinClyde |
| Collana | Princeton series in applied mathematics |
| Soggetto topico |
Interpolation
Smoothing (Numerical analysis) Smoothing (Statistics) Curve fitting Splines Spline theory |
| Soggetto non controllato |
Accuracy and precision
Affine space Affine variety Algorithm Approximation Arbitrarily large B-spline Banach space Bernstein polynomial Bifurcation theory Big O notation Birkhoff interpolation Boundary value problem Bézier curve Chaos theory Computation Computational problem Condition number Constrained optimization Continuous function (set theory) Continuous function Control function (econometrics) Control theory Controllability Convex optimization Convolution Cubic Hermite spline Data set Derivative Differentiable function Differential equation Dimension (vector space) Directional derivative Discrete mathematics Dynamic programming Equation Estimation Filtering problem (stochastic processes) Gaussian quadrature Gradient descent Gramian matrix Growth curve (statistics) Hermite interpolation Hermite polynomials Hilbert projection theorem Hilbert space Initial condition Initial value problem Integral equation Iterative method Karush–Kuhn–Tucker conditions Kernel method Lagrange polynomial Law of large numbers Least squares Linear algebra Linear combination Linear filter Linear map Mathematical optimization Mathematics Maxima and minima Monotonic function Nonlinear programming Nonlinear system Normal distribution Numerical analysis Numerical stability Optimal control Optimization problem Ordinary differential equation Orthogonal polynomials Parameter Piecewise Pointwise Polynomial interpolation Polynomial Probability distribution Quadratic programming Random variable Rate of convergence Ratio test Riccati equation Simpson's rule Simultaneous equations Smoothing spline Smoothing Smoothness Special case Spline (mathematics) Spline interpolation Statistic Stochastic calculus Stochastic Telemetry Theorem Trapezoidal rule Waypoint Weight function Without loss of generality |
| ISBN |
1-282-45796-9
1-282-93606-9 9786612936067 9786612457968 1-4008-3387-6 |
| Classificazione | SK 880 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Contents -- Preface -- Chapter One. Introduction -- Chapter Two. Control Systems and Minimum Norm Problems -- Chapter Three. Eight Fundamental Problems -- Chapter Four. Smoothing Splines and Generalizations -- Chapter Five. Approximations and Limiting Concepts -- Chapter Six. Smoothing Splines with Continuous Data -- Chapter Seven. Monotone Smoothing Splines -- Chapter Eight. Smoothing Splines as Integral Filters -- Chapter Nine. Optimal Transfer between Affine Varieties -- Chapter Ten. Path Planning and Telemetry -- Chapter Eleven. Node Selection -- Bibliography -- Index |
| Record Nr. | UNINA-9910780863803321 |
Egerstedt Magnus
|
||
| Princeton, : Princeton University Press, c2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Distributed control of robotic networks [[electronic resource] ] : a mathematical approach to motion coordination algorithms / / Francesco Bullo, Jorge Cortés, Sonia Martínez
| Distributed control of robotic networks [[electronic resource] ] : a mathematical approach to motion coordination algorithms / / Francesco Bullo, Jorge Cortés, Sonia Martínez |
| Autore | Bullo Francesco |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, NJ, : Princeton University Press, 2009 |
| Descrizione fisica | 1 online resource (333 p.) |
| Disciplina | 629.8/9246 |
| Altri autori (Persone) |
CortésJorge <1974->
MartínezSonia <1974-> |
| Collana | Princeton series in applied mathematics |
| Soggetto topico |
Robotics
Computer algorithms Robots - Control systems |
| Soggetto non controllato |
1-center problem
Adjacency matrix Aggregate function Algebraic connectivity Algebraic topology (object) Algorithm Analysis of algorithms Approximation algorithm Asynchronous system Bellman–Ford algorithm Bifurcation theory Bounded set (topological vector space) Calculation Cartesian product Centroid Chebyshev center Circulant matrix Circumscribed circle Cluster analysis Combinatorial optimization Combinatorics Communication complexity Computation Computational complexity theory Computational geometry Computational model Computer simulation Computer vision Connected component (graph theory) Connectivity (graph theory) Consensus (computer science) Control function (econometrics) Differentiable function Dijkstra's algorithm Dimensional analysis Directed acyclic graph Directed graph Discrete time and continuous time Disk (mathematics) Distributed algorithm Doubly stochastic matrix Dynamical system Eigenvalues and eigenvectors Estimation Euclidean space Function composition Hybrid system Information theory Initial condition Instance (computer science) Invariance principle (linguistics) Invertible matrix Iteration Iterative method Kinematics Laplacian matrix Leader election Linear dynamical system Linear interpolation Linear programming Lipschitz continuity Lyapunov function Markov chain Mathematical induction Mathematical optimization Mobile robot Motion planning Multi-agent system Network model Network topology Norm (mathematics) Numerical integration Optimal control Optimization problem Parameter (computer programming) Partition of a set Percolation theory Permutation matrix Polytope Proportionality (mathematics) Quantifier (logic) Quantization (signal processing) Robustness (computer science) Scientific notation Sensor Set (mathematics) Simply connected space Simulation Simultaneous equations State space State variable Stochastic matrix Stochastic Strongly connected component Synchronous network Theorem Time complexity Topology Variable (mathematics) Vector field |
| ISBN |
1-68015-897-X
1-282-45820-5 1-282-93575-5 9786612458200 9786612935756 1-4008-3147-4 0-691-14195-9 |
| Classificazione | SK 880 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Contents -- Preface -- Chapter One. An introduction to distributed algorithms -- Chapter Two. Geometric models and optimization -- Chapter Three. Robotic network models and complexity notions -- Chapter Four. Connectivity maintenance and rendezvous -- Chapter Five. Deployment -- Chapter Six. Boundary estimation and tracking -- Bibliography -- Algorithm Index -- Subject Index -- Symbol Index |
| Record Nr. | UNINA-9910781069103321 |
|
Bullo Francesco
|
||
| Princeton, NJ, : Princeton University Press, 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph theoretic methods in multiagent networks / / Mehran Mesbahi and Magnus Egerstedt
| Graph theoretic methods in multiagent networks / / Mehran Mesbahi and Magnus Egerstedt |
| Autore | Mesbahi Mehran |
| Edizione | [STU student edition] |
| Pubbl/distr/stampa | Princeton : , : Princeton University Press, , [2010] |
| Descrizione fisica | 1 online resource (424 pages) |
| Disciplina | 006.3 |
| Collana | Princeton series in applied mathematics |
| Soggetto topico |
Network analysis (Planning) - Graphic methods
Multiagent systems - Mathematical models |
| Soggetto non controllato |
Addition
Adjacency matrix Algebraic graph theory Algorithm Automorphism Bipartite graph Cardinality Cartesian product Circulant graph Combinatorics Complete graph Computation Connectivity (graph theory) Controllability Convex combination Corollary Cycle graph (algebra) Cycle space Degree (graph theory) Degree matrix Diagonal matrix Diameter Differentiable function Dimension Directed graph Division by zero Dynamical system Eigenvalues and eigenvectors Equilibrium point Estimation Estimator Existential quantification Extremal graph theory Graph (discrete mathematics) Graph theory Identity matrix Incidence matrix Information exchange Initial condition Interconnection Iteration Kalman filter Kronecker product LTI system theory LaSalle's invariance principle Laplacian matrix Least squares Line graph Linear map Lipschitz continuity Lyapunov function Lyapunov stability Markov chain Mathematical optimization Matrix exponential Measurement Multi-agent system Nash equilibrium Natural number Network topology Nonnegative matrix Notation Observability Optimal control Optimization problem Pairwise Parameter Path graph Permutation matrix Permutation Positive semidefinite Positive-definite matrix Probability Quantity Random graph Random variable Rate of convergence Requirement Result Robotics Scientific notation Sensor Sign (mathematics) Simplicial complex Special case Spectral graph theory Stochastic matrix Strongly connected component Subset Summation Supergraph Symmetric matrix Systems theory Theorem Theory Unit interval Upper and lower bounds Variable (mathematics) Vector space Without loss of generality |
| ISBN |
9781400835355 (electronic book)
1-282-97910-8 9786612979101 1-4008-3535-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Contents -- Preface -- Notation -- PART 1. FOUNDATIONS -- Chapter 1. Introduction -- Chapter 2. Graph Theory -- Chapter 3. The Agreement Protocol: Part I-The Static Case -- Chapter 4. The Agreement Protocol: Part II-Lyapunov and LaSalle -- Chapter 5. Probabilistic Analysis of Networks and Protocols -- PART 2. MULTIAGENT NETWORKS -- Chapter 6. Formation Control -- Chapter 7. Mobile Robots -- Chapter 8. Distributed Estimation -- Chapter 9. Social Networks, Epidemics, and Games -- PART 3. NETWORKS AS SYSTEMS -- Chapter 10. Agreement with Inputs and Outputs -- Chapter 11. Synthesis of Networks -- Chapter 12. Dynamic Graph Processes -- Chapter 13. Higher-order Networks -- Appendix A. -- Bibliography -- Index |
| Record Nr. | UNINA-9910785659103321 |
|
Mesbahi Mehran
|
||
| Princeton : , : Princeton University Press, , [2010] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph theoretic methods in multiagent networks / / Mehran Mesbahi and Magnus Egerstedt
| Graph theoretic methods in multiagent networks / / Mehran Mesbahi and Magnus Egerstedt |
| Autore | Mesbahi Mehran |
| Edizione | [STU student edition] |
| Pubbl/distr/stampa | Princeton : , : Princeton University Press, , [2010] |
| Descrizione fisica | 1 online resource (424 pages) |
| Disciplina | 006.3 |
| Collana | Princeton series in applied mathematics |
| Soggetto topico |
Network analysis (Planning) - Graphic methods
Multiagent systems - Mathematical models |
| Soggetto non controllato |
Addition
Adjacency matrix Algebraic graph theory Algorithm Automorphism Bipartite graph Cardinality Cartesian product Circulant graph Combinatorics Complete graph Computation Connectivity (graph theory) Controllability Convex combination Corollary Cycle graph (algebra) Cycle space Degree (graph theory) Degree matrix Diagonal matrix Diameter Differentiable function Dimension Directed graph Division by zero Dynamical system Eigenvalues and eigenvectors Equilibrium point Estimation Estimator Existential quantification Extremal graph theory Graph (discrete mathematics) Graph theory Identity matrix Incidence matrix Information exchange Initial condition Interconnection Iteration Kalman filter Kronecker product LTI system theory LaSalle's invariance principle Laplacian matrix Least squares Line graph Linear map Lipschitz continuity Lyapunov function Lyapunov stability Markov chain Mathematical optimization Matrix exponential Measurement Multi-agent system Nash equilibrium Natural number Network topology Nonnegative matrix Notation Observability Optimal control Optimization problem Pairwise Parameter Path graph Permutation matrix Permutation Positive semidefinite Positive-definite matrix Probability Quantity Random graph Random variable Rate of convergence Requirement Result Robotics Scientific notation Sensor Sign (mathematics) Simplicial complex Special case Spectral graph theory Stochastic matrix Strongly connected component Subset Summation Supergraph Symmetric matrix Systems theory Theorem Theory Unit interval Upper and lower bounds Variable (mathematics) Vector space Without loss of generality |
| ISBN |
9781400835355 (electronic book)
1-282-97910-8 9786612979101 1-4008-3535-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Contents -- Preface -- Notation -- PART 1. FOUNDATIONS -- Chapter 1. Introduction -- Chapter 2. Graph Theory -- Chapter 3. The Agreement Protocol: Part I-The Static Case -- Chapter 4. The Agreement Protocol: Part II-Lyapunov and LaSalle -- Chapter 5. Probabilistic Analysis of Networks and Protocols -- PART 2. MULTIAGENT NETWORKS -- Chapter 6. Formation Control -- Chapter 7. Mobile Robots -- Chapter 8. Distributed Estimation -- Chapter 9. Social Networks, Epidemics, and Games -- PART 3. NETWORKS AS SYSTEMS -- Chapter 10. Agreement with Inputs and Outputs -- Chapter 11. Synthesis of Networks -- Chapter 12. Dynamic Graph Processes -- Chapter 13. Higher-order Networks -- Appendix A. -- Bibliography -- Index |
| Record Nr. | UNINA-9910816716403321 |
|
Mesbahi Mehran
|
||
| Princeton : , : Princeton University Press, , [2010] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Robust optimization [[electronic resource] /] / Aharon Ben-Tal, Laurent El Ghaoui, Arkadi Nemirovski
| Robust optimization [[electronic resource] /] / Aharon Ben-Tal, Laurent El Ghaoui, Arkadi Nemirovski |
| Autore | Ben-Tal A |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, NJ, : Princeton University Press, c2009 |
| Descrizione fisica | 1 online resource (565 p.) |
| Disciplina | 519.6 |
| Altri autori (Persone) |
El GhaouiLaurent
NemirovskiĭArkadiĭ Semenovich |
| Collana | Princeton Series in Applied Mathematics |
| Soggetto topico |
Robust optimization
Linear programming |
| Soggetto non controllato |
0O
Accuracy and precision Additive model Almost surely Approximation algorithm Approximation Best, worst and average case Bifurcation theory Big O notation Candidate solution Central limit theorem Chaos theory Coefficient Computational complexity theory Constrained optimization Convex hull Convex optimization Convex set Cumulative distribution function Curse of dimensionality Decision problem Decision rule Degeneracy (mathematics) Diagram (category theory) Duality (optimization) Dynamic programming Exponential function Feasible region Floor and ceiling functions For All Practical Purposes Free product Ideal solution Identity matrix Inequality (mathematics) Infimum and supremum Integer programming Law of large numbers Likelihood-ratio test Linear dynamical system Linear inequality Linear map Linear matrix inequality Linear programming Linear regression Loss function Margin classifier Markov chain Markov decision process Mathematical optimization Max-plus algebra Maxima and minima Multivariate normal distribution NP-hardness Norm (mathematics) Normal distribution Optimal control Optimization problem Orientability P versus NP problem Pairwise Parameter Parametric family Probability distribution Probability Proportionality (mathematics) Quantity Random variable Relative interior Robust control Robust decision-making Robust optimization Semi-infinite Sensitivity analysis Simple set Singular value Skew-symmetric matrix Slack variable Special case Spherical model Spline (mathematics) State variable Stochastic calculus Stochastic control Stochastic optimization Stochastic programming Stochastic Strong duality Support vector machine Theorem Time complexity Uncertainty Uniform distribution (discrete) Unimodality Upper and lower bounds Variable (mathematics) Virtual displacement Weak duality Wiener filter With high probability Without loss of generality |
| ISBN |
1-282-25928-8
9786612259289 1-4008-3105-9 |
| Classificazione | SK 870 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Contents -- Preface -- Part I. Robust Linear Optimization -- Chapter One. Uncertain Linear Optimization Problems and their Robust Counterparts -- Chapter Two. Robust Counterpart Approximations of Scalar Chance Constraints -- Chapter Three. Globalized Robust Counterparts of Uncertain LO Problems -- Chapter Four. More on Safe Tractable Approximations of Scalar Chance Constraints -- Part II. Robust Conic Optimization -- Chapter Five. Uncertain Conic Optimization: The Concepts -- Chapter Six. Uncertain Conic Quadratic Problems with Tractable RCs -- Chapter Seven. Approximating RCs of Uncertain Conic Quadratic Problems -- Chapter Eight. Uncertain Semidefinite Problems with Tractable RCs -- Chapter Nine. Approximating RCs of Uncertain Semidefinite Problems -- Chapter Ten. Approximating Chance Constrained CQIs and LMIs -- Chapter Eleven. Globalized Robust Counterparts of Uncertain Conic Problems -- Chapter Twelve. Robust Classi¯cation and Estimation -- Part III. Robust Multi-Stage Optimization -- Chapter Thirteen. Robust Markov Decision Processes -- Chapter Fourteen. Robust Adjustable Multistage Optimization -- Part IV. Selected Applications -- Chapter Fifteen. Selected Applications -- Appendix A: Notation and Prerequisites -- Appendix B: Some Auxiliary Proofs -- Appendix C: Solutions to Selected Exercises -- Bibliography -- Index |
| Record Nr. | UNINA-9910778219003321 |
|
Ben-Tal A
|
||
| Princeton, NJ, : Princeton University Press, c2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Self-Regularity : A New Paradigm for Primal-Dual Interior-Point Algorithms / / Jiming Peng, Cornelis Roos, Tamás Terlaky
| Self-Regularity : A New Paradigm for Primal-Dual Interior-Point Algorithms / / Jiming Peng, Cornelis Roos, Tamás Terlaky |
| Autore | Peng Jiming |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, NJ : , : Princeton University Press, , [2009] |
| Descrizione fisica | 1 online resource (201 p.) |
| Disciplina | 519.6 |
| Collana | Princeton Series in Applied Mathematics |
| Soggetto topico |
Interior-point methods
Mathematical optimization Programming (Mathematics) Civil & Environmental Engineering Engineering & Applied Sciences Operations Research |
| Soggetto non controllato |
Accuracy and precision
Algorithm Analysis of algorithms Analytic function Associative property Barrier function Binary number Block matrix Combination Combinatorial optimization Combinatorics Complexity Conic optimization Continuous optimization Control theory Convex optimization Delft University of Technology Derivative Differentiable function Directional derivative Division by zero Dual space Duality (mathematics) Duality gap Eigenvalues and eigenvectors Embedding Equation Estimation Existential quantification Explanation Feasible region Filter design Function (mathematics) Implementation Instance (computer science) Invertible matrix Iteration Jacobian matrix and determinant Jordan algebra Karmarkar's algorithm Karush–Kuhn–Tucker conditions Line search Linear complementarity problem Linear function Linear programming Lipschitz continuity Local convergence Loss function Mathematical optimization Mathematician Mathematics Matrix function McMaster University Monograph Multiplication operator Newton's method Nonlinear programming Nonlinear system Notation Operations research Optimal control Optimization problem Parameter (computer programming) Parameter Pattern recognition Polyhedron Polynomial Positive semidefinite Positive-definite matrix Quadratic function Requirement Result Scientific notation Second derivative Self-concordant function Sensitivity analysis Sign (mathematics) Signal processing Simplex algorithm Simultaneous equations Singular value Smoothness Solution set Solver Special case Subset Suggestion Technical report Theorem Theory Time complexity Two-dimensional space Upper and lower bounds Variable (computer science) Variable (mathematics) Variational inequality Variational principle Without loss of generality Worst-case complexity Yurii Nesterov |
| ISBN |
1-282-08760-6
9786612087608 1-4008-2513-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Contents -- Preface -- Acknowledgments -- Notation -- List of Abbreviations -- Chapter 1. Introduction and Preliminaries -- Chapter 2. Self-Regular Functions and Their Properties -- Chapter 3. Primal-Dual Algorithms for Linear Optimization Based on Self-Regular Proximities -- Chapter 4. Interior-Point Methods for Complementarity Problems Based on Self- Regular Proximities -- Chapter 5. Primal-Dual Interior-Point Methods for Semidefinite Optimization Based on Self-Regular Proximities -- Chapter 6. Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities -- Chapter 7. Initialization: Embedding Models for Linear Optimization, Complementarity Problems, Semidefinite Optimization and Second-Order Conic Optimization -- Chapter 8. Conclusions -- References -- Index |
| Record Nr. | UNINA-9910777727403321 |
|
Peng Jiming
|
||
| Princeton, NJ : , : Princeton University Press, , [2009] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The traveling salesman problem [[electronic resource] ] : a computational study / / David L. Applegate ... [et al.]
| The traveling salesman problem [[electronic resource] ] : a computational study / / David L. Applegate ... [et al.] |
| Autore | Applegate David L |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, : Princeton University Press, c2006 |
| Descrizione fisica | 1 online resource (606 p.) |
| Disciplina | 511.6 |
| Collana | Princeton series in applied mathematics |
| Soggetto topico | Traveling salesman problem |
| Soggetto non controllato |
AT&T Labs
Accuracy and precision Addition Algorithm Analysis of algorithms Applied mathematics Approximation algorithm Approximation Basic solution (linear programming) Best, worst and average case Bifurcation theory Big O notation CPLEX CPU time Calculation Chaos theory Column generation Combinatorial optimization Computation Computational resource Computer Connected component (graph theory) Connectivity (graph theory) Convex hull Cutting-plane method Delaunay triangulation Determinism Disjoint sets Dynamic programming Ear decomposition Engineering Enumeration Equation Estimation Euclidean distance Euclidean space Family of sets For loop Genetic algorithm George Dantzig Georgia Institute of Technology Greedy algorithm Hamiltonian path Hospitality Hypergraph Implementation Instance (computer science) Institute Integer Iteration Linear inequality Linear programming Mathematical optimization Mathematics Model of computation Neuroscience Notation Operations research Optimization problem Order by Pairwise Parameter (computer programming) Parity (mathematics) Percentage Polyhedron Polytope Pricing Princeton University Processing (programming language) Project Quantity Reduced cost Requirement Result Rice University Rutgers University Scientific notation Search algorithm Search tree Self-similarity Simplex algorithm Solution set Solver Source code Special case Stochastic Subroutine Subsequence Subset Summation Test set Theorem Theory Time complexity Trade-off Travelling salesman problem Tree (data structure) Upper and lower bounds Variable (computer science) Variable (mathematics) |
| ISBN |
1-283-25611-8
9786613256119 1-4008-4110-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Contents -- Preface -- Chapter 1. The Problem -- Chapter 2. Applications -- Chapter 3. Dantzig, Fulkerson, and Johnson -- Chapter 4. History of TSP Computation -- Chapter 5. LP Bounds and Cutting Planes -- Chapter 6. Subtour Cuts and PQ-Trees -- Chapter 7. Cuts from Blossoms and Blocks -- Chapter 8. Combs from Consecutive Ones -- Chapter 9. Combs from Dominoes -- Chapter 10. Cut Metamorphoses -- Chapter 11. Local Cuts -- Chapter 12. Managing the Linear Programming Problems -- Chapter 13. The Linear Programming Solver Chapter 14. Branching -- Chapter 14. Branching -- Chapter 15. Tour Finding -- Chapter 16. Computation -- Chapter 17. The Road Goes On -- Bibliography -- Index |
| Record Nr. | UNINA-9910789748903321 |
|
Applegate David L
|
||
| Princeton, : Princeton University Press, c2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||