| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996466061103316 |
|
|
Titolo |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques [[electronic resource] ] : 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30, 2006, Proceedings / / edited by Josep Diaz, Klaus Jansen, José D.P. Rolim, Uri Zwick |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2006.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XII, 522 p.) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 4110 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Software engineering |
Algorithms |
Computer science—Mathematics |
Discrete mathematics |
Numerical analysis |
Software Engineering |
Discrete Mathematics in Computer Science |
Numerical Analysis |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
Invited Talks -- On Nontrivial Approximation of CSPs -- Analysis of Algorithms on the Cores of Random Graphs -- Contributed Talks of APPROX -- Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs -- Approximating Precedence-Constrained Single Machine Scheduling by Coloring -- Minimizing Setup and Beam-On Times in Radiation Therapy -- On the Value of Preemption in Scheduling -- An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs -- Tight Results on Minimum Entropy Set Cover -- A Tight Lower Bound for the Steiner Point Removal Problem on Trees -- Single-Source Stochastic |
|
|
|
|
|
|
|
|
|
|
Routing -- An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem -- Online Algorithms to Minimize Resource Reallocations and Network Communication -- Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs -- Combinatorial Algorithms for Data Migration to Minimize Average Completion Time -- LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times -- Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees -- Improved Algorithms for Data Migration -- Approximation Algorithms for Graph Homomorphism Problems -- Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem -- Hardness of Preemptive Finite Capacity Dial-a-Ride -- Minimum Vehicle Routing with a Common Deadline -- Stochastic Combinatorial Optimization with Controllable Risk Aversion Level -- Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems -- Better Approximations for the Minimum Common Integer Partition Problem -- Contributed Talks of RANDOM -- On Pseudorandom Generators with Linear Stretch in NC0 -- A Fast Random Sampling Algorithm for Sparsifying Matrices -- The Effect of Boundary Conditions on Mixing Rates of Markov Chains -- Adaptive Sampling and Fast Low-Rank Matrix Approximation -- Robust Local Testability of Tensor Products of LDPC Codes -- Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods -- Dobrushin Conditions and Systematic Scan -- Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems -- Robust Mixing -- Approximating Average Parameters of Graphs -- Local Decoding and Testing for Homomorphisms -- Worst-Case Vs. Algorithmic Average-Case Complexity in the Polynomial-Time Hierarchy -- Randomness-Efficient Sampling Within NC 1 -- Monotone Circuits for the Majority Function -- Space Complexity vs. Query Complexity -- Consistency of Local Density Matrices Is QMA-Complete -- On Bounded Distance Decoding for General Lattices -- Threshold Functions for Asymmetric Ramsey Properties Involving Cliques -- Distance Approximation in Bounded-Degree and General Sparse Graphs -- Fractional Matching Via Balls-and-Bins -- A Randomized Solver for Linear Systems with Exponential Convergence -- Maintaining External Memory Efficient Hash Tables. |
|
|
|
|
|
|
|
|
|
|
|
|
|
2. |
Record Nr. |
UNINA9910697425403321 |
|
|
Autore |
Nelms David L |
|
|
Titolo |
Apparent chlorofluorocarbon age of ground water of the shallow aquifer system, Naval Weapons Station Yorktown, Yorktown, Virginia [[electronic resource] /] / by David L. Nelms, George E. Harlow, Jr., and Allen R. Brockman ; prepared in cooperation with Naval Weapons Station Yorktown, Base Civil Engineer, Environmental Directorate |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Richmond, Va. : , : U.S. Dept. of the Interior, U.S. Geological Survey, , 2001 |
|
|
|
|
|
|
|
|
|
Descrizione fisica |
|
6 unnumbered pages, 57 pages : digital, PDF file |
|
|
|
|
|
|
Collana |
|
Water-resources investigations report ; ; 01-4179 |
|
|
|
|
|
|
Altri autori (Persone) |
|
HarlowGeorge E |
BrockmanAllen R <1961-> (Allen Richard) |
|
|
|
|
|
|
|
|
Soggetti |
|
Chlorofluorocarbons - Environmental aspects - Virginia - Yorktown Region |
Groundwater flow - Virginia - Yorktown Region |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Title from title screen (viewed Sept. 4, 2008). |
|
|
|
|
|
|
|
|
|
|
|
|
|
3. |
Record Nr. |
UNINA9910357840603321 |
|
|
Titolo |
Theory of Cryptography : 17th International Conference, TCC 2019, Nuremberg, Germany, December 1–5, 2019, Proceedings, Part I / / edited by Dennis Hofheinz, Alon Rosen |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2019.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (611 pages) |
|
|
|
|
|
|
Collana |
|
Security and Cryptology, , 2946-1863 ; ; 11891 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Cryptography |
Data encryption (Computer science) |
Computer networks |
Application software |
Data structures (Computer science) |
Information theory |
Data protection |
Computers |
Cryptology |
Computer Communication Networks |
Computer and Information Systems Applications |
Data Structures and Information Theory |
Data and Information Security |
Computing Milieux |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
Algebraically Structured LWE, Revisited -- Lattice Trapdoors and IBE from Middle-Product LWE -- Matrix PRFs: Constructions, Attacks, and Applications to Obfuscation -- Obfuscated Fuzzy Hamming Distance and Conjunctions from Subset Product Problems -- A Black-Box Construction of Fully-Simulatable, Round-Optimal Oblivious Transfer from Strongly Uniform Key Agreement -- Synchronous Consensus with Optimal Asynchronous Fallback Guarantees -- Predicate Encryption |
|
|
|
|
|
|
|
|
|
|
|
from Bilinear Maps and One-Sided Probabilistic Rank -- Optimal Bounded-Collusion Secure Functional Encryption -- From FE Combiners to Secure MPC and Back -- (Pseudo) Random Quantum States with Binary Phase -- General Linear Group Action on Tensors: A Candidate for Post-Quantum Cryptography -- Composable and Finite Computational Security of Quantum Message Transmission -- On Fully Secure MPC with Solitary Output -- Secure Computation with Preprocessing via Function Secret Sharing -- Efficient Private PEZ Protocols for Symmetric Functions -- TheFunction-Inversion Problem: Barriers and Opportunities -- On the Complexity of Collision Resistant Hash Functions: New and Old Black-Box Separations -- Characterizing Collision and Second-Preimage Resistance in Linicrypt -- Efficient Information-Theoretic Secure Multiparty Computation over Z/pkZ via Galois Rings -- Is Information-Theoretic Topology-Hiding Computation Possible -- Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation -- On Perfectly Secure 2PC in the OT-Hybrid Model. |
|
|
|
|
|
|
Sommario/riassunto |
|
The two-volume set LNCS 11891 and 11892 constitutes the proceedings of the 17th International Conference on Theory of Cryptography, TCC 2019, held in Nuremberg, Germany, in December 2019. The 43 full papers presented were carefully reviewed and selected from 147 submissions. The Theory of Cryptography Conference deals with the paradigms, approaches, and techniques used to conceptualize natural cryptographic problems and provide algorithmic solutions to them and much more. |
|
|
|
|
|
|
|
| |