Anil Seth

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

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

Global reachability in bounded phase multi-stack pushdown systems

Bounded phase multi-stack pushdown systems (mpds) have been studied recently Given a set

There is no recursive axiomatization for feasible functionals of type 2

\mathcal{C}

Turing Machine Characterizations of Feasible Functionals of All Finite Types

of configurations of a mpds

Some desirable conditions for feasible functionals of type 2

\mathcal{M}

When do fixed point logics capture complexity classes

, let

Games on Multi-stack Pushdown Systems

pre_{\mathcal{M}}^{*}(\mathcal{C},k)

Algorithms for energy optimization using processor instructions

be the set of configurations of

Games on Higher Order Multi-stack Pushdown Systems

\mathcal{M}

Ordering finite variable types with generalized quantifiers

from which