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] ] : 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011. Proceedings, Part I / / edited by Luca Aceto, Monika Henzinger, Jiří Sgall
| Automata, Languages and Programming [[electronic resource] ] : 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011. Proceedings, Part I / / edited by Luca Aceto, Monika Henzinger, Jiří Sgall |
| Edizione | [1st ed. 2011.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
| Descrizione fisica | 1 online resource (XXIV, 802 p. 59 illus., 8 illus. in color.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science Computer networks Information storage and retrieval systems Computer science—Mathematics Discrete mathematics Theory of Computation Computer Communication Networks Information Storage and Retrieval Discrete Mathematics in Computer Science |
| ISBN | 3-642-22006-1 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465542503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata, Languages and Programming [[electronic resource] ] : 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2010. Proceedings, Part II / / edited by Luca Aceto, Monika Henzinger, Jiri Sgall
| Automata, Languages and Programming [[electronic resource] ] : 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2010. Proceedings, Part II / / edited by Luca Aceto, Monika Henzinger, Jiri Sgall |
| Edizione | [1st ed. 2011.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
| Descrizione fisica | 1 online resource (XXVI, 666 p.) |
| Disciplina | 005.1015113 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Software engineering Machine theory Computer networks Algorithms Computer Science Logic and Foundations of Programming Software Engineering Formal Languages and Automata Theory Computer Communication Networks Theory of Computation |
| ISBN | 3-642-22012-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465552603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata, Languages and Programming [[electronic resource] ] : 35th International Colloquium, ICALP 2008 Reykjavik, Iceland, July 7-11, 2008 Proceedings, Part I / / edited by Luca Aceto, Ivan Damgaard, Leslie Ann Goldberg, Magnus M. Halldorsson, Anna Ingolfsdottir, Igor Walukiewicz
| Automata, Languages and Programming [[electronic resource] ] : 35th International Colloquium, ICALP 2008 Reykjavik, Iceland, July 7-11, 2008 Proceedings, Part I / / edited by Luca Aceto, Ivan Damgaard, Leslie Ann Goldberg, Magnus M. Halldorsson, Anna Ingolfsdottir, Igor Walukiewicz |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XXIII, 896 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Software engineering
Computer programming Computer science Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Software Engineering Programming Techniques Theory of Computation Discrete Mathematics in Computer Science Numerical Analysis Data Science |
| ISBN | 3-540-70575-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects -- Internet Ad Auctions: Insights and Directions -- Track A: Algorithms, Automata, Complexity, and Games -- The Complexity of Boolean Formula Minimization -- Optimal Cryptographic Hardness of Learning Monotone Functions -- On Berge Multiplication for Monotone Boolean Dualization -- Diagonal Circuit Identity Testing and Lower Bounds -- Cell-Probe Proofs and Nondeterministic Cell-Probe Complexity -- Constructing Efficient Dictionaries in Close to Sorting Time -- On List Update with Locality of Reference -- A New Combinatorial Approach for Sparse Graph Problems -- How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs) -- Networks Become Navigable as Nodes Move and Forget -- Fast Distributed Computation of Cuts Via Random Circulations -- Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time -- Function Evaluation Via Linear Programming in the Priced Information Model -- Improved Approximation Algorithms for Budgeted Allocations -- The Travelling Salesman Problem in Bounded Degree Graphs -- Treewidth Computation and Extremal Combinatorics -- Fast Scheduling of Weighted Unit Jobs with Release Times and Deadlines -- Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2 -- A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation -- Optimal Monotone Encodings -- Polynomial-Time Construction of Linear Network Coding -- Complexity of Decoding Positive-Rate Reed-Solomon Codes -- Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract) -- The Randomized Coloring Procedure with Symmetry-Breaking -- The Local Nature of List Colorings for Graphs of High Girth -- Approximating List-Coloring on a Fixed Surface -- Asymptotically Optimal Hitting Sets Against Polynomials -- The Smoothed Complexity of Edit Distance -- Randomized Self-assembly for Approximate Shapes -- Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract) -- Competitive Weighted Matching in Transversal Matroids -- Scheduling for Speed Bounded Processors -- Faster Algorithms for Incremental Topological Ordering -- Dynamic Normal Forms and Dynamic Characteristic Polynomial -- Algorithms for ?-Approximations of Terrains -- An Approximation Algorithm for Binary Searching in Trees -- Algorithms for 2-Route Cut Problems -- The Two-Edge Connectivity Survivable Network Problem in Planar Graphs -- Efficiently Testing Sparse GF(2) Polynomials -- Testing Properties of Sets of Points in Metric Spaces -- An Expansion Tester for Bounded Degree Graphs -- Property Testing on k-Vertex-Connectivity of Graphs -- Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract) -- On Problems without Polynomial Kernels (Extended Abstract) -- Faster Algebraic Algorithms for Path and Packing Problems -- Understanding the Complexity of Induced Subgraph Isomorphisms -- Spanners in Sparse Graphs -- Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error -- All-Pairs Shortest Paths with a Sublinear Additive Error -- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations -- The Complexity of the Counting Constraint Satisfaction Problem -- On the Hardness of Losing Weight -- Product Theorems Via Semidefinite Programming -- Sound 3-Query PCPPs Are Long -- Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations -- Recursive Stochastic Games with Positive Rewards -- Complementation, Disambiguation, and Determinization of Büchi Automata Unified -- Tree Projections: Hypergraph Games and Minimality -- Explicit Non-adaptive Combinatorial Group Testing Schemes -- Tight Lower Bounds for Multi-pass Stream Computation Via Pass Elimination -- Impossibility of a Quantum Speed-Up with a Faulty Oracle -- Superpolynomial Speedups Based on Almost Any Quantum Circuit -- The Speed of Convergence in Congestion Games under Best-Response Dynamics -- Uniform Budgets and the Envy-Free Pricing Problem -- Bayesian Combinatorial Auctions -- Truthful Unification Framework for Packing Integer Programs with Choices -- Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing -- Finding Optimal Flows Efficiently -- Optimal Quantum Adversary Lower Bounds for Ordered Search -- Quantum SAT for a Qutrit-Cinquit Pair Is QMA 1-Complete -- Superpolynomial Speedups Based on Almost Any Quantum Circuit. |
| Record Nr. | UNISA-996465917103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata, Languages and Programming [[electronic resource] ] : 35th International Colloquium, ICALP 2008 Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II / / edited by Luca Aceto, Ivan Damgaard, Leslie Ann Goldberg, Magnus M. Halldorsson, Anna Ingolfsdottir, Igor Walukiewicz
| Automata, Languages and Programming [[electronic resource] ] : 35th International Colloquium, ICALP 2008 Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II / / edited by Luca Aceto, Ivan Damgaard, Leslie Ann Goldberg, Magnus M. Halldorsson, Anna Ingolfsdottir, Igor Walukiewicz |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XXII, 734 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Software engineering
Computer programming Computer science Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Software Engineering Programming Techniques Theory of Computation Discrete Mathematics in Computer Science Numerical Analysis Data Science |
| ISBN | 3-540-70583-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Composable Formal Security Analysis: Juggling Soundness, Simplicity and Efficiency -- Newton’s Method for ?-Continuous Semirings -- Track B: Logic, Semantics, and Theory of Programming -- The Tractability Frontier for NFA Minimization -- Finite Automata, Digraph Connectivity, and Regular Expression Size -- Leftist Grammars Are Non-primitive Recursive -- On the Computational Completeness of Equations over Sets of Natural Numbers -- Placement Inference for a Client-Server Calculus -- Extended pi-Calculi -- Completeness and Logical Full Abstraction in Modal Logics for Typed Mobile Processes -- On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases -- On Expressiveness and Complexity in Real-Time Model Checking -- STORMED Hybrid Systems -- Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives -- On Datalog vs. LFP -- Directed st-Connectivity Is Not Expressible in Symmetric Datalog -- Non-dichotomies in Constraint Satisfaction Complexity -- Quantified Constraint Satisfaction and the Polynomially Generated Powers Property -- When Does Partial Commutative Closure Preserve Regularity? -- Weighted Logics for Nested Words and Algebraic Formal Power Series -- Tree Languages Defined in First-Order Logic with One Quantifier Alternation -- Duality and Equational Theory of Regular Languages -- Reversible Flowchart Languages and the Structured Reversible Program Theorem -- Attribute Grammars and Categorical Semantics -- A Domain Theoretic Model of Qubit Channels -- Interacting Quantum Observables -- Perpetuality for Full and Safe Composition (in a Constructive Setting) -- A System F with Call-by-Name Exceptions -- Linear Logical Algorithms -- A Simple Model of Separation Logic for Higher-Order Store -- Open Implication -- ATL* Satisfiability Is 2EXPTIME-Complete -- Visibly Pushdown Transducers -- The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata -- Analyzing Context-Free Grammars Using an Incremental SAT Solver -- Track C: Security and Cryptography Foundations -- Weak Pseudorandom Functions in Minicrypt -- On Black-Box Ring Extraction and Integer Factorization -- Extractable Perfectly One-Way Functions -- Error-Tolerant Combiners for Oblivious Primitives -- Asynchronous Multi-Party Computation with Quadratic Communication -- Improved Garbled Circuit: Free XOR Gates and Applications -- Improving the Round Complexity of VSS in Point-to-Point Networks -- How to Protect Yourself without Perfect Shredding -- Universally Composable Undeniable Signature -- Interactive PCP -- Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model -- Delegating Capabilities in Predicate Encryption Systems -- Bounded Ciphertext Policy Attribute Based Encryption -- Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks -- Composable Security in the Bounded-Quantum-Storage Model -- On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak -- History-Independent Cuckoo Hashing -- Building a Collision-Resistant Compression Function from Non-compressing Primitives -- Robust Multi-property Combiners for Hash Functions Revisited -- Homomorphic Encryption with CCA Security -- How to Encrypt with the LPN Problem -- Could SFLASH be Repaired? -- Password Mistyping in Two-Factor-Authenticated Key Exchange -- Affiliation-Hiding Envelope and Authentication Schemes with Efficient Support for Multiple Credentials. |
| Record Nr. | UNISA-996465909503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata, Languages and Programming : 35th International Colloquium, ICALP 2008 Reykjavik, Iceland, July 7-11, 2008 Proceedings, Part I / / edited by Luca Aceto, Ivan Damgaard, Leslie Ann Goldberg, Magnus M. Halldorsson, Anna Ingolfsdottir, Igor Walukiewicz
| Automata, Languages and Programming : 35th International Colloquium, ICALP 2008 Reykjavik, Iceland, July 7-11, 2008 Proceedings, Part I / / edited by Luca Aceto, Ivan Damgaard, Leslie Ann Goldberg, Magnus M. Halldorsson, Anna Ingolfsdottir, Igor Walukiewicz |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XXIII, 896 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Software engineering
Computer programming Computer science Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Software Engineering Programming Techniques Theory of Computation Discrete Mathematics in Computer Science Numerical Analysis Data Science |
| ISBN | 3-540-70575-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects -- Internet Ad Auctions: Insights and Directions -- Track A: Algorithms, Automata, Complexity, and Games -- The Complexity of Boolean Formula Minimization -- Optimal Cryptographic Hardness of Learning Monotone Functions -- On Berge Multiplication for Monotone Boolean Dualization -- Diagonal Circuit Identity Testing and Lower Bounds -- Cell-Probe Proofs and Nondeterministic Cell-Probe Complexity -- Constructing Efficient Dictionaries in Close to Sorting Time -- On List Update with Locality of Reference -- A New Combinatorial Approach for Sparse Graph Problems -- How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs) -- Networks Become Navigable as Nodes Move and Forget -- Fast Distributed Computation of Cuts Via Random Circulations -- Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time -- Function Evaluation Via Linear Programming in the Priced Information Model -- Improved Approximation Algorithms for Budgeted Allocations -- The Travelling Salesman Problem in Bounded Degree Graphs -- Treewidth Computation and Extremal Combinatorics -- Fast Scheduling of Weighted Unit Jobs with Release Times and Deadlines -- Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2 -- A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation -- Optimal Monotone Encodings -- Polynomial-Time Construction of Linear Network Coding -- Complexity of Decoding Positive-Rate Reed-Solomon Codes -- Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract) -- The Randomized Coloring Procedure with Symmetry-Breaking -- The Local Nature of List Colorings for Graphs of High Girth -- Approximating List-Coloring on a Fixed Surface -- Asymptotically Optimal Hitting Sets Against Polynomials -- The Smoothed Complexity of Edit Distance -- Randomized Self-assembly for Approximate Shapes -- Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract) -- Competitive Weighted Matching in Transversal Matroids -- Scheduling for Speed Bounded Processors -- Faster Algorithms for Incremental Topological Ordering -- Dynamic Normal Forms and Dynamic Characteristic Polynomial -- Algorithms for ?-Approximations of Terrains -- An Approximation Algorithm for Binary Searching in Trees -- Algorithms for 2-Route Cut Problems -- The Two-Edge Connectivity Survivable Network Problem in Planar Graphs -- Efficiently Testing Sparse GF(2) Polynomials -- Testing Properties of Sets of Points in Metric Spaces -- An Expansion Tester for Bounded Degree Graphs -- Property Testing on k-Vertex-Connectivity of Graphs -- Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract) -- On Problems without Polynomial Kernels (Extended Abstract) -- Faster Algebraic Algorithms for Path and Packing Problems -- Understanding the Complexity of Induced Subgraph Isomorphisms -- Spanners in Sparse Graphs -- Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error -- All-Pairs Shortest Paths with a Sublinear Additive Error -- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations -- The Complexity of the Counting Constraint Satisfaction Problem -- On the Hardness of Losing Weight -- Product Theorems Via Semidefinite Programming -- Sound 3-Query PCPPs Are Long -- Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations -- Recursive Stochastic Games with Positive Rewards -- Complementation, Disambiguation, and Determinization of Büchi Automata Unified -- Tree Projections: Hypergraph Games and Minimality -- Explicit Non-adaptive Combinatorial Group Testing Schemes -- Tight Lower Bounds for Multi-pass Stream Computation Via Pass Elimination -- Impossibility of a Quantum Speed-Up with a Faulty Oracle -- Superpolynomial Speedups Based on Almost Any Quantum Circuit -- The Speed of Convergence in Congestion Games under Best-Response Dynamics -- Uniform Budgets and the Envy-Free Pricing Problem -- Bayesian Combinatorial Auctions -- Truthful Unification Framework for Packing Integer Programs with Choices -- Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing -- Finding Optimal Flows Efficiently -- Optimal Quantum Adversary Lower Bounds for Ordered Search -- Quantum SAT for a Qutrit-Cinquit Pair Is QMA 1-Complete -- Superpolynomial Speedups Based on Almost Any Quantum Circuit. |
| Record Nr. | UNINA-9910484200803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automata, languages and programming : 35th international colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008 : proceedings, part II / / Luca Aceto ... [et al.] (eds.)
| Automata, languages and programming : 35th international colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008 : proceedings, part II / / Luca Aceto ... [et al.] (eds.) |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2008 |
| Descrizione fisica | 1 online resource (XXII, 734 p.) |
| Disciplina | 005.1 |
| Altri autori (Persone) | AcetoLuca |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Machine theory
Formal languages Computer programming |
| ISBN | 3-540-70583-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Composable Formal Security Analysis: Juggling Soundness, Simplicity and Efficiency -- Newton’s Method for ?-Continuous Semirings -- Track B: Logic, Semantics, and Theory of Programming -- The Tractability Frontier for NFA Minimization -- Finite Automata, Digraph Connectivity, and Regular Expression Size -- Leftist Grammars Are Non-primitive Recursive -- On the Computational Completeness of Equations over Sets of Natural Numbers -- Placement Inference for a Client-Server Calculus -- Extended pi-Calculi -- Completeness and Logical Full Abstraction in Modal Logics for Typed Mobile Processes -- On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases -- On Expressiveness and Complexity in Real-Time Model Checking -- STORMED Hybrid Systems -- Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives -- On Datalog vs. LFP -- Directed st-Connectivity Is Not Expressible in Symmetric Datalog -- Non-dichotomies in Constraint Satisfaction Complexity -- Quantified Constraint Satisfaction and the Polynomially Generated Powers Property -- When Does Partial Commutative Closure Preserve Regularity? -- Weighted Logics for Nested Words and Algebraic Formal Power Series -- Tree Languages Defined in First-Order Logic with One Quantifier Alternation -- Duality and Equational Theory of Regular Languages -- Reversible Flowchart Languages and the Structured Reversible Program Theorem -- Attribute Grammars and Categorical Semantics -- A Domain Theoretic Model of Qubit Channels -- Interacting Quantum Observables -- Perpetuality for Full and Safe Composition (in a Constructive Setting) -- A System F with Call-by-Name Exceptions -- Linear Logical Algorithms -- A Simple Model of Separation Logic for Higher-Order Store -- Open Implication -- ATL* Satisfiability Is 2EXPTIME-Complete -- Visibly Pushdown Transducers -- The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata -- Analyzing Context-Free Grammars Using an Incremental SAT Solver -- Track C: Security and Cryptography Foundations -- Weak Pseudorandom Functions in Minicrypt -- On Black-Box Ring Extraction and Integer Factorization -- Extractable Perfectly One-Way Functions -- Error-Tolerant Combiners for Oblivious Primitives -- Asynchronous Multi-Party Computation with Quadratic Communication -- Improved Garbled Circuit: Free XOR Gates and Applications -- Improving the Round Complexity of VSS in Point-to-Point Networks -- How to Protect Yourself without Perfect Shredding -- Universally Composable Undeniable Signature -- Interactive PCP -- Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model -- Delegating Capabilities in Predicate Encryption Systems -- Bounded Ciphertext Policy Attribute Based Encryption -- Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks -- Composable Security in the Bounded-Quantum-Storage Model -- On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak -- History-Independent Cuckoo Hashing -- Building a Collision-Resistant Compression Function from Non-compressing Primitives -- Robust Multi-property Combiners for Hash Functions Revisited -- Homomorphic Encryption with CCA Security -- How to Encrypt with the LPN Problem -- Could SFLASH be Repaired? -- Password Mistyping in Two-Factor-Authenticated Key Exchange -- Affiliation-Hiding Envelope and Authentication Schemes with Efficient Support for Multiple Credentials. |
| Altri titoli varianti | ICALP 2008 |
| Record Nr. | UNINA-9910768462603321 |
| Berlin, : Springer, 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Foundations of software science and computation structures : 9th international conference, FOSSACS 2006, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25-31, 2006 : proceedings / / Luca Aceto, Anna Ingolfsdottir (eds.)
| Foundations of software science and computation structures : 9th international conference, FOSSACS 2006, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25-31, 2006 : proceedings / / Luca Aceto, Anna Ingolfsdottir (eds.) |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2006 |
| Descrizione fisica | 1 online resource (XV, 447 p.) |
| Disciplina | 005.3 |
| Altri autori (Persone) |
AcetoLuca
Anna Ingolfsdottir <1952-> |
| Collana | Lecture notes in computer science |
| Soggetto topico | System analysis |
| ISBN | 3-540-33046-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk -- On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation -- Mobile Processes -- A Theory for Observational Fault Tolerance -- Smooth Orchestrators -- On the Relative Expressive Power of Asynchronous Communication Primitives -- More on Bisimulations for Higher Order ?-Calculus -- Software Science -- Register Allocation After Classical SSA Elimination is NP-Complete -- A Logic of Reachable Patterns in Linked Data-Structures -- Distributed Computation -- Dynamic Policy Discovery with Remote Attestation -- Distributed Unfolding of Petri Nets -- On the ?-Calculus Augmented with Sabotage -- Categorical Models -- A Finite Model Construction for Coalgebraic Modal Logic -- Presenting Functors by Operations and Equations -- Bigraphical Models of Context-Aware Systems -- Processes for Adhesive Rewriting Systems -- Real Time and Hybrid Systems -- On Metric Temporal Logic and Faulty Turing Machines -- Denotational Semantics of Hybrid Automata -- Process Calculi -- Reversing Algebraic Process Calculi -- Conjunction on Processes: Full–Abstraction Via Ready–Tree Semantics -- Undecidability Results for Bisimilarity on Prefix Rewrite Systems -- Automata and Logic -- Propositional Dynamic Logic with Recursive Programs -- A Semantic Approach to Interpolation -- First-Order and Counting Theories of ?-Automatic Structures -- Parity Games Played on Transition Graphs of One-Counter Processes -- Domains, Lambda Calculus, Types -- Bidomains and Full Abstraction for Countable Nondeterminism -- An Operational Characterization of Strong Normalization -- On the Confluence of ?-Calculus with Conditional Rewriting -- Security -- Guessing Attacks and the Computational Soundness of Static Equivalence -- Handling exp,× (and Timestamps) in Protocol Analysis -- Symbolic and Cryptographic Analysis of the Secure WS-ReliableMessaging Scenario. |
| Altri titoli varianti |
FOSSACS 2006
ETAPS 2006 Joint European Conferences on Theory and Practice of Software |
| Record Nr. | UNINA-9910484175603321 |
| Berlin ; ; New York, : Springer, c2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Foundations of Software Science and Computational Structures [[electronic resource] ] : 9th International Conference, FOSSACS 2006, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25-31, 2006, Proceedings / / edited by Luca Aceto, Anna Ingólfsdóttir
| Foundations of Software Science and Computational Structures [[electronic resource] ] : 9th International Conference, FOSSACS 2006, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25-31, 2006, Proceedings / / edited by Luca Aceto, Anna Ingólfsdóttir |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XV, 447 p.) |
| Disciplina | 005.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Software engineering Machine theory Compilers (Computer programs) Theory of Computation Software Engineering Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Compilers and Interpreters |
| ISBN | 3-540-33046-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk -- On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation -- Mobile Processes -- A Theory for Observational Fault Tolerance -- Smooth Orchestrators -- On the Relative Expressive Power of Asynchronous Communication Primitives -- More on Bisimulations for Higher Order ?-Calculus -- Software Science -- Register Allocation After Classical SSA Elimination is NP-Complete -- A Logic of Reachable Patterns in Linked Data-Structures -- Distributed Computation -- Dynamic Policy Discovery with Remote Attestation -- Distributed Unfolding of Petri Nets -- On the ?-Calculus Augmented with Sabotage -- Categorical Models -- A Finite Model Construction for Coalgebraic Modal Logic -- Presenting Functors by Operations and Equations -- Bigraphical Models of Context-Aware Systems -- Processes for Adhesive Rewriting Systems -- Real Time and Hybrid Systems -- On Metric Temporal Logic and Faulty Turing Machines -- Denotational Semantics of Hybrid Automata -- Process Calculi -- Reversing Algebraic Process Calculi -- Conjunction on Processes: Full–Abstraction Via Ready–Tree Semantics -- Undecidability Results for Bisimilarity on Prefix Rewrite Systems -- Automata and Logic -- Propositional Dynamic Logic with Recursive Programs -- A Semantic Approach to Interpolation -- First-Order and Counting Theories of ?-Automatic Structures -- Parity Games Played on Transition Graphs of One-Counter Processes -- Domains, Lambda Calculus, Types -- Bidomains and Full Abstraction for Countable Nondeterminism -- An Operational Characterization of Strong Normalization -- On the Confluence of ?-Calculus with Conditional Rewriting -- Security -- Guessing Attacks and the Computational Soundness of Static Equivalence -- Handling exp,× (and Timestamps) in Protocol Analysis -- Symbolic and Cryptographic Analysis of the Secure WS-ReliableMessaging Scenario. |
| Record Nr. | UNISA-996466133503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Models, Algorithms, Logics and Tools [[electronic resource] ] : Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday / / edited by Luca Aceto, Giorgio Bacci, Giovanni Bacci, Anna Ingólfsdóttir, Axel Legay, Radu Mardare
| Models, Algorithms, Logics and Tools [[electronic resource] ] : Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday / / edited by Luca Aceto, Giorgio Bacci, Giovanni Bacci, Anna Ingólfsdóttir, Axel Legay, Radu Mardare |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XVII, 662 p. 184 illus.) |
| Disciplina | 003.54 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Software engineering Computer simulation Compilers (Computer programs) Artificial intelligence Computer engineering Computer networks Theory of Computation Software Engineering Computer Modelling Compilers and Interpreters Artificial Intelligence Computer Engineering and Networks |
| ISBN | 3-319-63121-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Information Flow for Timed Automata -- A Nivat Theorem for Quantitative Automata on Unranked Trees -- 30 Years of Modal Transition Systems: Survey of Extensions and Analysis -- Derivatives of Quantitative Regular Expressions -- Improving the Timed Automata Approach to Biological Pathway Dynamics -- Bicategories of Markov Processes -- Property-Preserving Parallel Decomposition -- A Generic Algorithm for Learning Symbolic Automata from Membership Queries -- Teaching Academic Concurrency to Amazing Students -- Negative Results on Decidability and Small Model Property of Process Equations -- Timed Temporal Logics -- Synchronous Interfaces and Assume/Guarantee Contracts -- From Transition Systems to Variability Models & From Lifted Model Checking Back to UPPAAL -- Firm Deadline Checking of Safety-Critical Java Applications with Statistical Model Checking -- Symbolic Verification and Strategy Synthesis for Linearly-Priced Probabilistic Timed Automata -- Runtime Verification Logics - A Language Design Perspective -- Testing Divergent Transition Systems -- The Cost of Exactness in Quantitative Reachability -- Towards Automated Variant Selection for HeterogeneousTiled Architectures -- Admissible Strategies in Timed Games -- Modal Stochastic Games: Abstraction-Refinement of Probabilistic Automata -- A Coinductive Equational Characterisation of Trace Inclusion for Regular Processes -- Syntactic Markovian Bisimulation for Chemical Reaction Networks -- Assertion-Based Reasoning Method for Calculus of Wireless System -- Taming Living Logic Using Formal Methods -- Comparing Source Sets and Persistent Sets for Partial Order Reduction -- A Framework for Evaluating Schedulability Analysis Tools -- WUPPAAL: Computation of Worst-Case Execution-Time for Binary Programs with UPPAAL -- Centrally Governed Blockchains: Optimizing Security, Cost, and Availability -- Energy Consumption Forecast of Photo-Voltaic Comfort Cooling Using UPPAAL Stratego -- Towards a Tool: TIMES-Pro for Modeling, Analysis, Simulation and Implementation of Cyber-Physical Systems -- Formalising a Hazard Warning Communication Protocol with Timed Automata. |
| Record Nr. | UNISA-996466314303316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Models, Algorithms, Logics and Tools : Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday / / edited by Luca Aceto, Giorgio Bacci, Giovanni Bacci, Anna Ingólfsdóttir, Axel Legay, Radu Mardare
| Models, Algorithms, Logics and Tools : Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday / / edited by Luca Aceto, Giorgio Bacci, Giovanni Bacci, Anna Ingólfsdóttir, Axel Legay, Radu Mardare |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XVII, 662 p. 184 illus.) |
| Disciplina | 003.54 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Software engineering Computer simulation Compilers (Computer programs) Artificial intelligence Computer engineering Computer networks Theory of Computation Software Engineering Computer Modelling Compilers and Interpreters Artificial Intelligence Computer Engineering and Networks |
| ISBN | 3-319-63121-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Information Flow for Timed Automata -- A Nivat Theorem for Quantitative Automata on Unranked Trees -- 30 Years of Modal Transition Systems: Survey of Extensions and Analysis -- Derivatives of Quantitative Regular Expressions -- Improving the Timed Automata Approach to Biological Pathway Dynamics -- Bicategories of Markov Processes -- Property-Preserving Parallel Decomposition -- A Generic Algorithm for Learning Symbolic Automata from Membership Queries -- Teaching Academic Concurrency to Amazing Students -- Negative Results on Decidability and Small Model Property of Process Equations -- Timed Temporal Logics -- Synchronous Interfaces and Assume/Guarantee Contracts -- From Transition Systems to Variability Models & From Lifted Model Checking Back to UPPAAL -- Firm Deadline Checking of Safety-Critical Java Applications with Statistical Model Checking -- Symbolic Verification and Strategy Synthesis for Linearly-Priced Probabilistic Timed Automata -- Runtime Verification Logics - A Language Design Perspective -- Testing Divergent Transition Systems -- The Cost of Exactness in Quantitative Reachability -- Towards Automated Variant Selection for HeterogeneousTiled Architectures -- Admissible Strategies in Timed Games -- Modal Stochastic Games: Abstraction-Refinement of Probabilistic Automata -- A Coinductive Equational Characterisation of Trace Inclusion for Regular Processes -- Syntactic Markovian Bisimulation for Chemical Reaction Networks -- Assertion-Based Reasoning Method for Calculus of Wireless System -- Taming Living Logic Using Formal Methods -- Comparing Source Sets and Persistent Sets for Partial Order Reduction -- A Framework for Evaluating Schedulability Analysis Tools -- WUPPAAL: Computation of Worst-Case Execution-Time for Binary Programs with UPPAAL -- Centrally Governed Blockchains: Optimizing Security, Cost, and Availability -- Energy Consumption Forecast of Photo-Voltaic Comfort Cooling Using UPPAAL Stratego -- Towards a Tool: TIMES-Pro for Modeling, Analysis, Simulation and Implementation of Cyber-Physical Systems -- Formalising a Hazard Warning Communication Protocol with Timed Automata. |
| Record Nr. | UNINA-9910484651003321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||