FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science

22nd Conference Kanpur, India, December 12-14, 2002, Proceedings

AvManindra Agrawal,Anil Seth

Häftad, Engelska, 2002

Del i serien Lecture Notes in Computer Science

550 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This book constitutes the refereed proceedings of the 22nd Conference on Foundations of Software Technology and Theoretical Computer Science, FST TCS 2002, held in Kanpur, India in December 2002. The 26 revised full papers presented together with 5 invited contributions were carefully reviewed and selected from 108 submissions. A broad variety of topics from the theory of computing are addressed, from algorithmics and discrete mathematics as well as from logics and programming theory.

Produktinformation

Utgivningsdatum:2002-11-29
Mått:155 x 235 x 21 mm
Vikt:575 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:368
Upplaga:2002
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540002253

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Programvaruutveckling inom Data och IT

Innehållsförteckning

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