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.
3+1 Formalism in General Relativity [[electronic resource] ] : Bases of Numerical Relativity / / by Éric Gourgoulhon
| 3+1 Formalism in General Relativity [[electronic resource] ] : Bases of Numerical Relativity / / by Éric Gourgoulhon |
| Autore | Gourgoulhon Éric |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XVII, 294 p. 29 illus.) |
| Disciplina | 530.11 |
| Collana | Lecture Notes in Physics |
| Soggetto topico |
Physics
Gravitation Astronomy Astrophysics Computer mathematics Numerical and Computational Physics, Simulation Classical and Quantum Gravitation, Relativity Theory Astronomy, Astrophysics and Cosmology Computational Mathematics and Numerical Analysis |
| ISBN | 3-642-24525-0 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Basic Differential Geometry -- Geometry of Hypersurfaces -- Geometry of Foliations -- 3+1 decomposition of Einstein Equation -- 3+1 Equations for Matter and Electromagnetic Field -- Conformal Decompositon -- Asymptotic Flatness and Global Quantities -- The Initial Data Problem -- Choice of Foliation and Spatial Coordiinates -- Evolution Schemes -- Conformal Killing Operator and Conformal Vector Laplacian -- Sage Codes. |
| Record Nr. | UNISA-996466688103316 |
Gourgoulhon Éric
|
||
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Accelerated optimization for machine learning : first-order algorithms / / Zhouchen Lin, Huan Li, Cong Fang
| Accelerated optimization for machine learning : first-order algorithms / / Zhouchen Lin, Huan Li, Cong Fang |
| Autore | Lin Zhouchen |
| Pubbl/distr/stampa | Singapore : , : Springer, , [2020] |
| Descrizione fisica | 1 online resource (286 pages) |
| Disciplina | 006.31 |
| Soggetto topico |
Machine learning - Mathematics
Mathematical optimization Computer mathematics Machine Learning Optimization Math Applications in Computer Science Computational Mathematics and Numerical Analysis |
| ISBN |
981-15-2910-8
9789811529108 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Chapter 1. Introduction -- Chapter 2. Accelerated Algorithms for Unconstrained Convex Optimization -- Chapter 3. Accelerated Algorithms for Constrained Convex Optimization -- Chapter 4. Accelerated Algorithms for Nonconvex Optimization -- Chapter 5. Accelerated Stochastic Algorithms -- Chapter 6. Accelerated Paralleling Algorithms -- Chapter 7. Conclusions. |
| Record Nr. | UNISA-996465342403316 |
|
Lin Zhouchen
|
||
| Singapore : , : Springer, , [2020] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Active Visual Inference of Surface Shape [[electronic resource] /] / by Roberto Cipolla
| Active Visual Inference of Surface Shape [[electronic resource] /] / by Roberto Cipolla |
| Autore | Cipolla Roberto |
| Edizione | [1st ed. 1996.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 |
| Descrizione fisica | 1 online resource (XII, 196 p.) |
| Disciplina | 006.4/2 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer mathematics
Differential geometry Computer simulation Optical data processing Artificial intelligence Pattern recognition Computational Mathematics and Numerical Analysis Differential Geometry Simulation and Modeling Image Processing and Computer Vision Artificial Intelligence Pattern Recognition |
| ISBN | 3-540-48522-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Surface shape from the deformation of apparent contours -- Deformation of apparent contours — Implementation -- Qualitative shape from images of surface curves -- Orientation and time to contact from image divergence and deformation -- Conclusions. |
| Record Nr. | UNISA-996465475003316 |
|
Cipolla Roberto
|
||
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Advances in Cryptology - CRYPTO 2000 [[electronic resource] ] : 20th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2000. Proceedings / / edited by Mihir Bellare
| Advances in Cryptology - CRYPTO 2000 [[electronic resource] ] : 20th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2000. Proceedings / / edited by Mihir Bellare |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XI, 543 p.) |
| Disciplina | 005.8/2 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer communication systems
Data encryption (Computer science) Algorithms Management information systems Computer science Computer mathematics Computer Communication Networks Cryptology Algorithm Analysis and Problem Complexity Management of Computing and Information Systems Computational Mathematics and Numerical Analysis |
| ISBN | 3-540-44598-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | XTR and NTRU -- The XTR Public Key System -- A Chosen-Ciphertext Attack against NTRU -- Privacy for Databases -- Privacy Preserving Data Mining -- Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing -- Secure Distributed Computation and Applications -- Parallel Reducibility for Information-Theoretically Secure Computation -- Optimistic Fair Secure Computation -- A Cryptographic Solution to a Game Theoretic Problem -- Algebraic Cryptosystems -- Differential Fault Attacks on Elliptic Curve Cryptosystems -- Quantum Public-Key Cryptosystems -- New Public-Key Cryptosystem Using Braid Groups -- Message Authentication -- Key Recovery and Forgery Attacks on the MacDES MAC Algorithm -- CBC MACs for Arbitrary-Length Messages: The Three-Key Constructions -- L-collision Attacks against Randomized MACs -- Digital Signatures -- On the Exact Security of Full Domain Hash -- Timed Commitments -- A Practical and Provably Secure Coalition-Resistant Group Signature Scheme -- Provably Secure Partially Blind Signatures -- Cryptanalysis -- Weaknesses in the SL2( ) Hashing Scheme -- Fast Correlation Attacks through Reconstruction of Linear Polynomials -- Traitor Tracing and Broadcast Encryption -- Sequential Traitor Tracing -- Long-Lived Broadcast Encryption -- Invited Talk -- Taming the Adversary -- Symmetric Encryption -- The Security of All-or-Nothing Encryption: Protecting against Exhaustive Key Search -- On the Round Security of Symmetric-Key Cryptographic Primitives -- New Paradigms for Constructing Symmetric Encryption Schemes Secure against Chosen-Ciphertext Attack -- To Commit or Not to Commit -- Efficient Non-malleable Commitment Schemes -- Improved Non-committing Encryption Schemes Based on a General Complexity Assumption -- Protocols -- A Note on the Round-Complexity of Concurrent Zero-Knowledge -- An Improved Pseudo-random Generator Based on Discrete Log -- Linking Classical and Quantum Key Agreement: Is There “Bound Information”? -- Stream Ciphers and Boolean Functions -- Maximum Correlation Analysis of Nonlinear S-boxes in Stream Ciphers -- Nonlinearity Bounds and Constructions of Resilient Boolean Functions -- Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications. |
| Record Nr. | UNISA-996465407103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Advances in Cryptology – EUROCRYPT 2000 [[electronic resource] ] : International Conference on the Theory and Application of Cryptographic Techniques Bruges, Belgium, May 14-18, 2000 Proceedings / / edited by Bart Preneel
| Advances in Cryptology – EUROCRYPT 2000 [[electronic resource] ] : International Conference on the Theory and Application of Cryptographic Techniques Bruges, Belgium, May 14-18, 2000 Proceedings / / edited by Bart Preneel |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XIII, 612 p.) |
| Disciplina | 618.9268 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data encryption (Computer science)
Computer communication systems Algorithms Operating systems (Computers) Computer mathematics Cryptology Computer Communication Networks Algorithm Analysis and Problem Complexity Operating Systems Computational Mathematics and Numerical Analysis |
| ISBN | 3-540-45539-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Factoring and Discrete Logarithm -- Factorization of a 512-Bit RSA Modulus -- An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves -- Analysis and Optimization of the TWINKLE Factoring Device -- Cryptanalysis I: Digital Signatures -- Noisy Polynomial Interpolation and Noisy Chinese Remaindering -- A Chosen Messages Attack on the ISO/IEC 9796-1 Signature Scheme -- Cryptanalysis of Countermeasures Proposed for Repairing ISO 9796-1 -- Security Analysis of the Gennaro-Halevi-Rabin Signature Scheme -- Invited Talk -- On the Security of 3GPP Networks -- Private Information Retrieval -- One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval -- Single Database Private Information Retrieval Implies Oblivious Transfer -- Key Management Protocols -- Authenticated Key Exchange Secure against Dictionary Attacks -- Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman -- Fair Encryption of RSA Keys -- Threshold Cryptography and Digital Signatures -- Computing Inverses over a Shared Secret Modulus -- Practical Threshold Signatures -- Adaptively Secure Threshold Cryptography: Introducing Concurrency, Removing Erasures -- Confirmer Signature Schemes Secure against Adaptive Adversaries -- Public-Key Encryption -- Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements -- Using Hash Functions as a Hedge against Chosen Ciphertext Attack -- Quantum Cryptography -- Security Aspects of Practical Quantum Cryptography -- Perfectly Concealing Quantum Bit Commitment from any Quantum One-Way Permutation -- Multi-party Computation and Information Theory -- General Secure Multi-party Computation from any Linear Secret-Sharing Scheme -- Minimal-Latency Secure Function Evaluation -- Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free -- Cryptanalysis II: Public-Key Encryption -- New Attacks on PKCS#1 v1.5 Encryption -- A NICE Cryptanalysis -- Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations -- Cryptanalysis of Patarin’s 2-Round Public Key System with S Boxes (2R) -- Invited Talk -- Colossus and the German Lorenz Cipher — Code Breaking in WW II -- Zero-Knowledge -- Efficient Concurrent Zero-Knowledge in the Auxiliary String Model -- Efficient Proofs that a Committed Number Lies in an Interval -- Symmetric Cryptography -- A Composition Theorem for Universal One-Way Hash Functions -- Exposure-Resilient Functions and All-or-Nothing Transforms -- The Sum of PRPs Is a Secure PRF -- Boolean Functions and Hardware -- Construction of Nonlinear Boolean Functions with Important Cryptographic Properties -- Propagation Characteristics and Correlation-Immunity of Highly Nonlinear Boolean Functions -- Cox-Rower Architecture for Fast Parallel Montgomery Multiplication -- Voting Schemes -- Efficient Receipt-Free Voting Based on Homomorphic Encryption -- How to Break a Practical MIX and Design a New One -- Cryptanalysis III: Stream Ciphers and Block Ciphers -- Improved Fast Correlation Attacks Using Parity-Check Equations of Weight 4 and 5 -- Advanced Slide Attacks. |
| Record Nr. | UNISA-996465856603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Advances in Cryptology – EUROCRYPT 2001 [[electronic resource] ] : International Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 6–10, 2001, Proceedings / / edited by Birgit Pfitzmann
| Advances in Cryptology – EUROCRYPT 2001 [[electronic resource] ] : International Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 6–10, 2001, Proceedings / / edited by Birgit Pfitzmann |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XIII, 544 p. 23 illus.) |
| Disciplina | 652.8 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data encryption (Computer science)
Computer science—Mathematics Management information systems Computer science Computer communication systems Algorithms Computer mathematics Cryptology Mathematics of Computing Management of Computing and Information Systems Computer Communication Networks Algorithm Analysis and Problem Complexity Computational Mathematics and Numerical Analysis |
| ISBN | 3-540-44987-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Elliptic Curves -- A Memory Efficient Version of Satoh’s Algorithm -- Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy -- How Secure Are Elliptic Curves over Composite Extension Fields? -- Commitments -- Efficient and Non-interactive Non-malleable Commitment -- How to Convert the Flavor of a Quantum Bit Commitment -- Anonymity -- Cryptographic Counters and Applications to Electronic Voting -- An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation -- Priced Oblivious Transfer: How to Sell Digital Goods -- Signatures and Hash Functions -- A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures -- Practical Threshold RSA Signatures without a Trusted Dealer -- Hash Functions: From Merkle-Damgård to Shoup -- XTR and NTRU -- Key Recovery and Message Attacks on NTRU-Composite -- Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems -- NSS: An NTRU Lattice-Based Signature Scheme -- Assumptions -- The Bit Security of Paillier’s Encryption Scheme and Its Applications -- Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference -- Multiparty Protocols -- On Adaptive vs. Non-adaptive Security of Multiparty Protocols -- Multiparty Computation from Threshold Homomorphic Encryption -- On Perfect and Adaptive Security in Exposure-Resilient Cryptography -- Block Ciphers -- Cryptanalysis of Reduced-Round MISTY -- The Rectangle Attack — Rectangling the Serpent -- Primitives -- Efficient Amplification of the Security of Weak Pseudo-random Function Generators -- Min-round Resettable Zero-Knowledge in the Public-Key Model -- Symmetric Ciphers -- Structural Cryptanalysis of SASAS -- Hyper-bent Functions -- New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs -- Key Exchange and Multicast -- Lower Bounds for Multicast Message Authentication -- Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels -- Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords -- Authentication and Identification -- Identification Protocols Secure against Reset Attacks -- Does Encryption with Redundancy Provide Authenticity? -- Encryption Modes with Almost Free Message Integrity. |
| Record Nr. | UNISA-996466163203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Advances in Hydroinformatics [[electronic resource] ] : SimHydro 2019 - Models for Extreme Situations and Crisis Management / / edited by Philippe Gourbesville, Guy Caignaert
| Advances in Hydroinformatics [[electronic resource] ] : SimHydro 2019 - Models for Extreme Situations and Crisis Management / / edited by Philippe Gourbesville, Guy Caignaert |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Singapore : , : Springer Singapore : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (XVII, 1077 p. 621 illus., 541 illus. in color.) |
| Disciplina | 627 |
| Collana | Springer Water |
| Soggetto topico |
Engineering geology
Engineering—Geology Foundations Hydraulics Hydrology Computer mathematics Computer simulation Geoengineering, Foundations, Hydraulics Hydrology/Water Resources Computational Science and Engineering Simulation and Modeling |
| ISBN | 981-15-5436-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996418276303316 |
| Singapore : , : Springer Singapore : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algebraic Structures and Applications [[electronic resource] ] : SPAS 2017, Västerås and Stockholm, Sweden, October 4-6 / / edited by Sergei Silvestrov, Anatoliy Malyarenko, Milica Rančić
| Algebraic Structures and Applications [[electronic resource] ] : SPAS 2017, Västerås and Stockholm, Sweden, October 4-6 / / edited by Sergei Silvestrov, Anatoliy Malyarenko, Milica Rančić |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (976 pages) |
| Disciplina | 519.2 |
| Collana | Springer Proceedings in Mathematics & Statistics |
| Soggetto topico |
Matrix theory
Algebra Probabilities Computer mathematics Mathematical physics Linear and Multilinear Algebras, Matrix Theory Probability Theory and Stochastic Processes Computational Mathematics and Numerical Analysis Theoretical, Mathematical and Computational Physics |
| ISBN | 3-030-41850-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | V. Abramov, Weil algebra, 3-Lie algebra and B.R.S. algebra -- V. Abramov, R. Kerner, and O. Liivapuu, Algebras with ternary composition law combining Z2 and Z3 gradings -- V. Abramov and P. Lätt, Ternary Lie Superalgebras and Nambu-Hamilton Equation in Superspace -- A. Ben Abdeljelil, M. Elhamdadi, I. Kaygorodov, and A. Makhlouf, Generalized Derivations of n-BiHom-Lie algebras -- A. Kitouni, A. Makhlouf and S. Silvestrov, On n-ary generalization of BiHom-Lie algebras and BiHomassociative algebras -- A. Kitouni, A. Makhlouf and S. Silvestrov, On solvability and nilpotency for (n+1)-Hom-Lie algebras induced by n-Hom-Lie algebras -- I. Bakayoko and S. Silvestrov, Multiplicative n-Hom-Lie color algebras -- A. Makhlouf and M. Mehidi, On classification of Filiform Hom-Lie algebras -- E. Ongong’a, Johan Richter, and S. Silvestrov, Classification of low-dimensional Hom-Lie algebras -- A. Armakan and S. Silvestrov, Enveloping algebras of certain types of color hom-Lie algebras -- S. K. Mishra and S. Silvestrov, A Review on Hom-Gerstenhaber algebras and Hom-Lie algebroids -- L. Hellström, Strong Hom-associativity -- Tianshui Ma, S. Silvestrov, and H. Zheng, On Hom-Yetter-Drinfeld category -- I. R. Churchill, M. Elhamdadi and N. Van Kempen, On the classification of f - quandles -- P. Nystedt, Noncommutatively graded algebras -- A. Dimakis and F. Müller-Hoissen, Differential Calculi on Associative Algebras and Integrable Systems -- V. V. Bavula, The Jacobian Conjecture2 n implies the Dixmier Problem n -- A. B. Tumwesigye, J. Richter, S. Silvestrov, Commutants in crossed product algebras for piecewise constant functions on the real line -- A. B. Tumwesigye, J. Richter, S. Silvestrov, Ore extensions of functional algebras -- A. B. Tumwesigye, J. Richter, S. Silvestrov, Centralizers in PBW Extensions -- J. Musonda, S. Kaijser, and S. Silvestrov, Reordering, centralizers and centers in an algebra with three generators and Lie type relations -- J. Musonda, J. Richter, and S. Silvestrov, Reordering in noncommutative algebras associated with iterated function systems -- J. Musonda, J. Richter, and S. Silvestrov, Twisted difference operator representations of deformed Lie type commutation relations -- R. R. Cantuba and S. Silvestrov, Torsion-type q-deformed Heisenberg algebra and its Lie polynomials -- R. R. Cantuba, S. Silvestrov, Lie polynomial characterization problems -- S. Silvestrov, P. M. Rajkovic, S. D. Marinkovic, and M. S. Stankovic -- Relations Between the Fractional Operators in q–Calculus -- T. Ernst, On the exponential and trigonometric q;w-special functions -- M. Mitrovic and S. Silvestrov, Isomorphism theorems for basic constructive algebraic structures with special emphasize on constructive semigroups with apartness -an overview -- M. Mitrovic and S. Silvestrov, Semilatice decompositions of semigroups. Hereditariness and periodicity – an overview -- T. Nazir and S. Silvestrov, Common Fixed Point for Integral Type Contractive Mappings in Multiplicative Metric Spaces -- T. Nazir and S. Silvestrov, Cyclic Contractions and Common Fixed Point Results of Integral Type Contractions in Multiplicative Metric Spaces -- K. Lundengård, J. Österberg, S. Silvestrov, Extreme points of the Vandermonde determinant on the sphere and some limits involving the generalized Vandermonde determinant -- A. K. Muhumuza, K. Lundengård, J. Österberg, S. Silvestrov, J. M. Mango and G. Kakuba, Extreme Points of the Vandermonde Determinant on Surfaces Implicitly Determined by a Univariate Polynomial -- A. K. Muhumuza, K. Lundengård, J. Österberg, S. Silvestrov, J. M. Mango, and G. Kakuba, Optimization of the Wishart joint eigenvalue probability density distribution based on the Vandermonde determinant -- A. Malyarenko, H. Nohrouzian, and S. Silvestrov, An algebraic method for pricing financial instruments on post-crisis market -- B. Canhanga, A. Malyarenko, J.-P. Murara, Y. Ni and S. Silvestrov, Advanced Monte Carlo pricing of European options in a market model with two stochastic volatilities -- C. Nhangumbe, E. Fredericks and B. Canhanga, Lie Symmetry Analysis on Pricing Weather Derivatives by Partial Differential Equations -- D. Silvestrov, S. Silvestrov, B. Abola, P. S. Biganda, C. Engström, J. M. Mango and G. Kakuba, Perturbation analysis for stationary distributions of Markov chains with damping component -- M. Dogan, Uniqueness of p-adic Gibbs measures for p-adic l-Ising model on Cayley Tree of arbitrary order -- I. Chandarki and B. Singh, On Pade Approximants Series Solutions of MHD Flow Equations with Heat and Mass Transfer Due to a Point Sink -- Index. |
| Record Nr. | UNISA-996418203903316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Computation [[electronic resource] ] : 8th International Symposium, ISAAC'97, Singapore, December 17-19, 1997, Proceedings. / / edited by Hon Wai Leong, Hiroshi Imai, Sanjay Jain
| Algorithms and Computation [[electronic resource] ] : 8th International Symposium, ISAAC'97, Singapore, December 17-19, 1997, Proceedings. / / edited by Hon Wai Leong, Hiroshi Imai, Sanjay Jain |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XVII, 435 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Computer science—Mathematics Computer mathematics Numerical analysis Theory of Computation Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Computation by Abstract Devices Computational Mathematics and Numerical Analysis Numeric Computing |
| ISBN | 3-540-69662-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Solving NP-hard combinatorial problems in the practical sense Invited presentation -- Airline crew-scheduling problem with many irregular flights -- Practical approach to a facility location problem for large-scale logistics -- Hard instance generation for SAT -- Playing tetris on meshes and multi-dimensional Shearsort -- Formulation of the addition-shift-sequence problem and its complexity -- Weighted and unweighted selection algorithms for k sorted sequences -- An adaptive distributed fault-tolerant routing algorithm for the star graph -- Multi-color routing in the undirected hypercube -- Competitive source routing on tori and meshes -- Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs -- Augmenting edge and vertex connectivities simultaneously -- Two-face horn extensions -- Decremental maintenance of reachability in hypergraphs and minimum models of horn formulae -- Algorithmic analysis of multithreaded algorithms -- A characterization of planar graphs by pseudo-line arrangements -- Optimal fault-tolerant broadcasting in trees -- A theoretical framework of hybrid approaches to MAX SAT -- Exponential lower bounds on the size of OBDDs representing integer division -- On-line versus off-line in money-making strategies with brokerage -- Decision-making by hierarchies of discordant agents -- A new efficient off-line anonymous cash scheme -- Approximating unweighted connectivity problems in parallel -- A randomized linear work EREW PRAM algorithm to find a minimum spanning forest -- Efficient parallel algorithms for planar st-graphs -- Peg-solitaire, string rewriting systems and finite automata -- On the size of probabilistic formulae -- Homophonic coding with logarithmic memory size -- Complexity and modeling aspects of mesh refinement into quadrilaterals -- Topology oriented vs. exact arithmetic — Experience in implementing the three-dimensional convex hull algorithm -- The complexity of learning branches and strategies from queries -- Singularities make spatial join scheduling hard -- A faster one-dimensional topological compaction algorithm -- Algorithms for finding optimal disjoint paths around a rectangle -- An algorithm for finding a region with the minimum total L 1 from prescribed terminals -- On defect sets in bipartite graphs (extended abstract) -- Dynamic programming on distance-hereditary graphs -- On the equivalence in complexity among basic problems on bipartite and parity graphs -- All-cavity maximum matchings -- Fast algorithms for computing ?-Skeletons and their relatives -- A branch-and-cut approach for minimum weight triangulation -- An efficient approximation scheme for the subset-sum problem -- Competitive call control in mobile networks -- Generalized swap-with-parent schemes for self-organizing sequential linear lists. |
| Record Nr. | UNISA-996466078903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Computation [[electronic resource] ] : 7th International Symposium, ISAAC '96, Osaka, Japan, December 16 - 18, 1996, Proceedings / / edited by Tetsuo Asano, Yoshihide Igarashi, Hiroshi Nagamochi, Satoru Miyano, Subhash Suri
| Algorithms and Computation [[electronic resource] ] : 7th International Symposium, ISAAC '96, Osaka, Japan, December 16 - 18, 1996, Proceedings / / edited by Tetsuo Asano, Yoshihide Igarashi, Hiroshi Nagamochi, Satoru Miyano, Subhash Suri |
| Edizione | [1st ed. 1996.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 |
| Descrizione fisica | 1 online resource (X, 458 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Computer communication systems Computer graphics Computer mathematics Theory of Computation Algorithm Analysis and Problem Complexity Computation by Abstract Devices Computer Communication Networks Computer Graphics Computational Mathematics and Numerical Analysis |
| ISBN | 3-540-49633-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Applications of a numbering scheme for polygonal obstacles in the plane -- Multicast communication in high speed networks -- Incremental convex hull algorithms are not output sensitive -- Separating and shattering long line segments -- Optimal line bipartitions of point sets -- Interval finding and its application to data mining -- On the approximability of the Steiner tree problem in phylogeny -- Approximation and special cases of common subtrees and editing distance -- Two-dimensional dynamic dictionary matching -- Discovering unbounded unions of regular pattern languages from positive examples -- Extremal problems for geometric hypergraphs -- Computing fair and bottleneck matchings in geometric graphs -- Computing the maximum overlap of two convex polygons under translations -- OBDDs of a monotone function and of its prime implicants -- Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs -- Graph searching on chordal graphs -- An algorithm for enumerating all directed spanning trees in a directed graph -- Vertex ranking of asteroidal triple-free graphs -- Recursively divisible problems -- StUSPACE(log n) ?-DSPACE(log2 n/log log n) -- Finding edge-disjoint paths in partial k-trees -- Optimal augmentation for bipartite componentwise biconnectivity in linear time -- Towards more precise parallel biconnectivity approximation -- The complexity of probabilistic versus deterministic finite automata -- Bounded length UCFG equivalence -- The Steiner Minimal Tree problem in the ?-geometry plane -- A study of the LMT-skeleton -- A new subgraph of minimum weight triangulations -- Dynamic tree routing under the “matching with consumption” model -- Dimension-exchange token distribution on the mesh and the torus -- Directed hamiltonian packing in d-dimensional meshes and its application -- k-pairs non-crossing shortest paths in a simple polygon -- Minimum convex partition of a polygon with holes by cuts in given directions -- Efficient list ranking on the reconfigurable mesh, with applications -- Periodic merging networks -- Minimizing wavelengths in an all-optical ring network -- Competitive analysis of on-line disk scheduling -- Scheduling interval ordered tasks with non-uniform deadlines -- Cryptographic weaknesses in the round transformation used in a block cipher with provable immunity against linear cryptanalysis -- The multi-variable modular polynomial and its applications to cryptography -- Bounds and algorithms for a practical task allocation model (extended abstract) -- Scheduling algorithms for strict multithreaded computations -- On multi-threaded Paging -- A fast and efficient homophonic coding algorithm -- An improvement of the digital cash protocol of Okamoto and Ohta. |
| Record Nr. | UNISA-996465977303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
