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.
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques [[electronic resource] ] : 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeto, NY, USA, August 24-26,2003 / / edited by Sanjeev Arora, Klaus Jansen, Jose D.P. Rolim, Amit Sahai
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques [[electronic resource] ] : 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeto, NY, USA, August 24-26,2003 / / edited by Sanjeev Arora, Klaus Jansen, Jose D.P. Rolim, Amit Sahai |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (IX, 411 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Mathematical optimization Algorithms Numerical analysis Computer science—Mathematics Software Engineering/Programming and Operating Systems Optimization Algorithm Analysis and Problem Complexity Numeric Computing Discrete Mathematics in Computer Science |
| ISBN | 3-540-45198-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Contributed Talks of APPROX -- Correlation Clustering with Partial Information -- Improved Linear Time Approximation Algorithms for Weighted Matchings -- Covering Graphs Using Trees and Stars -- An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor -- Approximation Algorithms for Channel Allocation Problems in Broadcast Networks -- Asymmetry in k-Center Variants -- An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times -- On the Complexity of Approximating k-Dimensional Matching -- Approximating Market Equilibria -- Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem -- On the Hardness of Approximate Multivariate Integration -- A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem -- Approximating Rooted Connectivity Augmentation Problems -- Effective Routing and Scheduling in Adversarial Queueing Networks -- Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement -- An Improved Algorithm for Approximating the Radii of Point Sets -- Contributed Talks of RANDOM -- Testing Low-Degree Polynomials over GF(2) -- Computational Analogues of Entropy -- Bounds on 2-Query Codeword Testing -- The Lovász Number of Random Graphs -- Perfectly Balanced Allocation -- On Extracting Private Randomness over a Public Channel -- High Degree Vertices and Eigenvalues in the Preferential Attachment Graph -- The Satisfiability Threshold for Randomly Generated Binary Constraint Satisfaction Problems -- Continuous-Time Quantum Walks on the Symmetric Group -- Distribution-Free Property Testing -- On the Graph-Density of Random 0/1-Polytopes -- A Gambling Game Arising in the Analysis of Adaptive Randomized Rounding -- Tight Bounds for Testing Bipartiteness in General Graphs -- Discrete Quantum Walks Hit Exponentially Faster -- Approximate Testing of Visual Properties -- Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances -- A Nearly Linear Size 4-Min-Wise Independent Permutation Family by Finite Geometries. |
| Record Nr. | UNISA-996465960103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeto, NY, USA, August 24-26,2003 / / edited by Sanjeev Arora, Klaus Jansen, Jose D.P. Rolim, Amit Sahai
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeto, NY, USA, August 24-26,2003 / / edited by Sanjeev Arora, Klaus Jansen, Jose D.P. Rolim, Amit Sahai |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (IX, 411 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Mathematical optimization Algorithms Numerical analysis Computer science—Mathematics Discrete mathematics Software Engineering Optimization Numerical Analysis Discrete Mathematics in Computer Science |
| ISBN | 3-540-45198-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Contributed Talks of APPROX -- Correlation Clustering with Partial Information -- Improved Linear Time Approximation Algorithms for Weighted Matchings -- Covering Graphs Using Trees and Stars -- An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor -- Approximation Algorithms for Channel Allocation Problems in Broadcast Networks -- Asymmetry in k-Center Variants -- An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times -- On the Complexity of Approximating k-Dimensional Matching -- Approximating Market Equilibria -- Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem -- On the Hardness of Approximate Multivariate Integration -- A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem -- Approximating Rooted Connectivity Augmentation Problems -- Effective Routing and Scheduling in Adversarial Queueing Networks -- Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement -- An Improved Algorithm for Approximating the Radii of Point Sets -- Contributed Talks of RANDOM -- Testing Low-Degree Polynomials over GF(2) -- Computational Analogues of Entropy -- Bounds on 2-Query Codeword Testing -- The Lovász Number of Random Graphs -- Perfectly Balanced Allocation -- On Extracting Private Randomness over a Public Channel -- High Degree Vertices and Eigenvalues in the Preferential Attachment Graph -- The Satisfiability Threshold for Randomly Generated Binary Constraint Satisfaction Problems -- Continuous-Time Quantum Walks on the Symmetric Group -- Distribution-Free Property Testing -- On the Graph-Density of Random 0/1-Polytopes -- A Gambling Game Arising in the Analysis of Adaptive Randomized Rounding -- Tight Bounds for Testing Bipartiteness in General Graphs -- Discrete Quantum Walks Hit Exponentially Faster -- Approximate Testing of Visual Properties -- Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances -- A Nearly Linear Size 4-Min-Wise Independent Permutation Family by Finite Geometries. |
| Record Nr. | UNINA-9910144026203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Secure multi-party computation [[electronic resource] /] / edited by Manoj M. Prabhakaran and Amit Sahai
| Secure multi-party computation [[electronic resource] /] / edited by Manoj M. Prabhakaran and Amit Sahai |
| Pubbl/distr/stampa | Amsterdam ; ; Washington, DC, : IOS Press, 2013 |
| Descrizione fisica | 1 online resource (296 p.) |
| Disciplina | 005.8/2 |
| Altri autori (Persone) |
PrabhakaranManoj M
SahaiAmit |
| Collana | Cryptology and information security series |
| Soggetto topico |
Computer security - Management
Cryptography |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-299-33339-7
1-61499-169-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Title Page; Foreword; Preface; Contents; General Cryptographic Protocols: The Very Basics; A Short Tutorial of Zero-Knowledge; Security and Composition of Cryptographic Protocols: A Tutorial; The BGW Protocol for Perfectly-Secure Multiparty Computation; Information-Theoretic Secure Multiparty Computation; The IPS Compiler; Randomization Techniques for Secure Computation; Complexity of Multi-Party Computation Functionalities; Author Index |
| Record Nr. | UNINA-9910465104303321 |
| Amsterdam ; ; Washington, DC, : IOS Press, 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Secure multi-party computation [[electronic resource] /] / edited by Manoj M. Prabhakaran and Amit Sahai
| Secure multi-party computation [[electronic resource] /] / edited by Manoj M. Prabhakaran and Amit Sahai |
| Pubbl/distr/stampa | Amsterdam ; ; Washington, DC, : IOS Press, 2013 |
| Descrizione fisica | 1 online resource (296 p.) |
| Disciplina | 005.8/2 |
| Altri autori (Persone) |
PrabhakaranManoj M
SahaiAmit |
| Collana | Cryptology and information security series |
| Soggetto topico |
Computer security - Management
Cryptography |
| ISBN |
1-299-33339-7
1-61499-169-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Title Page; Foreword; Preface; Contents; General Cryptographic Protocols: The Very Basics; A Short Tutorial of Zero-Knowledge; Security and Composition of Cryptographic Protocols: A Tutorial; The BGW Protocol for Perfectly-Secure Multiparty Computation; Information-Theoretic Secure Multiparty Computation; The IPS Compiler; Randomization Techniques for Secure Computation; Complexity of Multi-Party Computation Functionalities; Author Index |
| Record Nr. | UNINA-9910792043203321 |
| Amsterdam ; ; Washington, DC, : IOS Press, 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Secure multi-party computation / / edited by Manoj M. Prabhakaran and Amit Sahai
| Secure multi-party computation / / edited by Manoj M. Prabhakaran and Amit Sahai |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Amsterdam ; ; Washington, DC, : IOS Press, 2013 |
| Descrizione fisica | 1 online resource (296 p.) |
| Disciplina | 005.8/2 |
| Altri autori (Persone) |
PrabhakaranManoj M
SahaiAmit |
| Collana | Cryptology and information security series |
| Soggetto topico |
Computer security - Management
Cryptography |
| ISBN |
1-299-33339-7
1-61499-169-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Title Page; Foreword; Preface; Contents; General Cryptographic Protocols: The Very Basics; A Short Tutorial of Zero-Knowledge; Security and Composition of Cryptographic Protocols: A Tutorial; The BGW Protocol for Perfectly-Secure Multiparty Computation; Information-Theoretic Secure Multiparty Computation; The IPS Compiler; Randomization Techniques for Secure Computation; Complexity of Multi-Party Computation Functionalities; Author Index |
| Record Nr. | UNINA-9910816880803321 |
| Amsterdam ; ; Washington, DC, : IOS Press, 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theory of Cryptography [[electronic resource] ] : 10th Theory of Cryptography Conference, TCC 2013, Tokyo, Japan, March 3-6, 2013. Proceedings / / edited by Amit Sahai
| Theory of Cryptography [[electronic resource] ] : 10th Theory of Cryptography Conference, TCC 2013, Tokyo, Japan, March 3-6, 2013. Proceedings / / edited by Amit Sahai |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XII, 726 p. 34 illus.) |
| Disciplina | 005.8/2 |
| Collana | Security and Cryptology |
| Soggetto topico |
Data encryption (Computer science)
Computer security Computers Algorithms Cryptology Systems and Data Security Computation by Abstract Devices Algorithm Analysis and Problem Complexity |
| ISBN | 3-642-36594-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Study of known paradigms -- Approaches, and techniques, directed towards their better understanding and utilization -- Discovery of new paradigms, approaches and techniques that overcome limitations of the existing ones -- Formulation and treatment of new cryptographic problems -- Study of notions of security and relations among them -- Modeling and analysis of cryptographic algorithms -- Study of the complexity assumptions used in cryptography. |
| Record Nr. | UNISA-996466261803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theory of Cryptography : 10th Theory of Cryptography Conference, TCC 2013, Tokyo, Japan, March 3-6, 2013. Proceedings / / edited by Amit Sahai
| Theory of Cryptography : 10th Theory of Cryptography Conference, TCC 2013, Tokyo, Japan, March 3-6, 2013. Proceedings / / edited by Amit Sahai |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XII, 726 p. 34 illus.) |
| Disciplina | 005.8/2 |
| Collana | Security and Cryptology |
| Soggetto topico |
Data encryption (Computer science)
Computer security Computers Algorithms Cryptology Systems and Data Security Computation by Abstract Devices Algorithm Analysis and Problem Complexity |
| ISBN | 3-642-36594-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Study of known paradigms -- Approaches, and techniques, directed towards their better understanding and utilization -- Discovery of new paradigms, approaches and techniques that overcome limitations of the existing ones -- Formulation and treatment of new cryptographic problems -- Study of notions of security and relations among them -- Modeling and analysis of cryptographic algorithms -- Study of the complexity assumptions used in cryptography. |
| Record Nr. | UNINA-9910739422903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||