FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science 22nd Conference Kanpur, India, December 12-14, 2002, Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Agrawal, Manindra (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Seth, Anil (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002.
• Έκδοση: 1st ed. 2002.
• Σειρά: Lecture Notes in Computer Science, 2556
• Θέματα: 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.

This volume consists of the proceedings of the 22nd International Conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2002), organized under the auspices of the Indian Association for Research in Computing Science (IARCS). The conference was held at the Indi...

Πίνακας περιεχομένων:

• 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.