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.
Foundations of software technology and theoretical computer science : 18th conference, chennai, india, december 17-19, 1998 : proceedings / / edited by V. Arvind and R. Ramanujam
| Foundations of software technology and theoretical computer science : 18th conference, chennai, india, december 17-19, 1998 : proceedings / / edited by V. Arvind and R. Ramanujam |
| Edizione | [1st ed. 1998.] |
| Pubbl/distr/stampa | Berlin, Germany : , : Springer, , [1998] |
| Descrizione fisica | 1 online resource (XII, 369 p.) |
| Disciplina | 511.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Molecular computers
Computer software Computer science |
| ISBN | 3-540-49382-4 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk 1 -- Descriptive Complexity and Model Checking -- Session 1(a) -- Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem -- A Hamiltonian Approach to the Assignment of Non-reusable Frequencies -- Session 1(b) -- Deadlock Sensitive Types for Lambda Calculus with Resources -- On encoding p? in m? -- Session 2(a) -- Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets -- Red-Black Prefetching: An Approximation Algorithm for Parallel Disk Scheduling -- Session 2(b) -- A Synchronous Semantics of Higher-Order Processes for Modeling Reconfigurable Reactive Systems -- Testing Theories for Asynchronous Languages -- Invited Talk 2 -- Alternative Computational Models: A Comparison of Biomolecular and Quantum Computation -- Session 3 -- Optimal Regular Tree Pattern Matching Using Pushdown Automata -- Locating Matches of Tree Patterns in Forests -- Session 4 -- Benefits of Tree Transducers for Optimizing Functional Programs -- Implementable Failure Detectors in Asynchronous Systems -- Invited Talk 3 -- BRICS and Quantum Information Processing -- Session 5(a) -- Martingales and Locality in Distributed Computing -- Space Efficient Suffix Trees -- Session 5(b) -- Formal Verification of an O.S. Submodule -- Infinite Probabilistic and Nonprobabilistic Testing -- Session 6(a) -- On Generating Strong Elimination Orderings of Strongly Chordal Graphs -- A Parallel Approximation Algorithm for Minimum Weight Triangulation -- Session 6(b) -- The Power of Reachability Testing for Timed Automata -- Recursive Mean-Value Calculus -- Invited Talk 4 -- Efficient Formal Verification of Hierarchical Descriptions -- Invited Talk 5 -- Proof Rules for Model Checking Systems with Data -- Session 7 -- Partial Order Reductions for Bisimulation Checking -- First-Order-CTL Model Checking -- Session 8(a) -- On the Complexity of Counting the Number of Vertices Moved by Graph Automorphisms -- Remarks on Graph Complexity -- Session 8(b) -- On the Confluence of Trace Rewriting Systems -- A String-Rewriting Characterization of Muller and Schupp’s Context-Free Graphs -- Session 9 -- Different Types of Monotonicity for Restarting Automata -- A Kleene Iteration for Parallelism -- Invited Talk 6 -- Quantum Computation and Information. |
| Record Nr. | UNINA-9910143465403321 |
| Berlin, Germany : , : Springer, , [1998] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Foundations of software technology and theoretical computer science : 18th conference, chennai, india, december 17-19, 1998 : proceedings / / edited by V. Arvind and R. Ramanujam
| Foundations of software technology and theoretical computer science : 18th conference, chennai, india, december 17-19, 1998 : proceedings / / edited by V. Arvind and R. Ramanujam |
| Edizione | [1st ed. 1998.] |
| Pubbl/distr/stampa | Berlin, Germany : , : Springer, , [1998] |
| Descrizione fisica | 1 online resource (XII, 369 p.) |
| Disciplina | 511.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Molecular computers
Computer software Computer science |
| ISBN | 3-540-49382-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk 1 -- Descriptive Complexity and Model Checking -- Session 1(a) -- Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem -- A Hamiltonian Approach to the Assignment of Non-reusable Frequencies -- Session 1(b) -- Deadlock Sensitive Types for Lambda Calculus with Resources -- On encoding p? in m? -- Session 2(a) -- Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets -- Red-Black Prefetching: An Approximation Algorithm for Parallel Disk Scheduling -- Session 2(b) -- A Synchronous Semantics of Higher-Order Processes for Modeling Reconfigurable Reactive Systems -- Testing Theories for Asynchronous Languages -- Invited Talk 2 -- Alternative Computational Models: A Comparison of Biomolecular and Quantum Computation -- Session 3 -- Optimal Regular Tree Pattern Matching Using Pushdown Automata -- Locating Matches of Tree Patterns in Forests -- Session 4 -- Benefits of Tree Transducers for Optimizing Functional Programs -- Implementable Failure Detectors in Asynchronous Systems -- Invited Talk 3 -- BRICS and Quantum Information Processing -- Session 5(a) -- Martingales and Locality in Distributed Computing -- Space Efficient Suffix Trees -- Session 5(b) -- Formal Verification of an O.S. Submodule -- Infinite Probabilistic and Nonprobabilistic Testing -- Session 6(a) -- On Generating Strong Elimination Orderings of Strongly Chordal Graphs -- A Parallel Approximation Algorithm for Minimum Weight Triangulation -- Session 6(b) -- The Power of Reachability Testing for Timed Automata -- Recursive Mean-Value Calculus -- Invited Talk 4 -- Efficient Formal Verification of Hierarchical Descriptions -- Invited Talk 5 -- Proof Rules for Model Checking Systems with Data -- Session 7 -- Partial Order Reductions for Bisimulation Checking -- First-Order-CTL Model Checking -- Session 8(a) -- On the Complexity of Counting the Number of Vertices Moved by Graph Automorphisms -- Remarks on Graph Complexity -- Session 8(b) -- On the Confluence of Trace Rewriting Systems -- A String-Rewriting Characterization of Muller and Schupp’s Context-Free Graphs -- Session 9 -- Different Types of Monotonicity for Restarting Automata -- A Kleene Iteration for Parallelism -- Invited Talk 6 -- Quantum Computation and Information. |
| Record Nr. | UNISA-996465889003316 |
| Berlin, Germany : , : Springer, , [1998] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science [[electronic resource] ] : 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings / / edited by V. Arvind, Sanjiva Prasad
| FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science [[electronic resource] ] : 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings / / edited by V. Arvind, Sanjiva Prasad |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XIV, 560 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Software engineering Compilers (Computer programs) Machine theory Algorithms Theory of Computation Software Engineering Computer Science Logic and Foundations of Programming Compilers and Interpreters Formal Languages and Automata Theory |
| ISBN | 3-540-77050-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- The Multicore Revolution -- Streaming Algorithms for Selection and Approximate Sorting -- Adventures in Bidirectional Programming -- Program Analysis Using Weighted Pushdown Systems -- The Complexity of Zero Knowledge -- Contributed Papers -- The Priority k-Median Problem -- “Rent-or-Buy” Scheduling and Cost Coloring Problems -- Order Scheduling Models: Hardness and Algorithms -- On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography -- Key Substitution in the Symbolic Analysis of Cryptographic Protocols -- Symbolic Bisimulation for the Applied Pi Calculus -- Non-mitotic Sets -- Reductions to Graph Isomorphism -- Strong Reductions and Isomorphism of Complete Sets -- Probabilistic and Topological Semantics for Timed Automata -- A Theory for Game Theories -- An Incremental Bisimulation Algorithm -- Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs -- Communication Lower Bounds Via the Chromatic Number -- The Deduction Theorem for Strong Propositional Proof Systems -- Satisfiability of Algebraic Circuits over Sets of Natural Numbers -- Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems -- Synthesis of Safe Message-Passing Systems -- Automata and Logics for Timed Message Sequence Charts -- Propositional Dynamic Logic for Message-Passing Systems -- Better Algorithms and Bounds for Directed Maximum Leaf Problems -- Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs -- Covering Graphs with Few Complete Bipartite Subgraphs -- Safely Composing Security Protocols -- Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption -- Bounding Messages for Free in Security Protocols -- Triangulations of Line Segment Sets in the Plane -- Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections -- Finding a Rectilinear Shortest Path in R 2 Using Corridor Based Staircase Structures -- Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space -- Stochastic Müller Games are PSPACE-Complete -- Solving Parity Games in Big Steps -- Efficient and Expressive Tree Filters -- Markov Decision Processes with Multiple Long-Run Average Objectives -- A Formal Investigation of Diff3 -- Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem -- Undirected Graphs of Entanglement 2 -- Acceleration in Convex Data-Flow Analysis -- Model Checking Almost All Paths Can Be Less Expensive Than Checking All Paths -- Closures and Modules Within Linear Logic Concurrent Constraint Programming. |
| Record Nr. | UNISA-996465924503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science : 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings / / edited by V. Arvind, Sanjiva Prasad
| FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science : 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings / / edited by V. Arvind, Sanjiva Prasad |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XIV, 560 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Software engineering Compilers (Computer programs) Machine theory Algorithms Theory of Computation Software Engineering Computer Science Logic and Foundations of Programming Compilers and Interpreters Formal Languages and Automata Theory |
| ISBN | 3-540-77050-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- The Multicore Revolution -- Streaming Algorithms for Selection and Approximate Sorting -- Adventures in Bidirectional Programming -- Program Analysis Using Weighted Pushdown Systems -- The Complexity of Zero Knowledge -- Contributed Papers -- The Priority k-Median Problem -- “Rent-or-Buy” Scheduling and Cost Coloring Problems -- Order Scheduling Models: Hardness and Algorithms -- On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography -- Key Substitution in the Symbolic Analysis of Cryptographic Protocols -- Symbolic Bisimulation for the Applied Pi Calculus -- Non-mitotic Sets -- Reductions to Graph Isomorphism -- Strong Reductions and Isomorphism of Complete Sets -- Probabilistic and Topological Semantics for Timed Automata -- A Theory for Game Theories -- An Incremental Bisimulation Algorithm -- Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs -- Communication Lower Bounds Via the Chromatic Number -- The Deduction Theorem for Strong Propositional Proof Systems -- Satisfiability of Algebraic Circuits over Sets of Natural Numbers -- Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems -- Synthesis of Safe Message-Passing Systems -- Automata and Logics for Timed Message Sequence Charts -- Propositional Dynamic Logic for Message-Passing Systems -- Better Algorithms and Bounds for Directed Maximum Leaf Problems -- Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs -- Covering Graphs with Few Complete Bipartite Subgraphs -- Safely Composing Security Protocols -- Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption -- Bounding Messages for Free in Security Protocols -- Triangulations of Line Segment Sets in the Plane -- Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections -- Finding a Rectilinear Shortest Path in R 2 Using Corridor Based Staircase Structures -- Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space -- Stochastic Müller Games are PSPACE-Complete -- Solving Parity Games in Big Steps -- Efficient and Expressive Tree Filters -- Markov Decision Processes with Multiple Long-Run Average Objectives -- A Formal Investigation of Diff3 -- Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem -- Undirected Graphs of Entanglement 2 -- Acceleration in Convex Data-Flow Analysis -- Model Checking Almost All Paths Can Be Less Expensive Than Checking All Paths -- Closures and Modules Within Linear Logic Concurrent Constraint Programming. |
| Record Nr. | UNINA-9910483173803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||