The SCEAS System
Navigation Menu

Conferences in DBLP

Foundations of Software Technology and Theoretical Computer Science (FSTTCS) (fsttcs)
2002 (conf/fsttcs/2002)

  1. Hendrik W. Lenstra Jr.
    Primality Testing with Gaussian Periods. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:1- [Conf]
  2. Harry G. Mairson
    From Hilbert Spaces to Dilbert Spaces: Context Semantics Made Simple. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:2-17 [Conf]
  3. Dale Miller, Alwen Fernanto Tiu
    Encoding Generic Judgments. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:18-32 [Conf]
  4. C.-H. Luke Ong
    Model Checking Algol-Like Languages Using Game Semantics. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:33-36 [Conf]
  5. Margus Veanes
    Modeling Software: From Theory to Practice. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:37-46 [Conf]
  6. Bharat Adsul, Milind A. Sohoni
    Local Normal Forms for Logics over Traces. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:47-58 [Conf]
  7. 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]
  8. 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]
  9. Giuseppe Castagna, Francesco Zappa Nardelli
    The Seal Calculus Revisited: Contextual Equivalence and Bisimilarity. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:85-96 [Conf]
  10. Federico Crazzolara, Glynn Winskel
    Composing Strand Spaces. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:97-108 [Conf]
  11. Anuj Dawar, Stephan Kreutzer
    Generalising Automaticity to Modal Properties of Finite Structures. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:109-120 [Conf]
  12. Stéphane Demri, Deepak D'Souza
    An Automata-Theoretic Approach to Constraint LTL. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:121-132 [Conf]
  13. 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]
  14. 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]
  15. Carsten Fritz, Thomas Wilke
    State Space Reductions for Alternating Büchi Automata. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:157-168 [Conf]
  16. Vijay K. Garg
    Algorithmic Combinatorics Based on Slicing Posets. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:169-181 [Conf]
  17. Jens Gramm, Jiong Guo, Rolf Niedermeier
    Pattern Matching for Arc-Annotated Sequences. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:182-193 [Conf]
  18. 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]
  19. Thanh Minh Hoang, Thomas Thierauf
    The Complexity of the Inertia. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:206-217 [Conf]
  20. 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]
  21. 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]
  22. 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]
  23. Martin Leucker, P. Madhusudan, Supratik Mukhopadhyay
    Dynamic Message Sequence Charts. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:253-264 [Conf]
  24. Sebastian Maneth
    The Complexity of Compositions of Deterministic Tree Transducers. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:265-276 [Conf]
  25. 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]
  26. Madhavan Mukund
    Hereditary History Preserving Bisimulation Is Decidable for Trace-Labelled Systems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:289-300 [Conf]
  27. 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]
  28. 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]
  29. 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]
  30. Walter Vogler, Ralf Wollowski
    Decomposition in Asynchronous Circuit Design. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:336-347 [Conf]
  31. David R. Wood
    Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:348-359 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002