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.
Automata, Languages and Programming [[electronic resource] ] : 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part II / / edited by Michele Bugliesi, Bart Preneel, Vladimiro Sassone, Ingo Wegener
| Automata, Languages and Programming [[electronic resource] ] : 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part II / / edited by Michele Bugliesi, Bart Preneel, Vladimiro Sassone, Ingo Wegener |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XXIV, 612 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer programming Software engineering Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Theory of Computation Programming Techniques Software Engineering Discrete Mathematics in Computer Science Numerical Analysis Data Science |
| ISBN | 3-540-35908-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Differential Privacy -- The One Way to Quantum Computation -- Zero-Knowledge and Signatures -- Efficient Zero Knowledge on the Internet -- Independent Zero-Knowledge Sets -- An Efficient Compiler from ?-Protocol to 2-Move Deniable Zero-Knowledge -- New Extensions of Pairing-Based Signatures into Universal Designated Verifier Signatures -- Cryptographic Protocols -- Corrupting One vs. Corrupting Many: The Case of Broadcast and Multicast Encryption -- Cryptographically Sound Implementations for Communicating Processes -- A Dolev-Yao-Based Definition of Abuse-Free Protocols -- Secrecy and Protocol Analysis -- Preserving Secrecy Under Refinement -- Quantifying Information Leakage in Process Calculi -- Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or -- Cryptographic Primitives -- Generalized Compact Knapsacks Are Collision Resistant -- An Efficient Provable Distinguisher for HFE -- A Tight Bound for EMAC -- Constructing Single- and Multi-output Boolean Functions with Maximal Algebraic Immunity -- Bounded Storage and Quantum Models -- On Everlasting Security in the Hybrid Bounded Storage Model -- On the Impossibility of Extracting Classical Randomness Using a Quantum Computer -- Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding -- Foundations -- Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions -- Hardness of Distinguishing the MSB or LSB of Secret Keys in Diffie-Hellman Schemes -- A Probabilistic Hoare-style Logic for Game-Based Cryptographic Proofs -- Multi-party Protocols -- Generic Construction of Hybrid Public Key Traitor Tracing with Full-Public-Traceability -- An Adaptively Secure Mix-Net Without Erasures -- Multipartite Secret Sharing by Bivariate Interpolation -- Identity-Based Encryption Gone Wild -- Games -- Deterministic Priority Mean-Payoff Games as Limits of Discounted Games -- Recursive Concurrent Stochastic Games -- Half-Positional Determinacy of Infinite Games -- A Game-Theoretic Approach to Deciding Higher-Order Matching -- Semantics -- Descriptive and Relative Completeness of Logics for Higher-Order Functions -- Interpreting Polymorphic FPC into Domain Theoretic Models of Parametric Polymorphism -- Typed GoI for Exponentials -- Commutative Locative Quantifiers for Multiplicative Linear Logic -- Automata I -- The Wadge Hierarchy of Deterministic Tree Languages -- Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences -- On Complexity of Grammars Related to the Safety Problem -- Models -- Jumbo ?-Calculus -- ?-RBAC: Programming with Role-Based Access Control -- Communication of Two Stacks and Rewriting -- Equations -- On the Axiomatizability of Priority -- A Finite Equational Base for CCS with Left Merge and Communication Merge -- Theories of HNN-Extensions and Amalgamated Products -- On Intersection Problems for Polynomially Generated Sets -- Logics -- Invisible Safety of Distributed Protocols -- The Complexity of Enriched ?-Calculi -- Interpreting Tree-to-Tree Queries -- Automata II -- Constructing Exponential-Size Deterministic Zielonka Automata -- Flat Parametric Counter Automata -- Lower Bounds for Complementation of ?-Automata Via the Full Automata Technique. |
| Record Nr. | UNISA-996465856403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata, Languages and Programming [[electronic resource] ] : 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I / / edited by Michele Bugliesi, Bart Preneel, Vladimiro Sassone, Ingo Wegener
| Automata, Languages and Programming [[electronic resource] ] : 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I / / edited by Michele Bugliesi, Bart Preneel, Vladimiro Sassone, Ingo Wegener |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XXIV, 732 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Software engineering
Computer science Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Data structures (Computer science) Information theory Software Engineering Theory of Computation Discrete Mathematics in Computer Science Numerical Analysis Data Science Data Structures and Information Theory |
| ISBN | 3-540-35905-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Additive Approximation for Edge-Deletion Problems (Abstract) -- Graph Theory I -- Testing Graph Isomorphism in Parallel by Playing a Game -- The Spectral Gap of Random Graphs with Given Expected Degrees -- Embedding Bounded Bandwidth Graphs into ?1 -- On Counting Homomorphisms to Directed Acyclic Graphs -- Quantum Computing -- Fault-Tolerance Threshold for a Distance-Three Quantum Code -- Lower Bounds on Matrix Rigidity Via a Quantum Argument -- Self-testing of Quantum Circuits -- Deterministic Extractors for Independent-Symbol Sources -- Randomness -- Gap Amplification in PCPs Using Lazy Random Walks -- Stopping Times, Metrics and Approximate Counting -- Formal Languages -- Algebraic Characterization of the Finite Power Property -- P-completeness of Cellular Automaton Rule 110 -- Small Sweeping 2NFAs Are Not Closed Under Complement -- Expressive Power of Pebble Automata -- Approximation Algorithms I -- Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs -- Better Algorithms for Minimizing Average Flow-Time on Related Machines -- A Push-Relabel Algorithm for Approximating Degree Bounded MSTs -- Edge Disjoint Paths in Moderately Connected Graphs -- Approximation Algorithms II -- A Robust APTAS for the Classical Bin Packing Problem -- Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion -- Approximating the Orthogonal Knapsack Problem for Hypercubes -- Graph Algorithms I -- A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs -- Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems -- Weighted Bipartite Matching in Matrix Multiplication Time -- Algorithms I -- Optimal Resilient Sorting and Searching in the Presence of Memory Faults -- Reliable and Efficient Computational Geometry Via Controlled Perturbation -- Tight Bounds for Selfish and Greedy Load Balancing -- Complexity I -- Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies -- Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws -- The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies -- Data Structures and Linear Algebra -- Suffix Trays and Suffix Trists: Structures for Faster Text Indexing -- Optimal Lower Bounds for Rank and Select Indexes -- Dynamic Interpolation Search Revisited -- Dynamic Matrix Rank -- Graphs -- Nearly Optimal Visibility Representations of Plane Graphs -- Planar Crossing Numbers of Genus g Graphs -- How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover -- Tight Approximation Algorithm for Connectivity Augmentation Problems -- Complexity II -- On the Bipartite Unique Perfect Matching Problem -- Comparing Reductions to NP-Complete Sets -- Design Is as Easy as Optimization -- On the Complexity of 2D Discrete Fixed Point Problem -- Game Theory I -- Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions -- The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games -- Network Games with Atomic Players -- Algorithms II -- Finite-State Dimension and Real Arithmetic -- Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings -- The Myriad Virtues of Wavelet Trees -- Game Theory II -- Atomic Congestion Games Among Coalitions -- Computing Equilibrium Prices in Exchange Economies with Tax Distortions -- New Constructions of Mechanisms with Verification -- Networks, Circuits and Regular Expressions -- On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations -- Dynamic Routing Schemes for General Graphs -- Energy Complexity and Entropy of Threshold Circuits -- New Algorithms for Regular Expression Matching -- Fixed Parameter Complexity and Approximation Algorithms -- A Parameterized View on Matroid Optimization Problems -- Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction -- Length-Bounded Cuts and Flows -- Graph Algorithms II -- An Adaptive Spectral Heuristic for Partitioning Random Graphs -- Some Results on Matchgates and Holographic Algorithms -- Weighted Popular Matchings. |
| Record Nr. | UNISA-996465854903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||