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.
FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science [[electronic resource] ] : 22nd Conference Kanpur, India, December 12-14, 2002, Proceedings / / edited by Manindra Agrawal, Anil Seth
| FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science [[electronic resource] ] : 22nd Conference Kanpur, India, December 12-14, 2002, Proceedings / / edited by Manindra Agrawal, Anil Seth |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (XII, 368 p.) |
| Disciplina | 005.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computers Computer logic Programming languages (Electronic computers) Algorithms Software Engineering/Programming and Operating Systems Theory of Computation Logics and Meanings of Programs Programming Languages, Compilers, Interpreters Computation by Abstract Devices Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-36206-1 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Primality Testing with Gaussian Periods -- From Hilbert Spaces to Dilbert Spaces: Context Semantics Made Simple -- Encoding Generic Judgments -- Model Checking Algol-Like Languages Using Game Semantics -- Modeling Software: From Theory to Practice -- Contributed Papers -- Local Normal Forms for Logics over Traces -- On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality -- Communication Interference in Mobile Boxed Ambients -- The Seal Calculus Revisited: Contextual Equivalence and Bisimilarity -- Composing Strand Spaces -- Generalising Automaticity to Modal Properties of Finite Structures -- An Automata-Theoretic Approach to Constraint LTL -- Hardness Results for Multicast Cost Sharing -- How to Compose Presburger-Accelerations: Applications to Broadcast Protocols -- State Space Reductions for Alternating Büchi Automata Quotienting by Simulation Equivalences -- Algorithmic Combinatorics Based on Slicing Posets -- Pattern Matching for Arc-Annotated Sequences -- Knowledge over Dense Flows of Time (from a Hybrid Point of View) -- The Complexity of the Inertia -- The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version -- The Decidability of the First-Order Theory of the Knuth-Bendix Order in the Case of Unary Signatures -- Deciding the First Level of the ?-Calculus Alternation Hierarchy -- Dynamic Message Sequence Charts -- The Complexity of Compositions of Deterministic Tree Transducers -- On the Hardness of Approximating Minimum Monopoly Problems -- Hereditary History Preserving Bisimulation Is Decidable for Trace-Labelled Systems -- Lower Bounds for Embedding Graphs into Graphs of Smaller Characteristic -- Nearest Neighbors Search Using Point Location in Balls with Applications to Approximate Voronoi Decompositions -- Formal Languages and Algorithms for Similarity Based Retrieval from Sequence Databases -- Decomposition in Asynchronous Circuit Design -- Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing. |
| Record Nr. | UNISA-996465636603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science : 22nd Conference Kanpur, India, December 12-14, 2002, Proceedings / / edited by Manindra Agrawal, Anil Seth
| FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science : 22nd Conference Kanpur, India, December 12-14, 2002, Proceedings / / edited by Manindra Agrawal, Anil Seth |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (XII, 368 p.) |
| Disciplina | 005.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computers Computer logic Programming languages (Electronic computers) Algorithms Software Engineering/Programming and Operating Systems Theory of Computation Logics and Meanings of Programs Programming Languages, Compilers, Interpreters Computation by Abstract Devices Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-36206-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Primality Testing with Gaussian Periods -- From Hilbert Spaces to Dilbert Spaces: Context Semantics Made Simple -- Encoding Generic Judgments -- Model Checking Algol-Like Languages Using Game Semantics -- Modeling Software: From Theory to Practice -- Contributed Papers -- Local Normal Forms for Logics over Traces -- On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality -- Communication Interference in Mobile Boxed Ambients -- The Seal Calculus Revisited: Contextual Equivalence and Bisimilarity -- Composing Strand Spaces -- Generalising Automaticity to Modal Properties of Finite Structures -- An Automata-Theoretic Approach to Constraint LTL -- Hardness Results for Multicast Cost Sharing -- How to Compose Presburger-Accelerations: Applications to Broadcast Protocols -- State Space Reductions for Alternating Büchi Automata Quotienting by Simulation Equivalences -- Algorithmic Combinatorics Based on Slicing Posets -- Pattern Matching for Arc-Annotated Sequences -- Knowledge over Dense Flows of Time (from a Hybrid Point of View) -- The Complexity of the Inertia -- The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version -- The Decidability of the First-Order Theory of the Knuth-Bendix Order in the Case of Unary Signatures -- Deciding the First Level of the ?-Calculus Alternation Hierarchy -- Dynamic Message Sequence Charts -- The Complexity of Compositions of Deterministic Tree Transducers -- On the Hardness of Approximating Minimum Monopoly Problems -- Hereditary History Preserving Bisimulation Is Decidable for Trace-Labelled Systems -- Lower Bounds for Embedding Graphs into Graphs of Smaller Characteristic -- Nearest Neighbors Search Using Point Location in Balls with Applications to Approximate Voronoi Decompositions -- Formal Languages and Algorithms for Similarity Based Retrieval from Sequence Databases -- Decomposition in Asynchronous Circuit Design -- Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing. |
| Record Nr. | UNINA-9910143887703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Logic and Its Applications [[electronic resource] ] : Fourth Indian Conference, ICLA 2011, Delhi, India, January 5-11, 2011, Proceedings / / edited by Mohua Banerjee, Anil Seth
| Logic and Its Applications [[electronic resource] ] : Fourth Indian Conference, ICLA 2011, Delhi, India, January 5-11, 2011, Proceedings / / edited by Mohua Banerjee, Anil Seth |
| Edizione | [1st ed. 2011.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
| Descrizione fisica | 1 online resource (X, 219 p. 12 illus.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Computer logic Algorithms Mathematical logic Computer science—Mathematics Artificial Intelligence Logics and Meanings of Programs Algorithm Analysis and Problem Complexity Mathematical Logic and Formal Languages Mathematics of Computing |
| ISBN | 3-642-18026-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996466051603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||