22. FSTTCS 2002: Kanpur, India

Invited Papers

• Hendrik W. Lenstra Jr.:
  Primality Testing with Gaussian Periods. 1
  
• Harry G. Mairson:
  From Hilbert Spaces to Dilbert Spaces: Context Semantics Made Simple. 2-17
  
• Dale Miller, Alwen Fernanto Tiu:
  Encoding Generic Judgments. 18-32
  
• C.-H. Luke Ong:
  Model Checking Algol-Like Languages Using Game Semantics. 33-36
  
• Margus Veanes:
  Modeling Software: From Theory to Practice. 37-46
  

Contributed Papers

• Bharat Adsul, Milind A. Sohoni:
  Local Normal Forms for Logics over Traces. 47-58
  
• Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger:
  On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality. 59-70
  
• Michele Bugliesi, Silvia Crafa, Massimo Merro, Vladimiro Sassone:
  Communication Interference in Mobile Boxed Ambients. 71-84
  
• Giuseppe Castagna, Francesco Zappa Nardelli:
  The Seal Calculus Revisited: Contextual Equivalence and Bisimilarity. 85-96
  
• Federico Crazzolara, Glynn Winskel:
  Composing Strand Spaces. 97-108
  
• Anuj Dawar, Stephan Kreutzer:
  Generalising Automaticity to Modal Properties of Finite Structures. 109-120
  
• Stéphane Demri, Deepak D'Souza:
  An Automata-Theoretic Approach to Constraint LTL. 121-132
  
• Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, Scott Shenker:
  Hardness Results for Multicast Cost Sharing. 133-144
  
• Alain Finkel, Jérôme Leroux:
  How to Compose Presburger-Accelerations: Applications to Broadcast Protocols. 145-156
  
• Carsten Fritz, Thomas Wilke:
  State Space Reductions for Alternating Büchi Automata. 157-168
  
• Vijay K. Garg:
  Algorithmic Combinatorics Based on Slicing Posets. 169-181
  
• Jens Gramm, Jiong Guo, Rolf Niedermeier:
  Pattern Matching for Arc-Annotated Sequences. 182-193
  
• Bernhard Heinemann:
  Knowledge over Dense Flows of Time (from a Hybrid Point of View). 194-205
  
• Thanh Minh Hoang, Thomas Thierauf:
  The Complexity of the Inertia. 206-217
  
• Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen:
  The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version. 218-229
  
• Konstantin Korovin, Andrei Voronkov:
  The Decidability of the First-Order Theory of the Knuth-Bendix Order in the Case of Unary Signatures. 230-240
  
• Ralf Küsters, Thomas Wilke:
  Deciding the First Level of the µ-Calculus Alternation Hierarchy. 241-252
  
• Martin Leucker, P. Madhusudan, Supratik Mukhopadhyay:
  Dynamic Message Sequence Charts. 253-264
  
• Sebastian Maneth:
  The Complexity of Compositions of Deterministic Tree Transducers. 265-276
  
• S. Mishra, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian:
  On the Hardness of Approximating Minimum Monopoly Problems. 277-288
  
• Madhavan Mukund:
  Hereditary History Preserving Bisimulation Is Decidable for Trace-Labelled Systems. 289-300
  
• K. V. M. Naidu, H. Ramesh:
  Lower Bounds for Embedding Graphs into Graphs of Smaller Characteristic. 301-310
  
• Yogish Sabharwal, Nishant Sharma, Sandeep Sen:
  Nearest Neighbors Search Using Point Location in Balls with Applications to Approximate Voronoi Decompositions. 311-323
  
• A. Prasad Sistla:
  Formal Languages and Algorithms for Similarity Based Retrieval from Sequence Databases. 324-335
  
• Walter Vogler, Ralf Wollowski:
  Decomposition in Asynchronous Circuit Design. 336-347
  
• David R. Wood:
  Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing. 348-359