FST TCS 2002: Foundations of software technology and theoretical computer science. 22nd conference, Kanpur, India, December 12--14, 2002. Proceedings (Q1396693)

The articles of this volume will be reviewed individually. The preceding conference has been reviewed (see Zbl 0977.00041). Indexed articles: \textit{Lenstra, H. W. jun.}, Primality testing with Gaussian periods, 1 [Zbl 1027.68984] \textit{Mairson, Harry G.}, From Hilbert spaces to Dilbert spaces: Context semantics made simple, 2-17 [Zbl 1027.68080] \textit{Miller, Dale; Tiu, Alwen}, Encoding generic judgments, 18-32 [Zbl 1027.68032] \textit{Ong, C.-H. L.}, Model checking Algol-like languages using game semantics, 33-36 [Zbl 1027.68615] \textit{Veanes, Margus}, Modeling software: From theory to practice, 37-46 [Zbl 1027.68524] \textit{Adsul, Bharat; Sohoni, Milind}, Local normal forms for logics over traces, 47-58 [Zbl 1027.68085] \textit{Böckenhauer, Hans-Joachim; Bongartz, Dirk; Hromkovič, Juraj; Klasing, Ralf; Proietti, Guido; Seibert, Sebastian; Unger, Walter}, On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality, 59-70 [Zbl 1027.68097] \textit{Bugliesi, Michele; Crafa, Silvia; Merro, Massimo; Sassone, Vladimiro}, Communication interference in mobile boxed ambients, 71-84 [Zbl 1027.68086] \textit{Castagna, Giuseppe; Zappa Nardelli, Francesco}, The seal calculus revisited: Contextual equivalence and bisimilarity, 85-96 [Zbl 1027.68088] \textit{Crazzolara, Federico; Winskel, Glynn}, Composing strand spaces, 97-108 [Zbl 1027.68089] \textit{Dawar, A.; Kreutzer, S.}, Generalising automaticity to modal properties of finite structures, 109-120 [Zbl 1027.68081] \textit{Demri, Stéphane; D'Souza, Deepak}, An automata-theoretic approach to constraint LTL, 121-132 [Zbl 1027.03027] \textit{Feigenbaum, Joan; Krishnamurthy, Arvind; Sami, Rahul; Shenker, Scott}, Hardness results for multicast cost sharing, 133-144 [Zbl 1027.68502] \textit{Finkel, Alain; Leroux, Jérôme}, How to compose Presburger-accelerations: Applications to broadcast protocols, 145-156 [Zbl 1027.68616] \textit{Fritz, Carsten; Wilke, Thomas}, State space reductions for alternating Büchi automata. Quotienting by simulation equivalences, 157-168 [Zbl 1027.68075] \textit{Garg, Vijay K.}, Algorithmic combinatorics based on slicing posets, 169-181 [Zbl 1027.68093] \textit{Gramm, Jens; Guo, Jiong; Niedermeier, Rolf}, Pattern matching for arc-annotated sequences, 182-193 [Zbl 1027.68653] \textit{Heinemann, Bernhard}, Knowledge over dense flows of time (from a hybrid point of view), 194-205 [Zbl 1027.03012] \textit{Hoang, Thanh Minh; Thierauf, Thomas}, The complexity of the inertia, 206-217 [Zbl 1027.68063] \textit{Jain, Rahul; Radhakrishnan, Jaikumar; Sen, Pranab}, The quantum communication complexity of the pointer chasing problem: The bit version, 218-229 [Zbl 1027.68065] \textit{Korovin, Konstantin; Voronkov, Andrei}, The decidability of the first-order theory of the Knuth-Bendix order in the case of unary signatures, 230-240 [Zbl 1027.03007] \textit{Küsters, Ralf; Wilke, Thomas}, Deciding the first level of the \(\mu\)-calculus alternation hierarchy, 241-252 [Zbl 1027.03030] \textit{Leucker, Martin; Madhusudan, P.; Mukhopadhyay, Supratik}, Dynamic message sequence charts, 253-264 [Zbl 1027.68082] \textit{Maneth, Sebastian}, The complexity of compositions of deterministic tree transducers, 265-276 [Zbl 1027.68078] \textit{Mishra, S.; Radhakrishnan, J.; Sivasubramanian, S.}, On the hardness of approximating minimum monopoly problems, 277-288 [Zbl 1027.90100] \textit{Mukund, Madhavan}, Hereditary history preserving bisimulation is decidable for trace-labelled systems, 289-300 [Zbl 1027.68090] \textit{Naidu, K. V. M.; Ramesh, H.}, Lower bounds for embedding graphs into graphs of smaller characteristic, 301-310 [Zbl 1027.68064] \textit{Sabharwal, Yogish; Sharma, Nishant; Sen, Sandeep}, Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions, 311-323 [Zbl 1027.68042] \textit{Sistla, A. Prasad}, Formal languages and algorithms for similarity based retrieval from sequence databases, 324-335 [Zbl 1027.68584] \textit{Vogler, Walter; Wollowski, Ralf}, Decomposition in asynchronous circuit design, 336-347 [Zbl 1027.68643] \textit{Wood, David R.}, Queue layouts, tree-width, and three-dimensional graph drawing, 348-359 [Zbl 1027.68647]