The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Neil Immerman
    Descriptive Complexity and Model Checking. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:1-5 [Conf]
  2. Nili Guttmann-Beck, Refael Hassin, Samir Khuller, Balaji Raghavachari
    Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:6-17 [Conf]
  3. Dimitris Fotakis, Paul G. Spirakis
    A Hamiltonian Approach to the Assignment of Non-reusable Frequencies. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:18-29 [Conf]
  4. Carolina Lavatelli
    Deadlock Sensitive Types for Lambda Calculus with Resources. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:30-41 [Conf]
  5. Paola Quaglia, David Walker
    On Encoding p-pi in m-pi. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:42-53 [Conf]
  6. Sudipto Guha, Samir Khuller
    Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:54-65 [Conf]
  7. Mahesh Kallahalla, Peter J. Varman
    Red-Black Prefetching: An Approximation Algorithm for Parallel Disk Scheduling. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:66-77 [Conf]
  8. Jean-Pierre Talpin, David Nowak
    A Synchronous Semantics of Higher-Order Processes for Modeling Reconfigurable Reactive Systems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:78-89 [Conf]
  9. Ilaria Castellani, Matthew Hennessy
    Testing Theories for Asynchronous Languages. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:90-101 [Conf]
  10. John H. Reif
    Alternative Computational Models: A Comparison of Biomolecular and Quantum Computation. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:102-121 [Conf]
  11. Maya Madhavan, Priti Shankar
    Optimal Regular Tree Pattern Matching Using Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:122-133 [Conf]
  12. Andreas Neumann, Helmut Seidl
    Locating Matches of Tree Patterns in Forests. [Citation Graph (1, 0)][DBLP]
    FSTTCS, 1998, pp:134-145 [Conf]
  13. Armin Kühnemann
    Benefits of Tree Transducers for Optimizing Functional Programs. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:146-157 [Conf]
  14. Vijay K. Garg, J. Roger Mitchell
    Implementable Failure Detectors in Asynchronous Systems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:158-169 [Conf]
  15. Erik Meineche Schmidt
    BRICS and Quantum Information Processing. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:170-173 [Conf]
  16. Devdatt P. Dubhashi
    Martingales and Locality in Distributed Computing. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:174-185 [Conf]
  17. J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao
    Space Efficient Suffix Trees. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:186-196 [Conf]
  18. N. S. Pendharkar, K. Gopinath
    Formal Verification of an O. S. Submodule. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:197-208 [Conf]
  19. K. Narayan Kumar, Rance Cleaveland, Scott A. Smolka
    Infinite Probabilistic and Nonprobabilistic Testing. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:209-220 [Conf]
  20. N. Kalyana Rama Prasad, P. Sreenivasa Kumar
    On Generating Strong Elimination Orderings of Strongly Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:221-232 [Conf]
  21. Joachim Gudmundsson, Christos Levcopoulos
    A Parallel Approximation Algorithm for Minimum Weight Triangulation. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:233-244 [Conf]
  22. Luca Aceto, Patricia Bouyer, Augusto Burgueño, Kim Guldstrand Larsen
    The Power of Reachability Testing for Timed Automata. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:245-256 [Conf]
  23. Paritosh K. Pandya, Y. S. Ramakrishna
    Recursive Mean-Value Calculus. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:257-268 [Conf]
  24. Rajeev Alur
    Efficient Formal Verification of Hierarchical Descriptions. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:269- [Conf]
  25. Kenneth L. McMillan
    Proof Rules for Model Checking Systems with Data. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:270- [Conf]
  26. Michaela Huhn, Peter Niebert, Heike Wehrheim
    Partial Order Reductions for Bisimulation Checking. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:271-282 [Conf]
  27. Jürgen Bohn, Werner Damm, Orna Grumberg, Hardi Hungar, Karen Laster
    First-Order-CTL Model Checking. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:283-294 [Conf]
  28. Antoni Lozano, Vijay Raghavan
    On the Complexity of Counting the Number of Vertices Moved by Graph Automorphisms. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:295-306 [Conf]
  29. Satyanarayana V. Lokam
    Remarks on Graph Complexity. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:307-318 [Conf]
  30. Markus Lohrey
    On the Confluence of Trace Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:319-330 [Conf]
  31. Hugues Calbrix, Teodor Knapik
    A String-Rewriting Characterization of Muller and Schupp's Context-Free Graphs. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:331-342 [Conf]
  32. Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel
    Different Types of Monotonicity for Restarting Automata. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:343-354 [Conf]
  33. Kamal Lodaya, Pascal Weil
    A Kleene Iteration for Parallelism. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:355-366 [Conf]
  34. Umesh V. Vazirani
    Quantum Computation and Information. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:367- [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