Conferences in DBLP
Hendrik W. Lenstra Jr. Primality Testing with Gaussian Periods. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2002, pp:1- [Conf ] Harry G. Mairson From Hilbert Spaces to Dilbert Spaces: Context Semantics Made Simple. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2002, pp:2-17 [Conf ] Dale Miller , Alwen Fernanto Tiu Encoding Generic Judgments. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2002, pp:18-32 [Conf ] C.-H. Luke Ong Model Checking Algol-Like Languages Using Game Semantics. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2002, pp:33-36 [Conf ] Margus Veanes Modeling Software: From Theory to Practice. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2002, pp:37-46 [Conf ] Bharat Adsul , Milind A. Sohoni Local Normal Forms for Logics over Traces. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2002, pp:47-58 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2002, pp:59-70 [Conf ] Michele Bugliesi , Silvia Crafa , Massimo Merro , Vladimiro Sassone Communication Interference in Mobile Boxed Ambients. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2002, pp:71-84 [Conf ] Giuseppe Castagna , Francesco Zappa Nardelli The Seal Calculus Revisited: Contextual Equivalence and Bisimilarity. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2002, pp:85-96 [Conf ] Federico Crazzolara , Glynn Winskel Composing Strand Spaces. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2002, pp:97-108 [Conf ] Anuj Dawar , Stephan Kreutzer Generalising Automaticity to Modal Properties of Finite Structures. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2002, pp:109-120 [Conf ] Stéphane Demri , Deepak D'Souza An Automata-Theoretic Approach to Constraint LTL. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2002, pp:121-132 [Conf ] Joan Feigenbaum , Arvind Krishnamurthy , Rahul Sami , Scott Shenker Hardness Results for Multicast Cost Sharing. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2002, pp:133-144 [Conf ] Alain Finkel , Jérôme Leroux How to Compose Presburger-Accelerations: Applications to Broadcast Protocols. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2002, pp:145-156 [Conf ] Carsten Fritz , Thomas Wilke State Space Reductions for Alternating Büchi Automata. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2002, pp:157-168 [Conf ] Vijay K. Garg Algorithmic Combinatorics Based on Slicing Posets. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2002, pp:169-181 [Conf ] Jens Gramm , Jiong Guo , Rolf Niedermeier Pattern Matching for Arc-Annotated Sequences. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2002, pp:182-193 [Conf ] Bernhard Heinemann Knowledge over Dense Flows of Time (from a Hybrid Point of View). [Citation Graph (0, 0)][DBLP ] FSTTCS, 2002, pp:194-205 [Conf ] Thanh Minh Hoang , Thomas Thierauf The Complexity of the Inertia. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2002, pp:206-217 [Conf ] Rahul Jain , Jaikumar Radhakrishnan , Pranab Sen The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2002, pp:218-229 [Conf ] Konstantin Korovin , Andrei Voronkov The Decidability of the First-Order Theory of the Knuth-Bendix Order in the Case of Unary Signatures. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2002, pp:230-240 [Conf ] Ralf Küsters , Thomas Wilke Deciding the First Level of the µ-Calculus Alternation Hierarchy. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2002, pp:241-252 [Conf ] Martin Leucker , P. Madhusudan , Supratik Mukhopadhyay Dynamic Message Sequence Charts. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2002, pp:253-264 [Conf ] Sebastian Maneth The Complexity of Compositions of Deterministic Tree Transducers. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2002, pp:265-276 [Conf ] S. Mishra , Jaikumar Radhakrishnan , Sivaramakrishnan Sivasubramanian On the Hardness of Approximating Minimum Monopoly Problems. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2002, pp:277-288 [Conf ] Madhavan Mukund Hereditary History Preserving Bisimulation Is Decidable for Trace-Labelled Systems. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2002, pp:289-300 [Conf ] K. V. M. Naidu , H. Ramesh Lower Bounds for Embedding Graphs into Graphs of Smaller Characteristic. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2002, pp:301-310 [Conf ] Yogish Sabharwal , Nishant Sharma , Sandeep Sen Nearest Neighbors Search Using Point Location in Balls with Applications to Approximate Voronoi Decompositions. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2002, pp:311-323 [Conf ] A. Prasad Sistla Formal Languages and Algorithms for Similarity Based Retrieval from Sequence Databases. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2002, pp:324-335 [Conf ] Walter Vogler , Ralf Wollowski Decomposition in Asynchronous Circuit Design. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2002, pp:336-347 [Conf ] David R. Wood Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2002, pp:348-359 [Conf ]