The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. E. Allen Emerson
    Model Checking: Theory into Practice. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:1-10 [Conf]
  2. Mary F. Fernández, Jérôme Siméon, Philip Wadler
    An Algebra for XML Query. [Citation Graph (1, 0)][DBLP]
    FSTTCS, 2000, pp:11-45 [Conf]
  3. Bernard Chazelle
    Irregularities of Distribution, Derandomization, and Complexity Theory. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:46-54 [Conf]
  4. David A. Basin, Manuel Clavel, José Meseguer
    Rewriting Logic as a Metalogical Framework. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:55-80 [Conf]
  5. Martin Grötschel
    Frequency Assignment in Mobile Phone Systems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:81-86 [Conf]
  6. Peter Buneman, Sanjeev Khanna, Wang Chiew Tan
    Data Provenance: Some Basic Issues. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:87-93 [Conf]
  7. Sachin B. Patkar, H. Narayanan
    Fast On-Line/Off-Line Algorithms for Optimal Reinforcement of a Network and Its Connections with Principal Partition. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:94-105 [Conf]
  8. Lene M. Favrholdt, Morten N. Nielsen
    On-Line Edge-Coloring with a Fixed Number of Colors. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:106-116 [Conf]
  9. Toshihiro Fujito
    On Approximability of the Independent/Connected Edge Dominating Set Problems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:117-126 [Conf]
  10. Igor Walukiewicz
    Model Checking CTL Properties of Pushdown Systems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:127-138 [Conf]
  11. Salvatore La Torre, Margherita Napoli
    A Decidable Dense Branching-Time Temporal Logic. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:139-150 [Conf]
  12. Orna Kupferman, Nir Piterman, Moshe Y. Vardi
    Fair Equivalence Relations. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:151-163 [Conf]
  13. Pierre McKenzie, Heribert Vollmer, Klaus W. Wagner
    Arithmetic Circuits and Polynomial Replacement Systems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:164-175 [Conf]
  14. Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan
    Depth-3 Arithmetic Circuits for Sn2(X) and Extensions of the Graham-Pollack Theorem. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:176-187 [Conf]
  15. Olivier Ly
    The Bounded Weak Monadic Quantifier Alternation Hierarchy of Equational Graphs Is Infinite. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:188-200 [Conf]
  16. Sergei M. Abramov, Robert Glück
    Combining Semantics with Non-standard Interpreter Hierarchies. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:201-213 [Conf]
  17. Jan-Georg Smaus, François Fages, Pierre Deransart
    Using Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:214-226 [Conf]
  18. Marina De Vos, Dirk Vermeir
    Dynamically Ordered Probabilistic Choice Logic Programming. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:227-239 [Conf]
  19. Michael R. Fellows, Catherine McCartin, Frances A. Rosamond, Ulrike Stege
    Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:240-251 [Conf]
  20. Surender Baswana, Sandeep Sen
    Planar Graph Blocking for External Searching. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:252-263 [Conf]
  21. Dimitar P. Guelev
    A Complete Fragment of Higher-Order Duration µ-Calculus. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:264-276 [Conf]
  22. Huimin Lin, Wang Yi
    A Complete Axiomatisation for Timed Automata. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:277-289 [Conf]
  23. Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi
    Text Sparsification via Local Maxima. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:290-301 [Conf]
  24. Amihood Amir, Moshe Lewenstein, Ely Porat
    Approximate Swapped Matching. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:302-311 [Conf]
  25. Rance Cleaveland, Gerald Lüttgen
    A Semantic Theory for Heterogeneous System Design. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:312-324 [Conf]
  26. Ekaterina Sedletsky, Amir Pnueli, Mordechai Ben-Ari
    Formal Verification of the Ricart-Agrawala Algorithm. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:325-335 [Conf]
  27. Johannes Köbler, Wolfgang Lindner
    On Distribution-Specific Learning with Membership Queries versus Pseudorandom Generation. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:336-347 [Conf]
  28. Holger Spakowski, Jörg Vogel
    Theta2p-Completeness: A Classical Approach for New Results. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:348-360 [Conf]
  29. Johannes Köbler, Jochen Messner
    Is the Standard Proof System for SAT P-Optimal? [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:361-372 [Conf]
  30. Barbara König
    A General Framework for Types in Graph Rewriting. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:373-384 [Conf]
  31. Yuxi Fu, Zhenrong Yang
    The Ground Congruence for Chi Calculus. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:385-396 [Conf]
  32. Cédric Fournet, Cosimo Laneve, Luc Maranget, Didier Rémy
    Inheritance in the Join Calculus. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:397-408 [Conf]
  33. Stefano Leonardi, Alberto Marchetti-Spaccamela, Andrea Vitaletti
    Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:409-420 [Conf]
  34. Bala Kalyanasundaram, Kirk Pruhs
    Dynamic Spectrum Allocation: The Impotency of Duration Notification. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:421-428 [Conf]
  35. Pietro Di Gianantonio, Gianluca Franco
    The Fine Structure of Game Lambda Models. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:429-441 [Conf]
  36. Michel Parigot
    Strong Normalization of Second Order Symmetric lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:442-453 [Conf]
  37. Foto N. Afrati, Evripidis Bampis, Aleksei V. Fishkin, Klaus Jansen, Claire Kenyon
    Scheduling to Minimize the Average Completion Time of Dedicated Tasks. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:454-464 [Conf]
  38. Michael T. Hallett, Jens Lagergren
    Hunting for Functionally Analogous Genes. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:465-476 [Conf]
  39. Bharat Adsul, Aranyak Mehta, Milind A. Sohoni
    Keeping Track of the Latest Gossip in Shared Memory Systems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:477-488 [Conf]
  40. Ajay D. Kshemkalyani
    Concurrent Knowledge and Logical Clock Abstractions. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:489-502 [Conf]
  41. Christian Glaßer, Heinz Schmitz
    Decidable Hierarchies of Starfree Languages. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:503-515 [Conf]
  42. Jens R. Woinowski
    Prefix Languages of Church-Rosser Languages. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:516-530 [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