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] ] : 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 | ||
| ||
Transactions on Computational Systems Biology VII [[electronic resource] /] / edited by Anna Ingolfsdottir, Bud Mishra, Hanne Riis Nielson
| Transactions on Computational Systems Biology VII [[electronic resource] /] / edited by Anna Ingolfsdottir, Bud Mishra, Hanne Riis Nielson |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (VII, 187 p.) |
| Disciplina | 004.0151 |
| Collana | Transactions on Computational Systems Biology |
| Soggetto topico |
Computers
Bioinformatics Mathematical logic Algorithms Computation by Abstract Devices Mathematical Logic and Formal Languages Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-48839-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Modelling the Influence of RKIP on the ERK Signalling Pathway Using the Stochastic Process Algebra PEPA -- Gene Regulation in the Pi Calculus: Simulating Cooperativity at the Lambda Switch -- From Logical Regulatory Graphs to Standard Petri Nets: Dynamical Roles and Functionality of Feedback Circuits -- Translating SBML Models into the Stochastic ?-Calculus for Stochastic Simulation -- Graph Theory for Rule-Based Modeling of Biochemical Networks -- Adapting Biochemical Kripke Structures for Distributed Model Checking -- A Graphical Representation for Biological Processes in the Stochastic pi-Calculus -- On Differentiation and Homeostatic Behaviours of Boolean Dynamical Systems -- A Specification Language and a Framework for the Execution of Composite Models in Systems Biology -- A Specification Language and a Framework for the Execution of Composite Models in Systems Biology. |
| Record Nr. | UNISA-996466157503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||