The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Krishnendu Chatterjee, Thomas A. Henzinger
    Semiperfect-Information Games. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:1-18 [Conf]
  2. Russell Impagliazzo
    Computational Complexity Since 1980. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:19-47 [Conf]
  3. Raimund Seidel
    Developments in Data Structure Research During the First 25 Years of FSTTCS. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:48-59 [Conf]
  4. Natarajan Shankar
    Inference Systems for Logical Algorithms. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:60-78 [Conf]
  5. Igor Walukiewicz
    From Logic to Games. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:79-91 [Conf]
  6. Manindra Agrawal
    Proving Lower Bounds Via Pseudo-random Generators. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:92-105 [Conf]
  7. Joel Spencer
    Erdös Magic. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:106- [Conf]
  8. Michael Edwards, Kasturi R. Varadarajan
    No Coreset, No Cry: II. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:107-115 [Conf]
  9. Mark de Berg
    Improved Bounds on the Union Complexity of Fat Objects. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:116-127 [Conf]
  10. Taolue Chen, Tingting Han, Jian Lu
    On the Bisimulation Congruence in chi-Calculus. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:128-139 [Conf]
  11. Jens Chr. Godskesen, Thomas T. Hildebrandt
    Extending Howe's Method to Early Bisimulations for Typed Mobile Embedded Resources with Local Names. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:140-151 [Conf]
  12. Vijay Kumar, Atri Rudra
    Approximation Algorithms for Wavelength Assignment. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:152-163 [Conf]
  13. Refael Hassin, Danny Segev
    The Set Cover with Pairs Problem. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:164-176 [Conf]
  14. Ana Almeida Matos
    Non-disclosure for Distributed Mobile Code. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:177-188 [Conf]
  15. Ugo Dal Lago, Martin Hofmann
    Quantitative Models and Implicit Complexity. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:189-200 [Conf]
  16. P. Madhusudan, P. S. Thiagarajan, Shaofa Yang
    The MSO Theory of Connectedly Communicating Processes. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:201-212 [Conf]
  17. Mojmír Kretínský, Vojtech Rehák, Jan Strejcek
    Reachability of Hennessy-Milner Properties for Weakly Extended PRS. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:213-224 [Conf]
  18. Ting Zhang, Henny B. Sipma, Zohar Manna
    Decision Procedures for Queues with Integer Constraints. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:225-237 [Conf]
  19. Eric Allender, Samir Datta, Sambuddha Roy
    The Directed Planar Reachability Problem. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:238-249 [Conf]
  20. Xiaoyang Gu, Jack H. Lutz, Philippe Moser
    Dimensions of Copeland-Erdös Sequences. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:250-260 [Conf]
  21. Venkatesh Mysore, Amir Pnueli
    Refining the Undecidability Frontier of Hybrid Automata. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:261-272 [Conf]
  22. Béatrice Bérard, Franck Cassez, Serge Haddad, Didier Lime, Olivier H. Roux
    When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets? [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:273-284 [Conf]
  23. S. Muthukrishnan
    Subquadratic Algorithms for Workload-Aware Haar Wavelet Synopses. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:285-296 [Conf]
  24. Sumit Ganguly, Deepanjan Kesh, Chandan Saha
    Practical Algorithms for Tracking Database Join Sizes. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:297-309 [Conf]
  25. Pavel Krcál, Radek Pelánek
    On Sampled Semantics of Timed Systems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:310-321 [Conf]
  26. Deepak D'Souza, M. Raj Mohan
    Eventual Timed Automata. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:322-334 [Conf]
  27. Bharat Adsul, Madhavan Mukund, K. Narayan Kumar, Vasumathi Narayanan
    Causal Closure for MSC Languages. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:335-347 [Conf]
  28. Ahmed Bouajjani, Javier Esparza, Stefan Schwoon, Jan Strejcek
    Reachability Analysis of Multithreaded Software with Asynchronous Communication. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:348-359 [Conf]
  29. Andreas Baltz, Devdatt P. Dubhashi, Libertad Tansini, Anand Srivastav, Sören Werth
    Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:360-371 [Conf]
  30. Tomás Brázdil, Antonín Kucera
    Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:372-383 [Conf]
  31. Mark Reynolds
    Towards a CTL* Tableau. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:384-395 [Conf]
  32. Tim French
    Bisimulation Quantified Logics: Undecidability. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:396-407 [Conf]
  33. Prasad Jayanti, Srdjan Petrovic
    Logarithmic-Time Single Deleter, Multiple Inserter Wait-Free Queues and Stacks. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:408-419 [Conf]
  34. Sathya Peri, Neeraj Mittal
    Monitoring Stable Properties in Dynamic Peer-to-Peer Distributed Systems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:420-431 [Conf]
  35. Patricia Bouyer, Fabrice Chevalier, Nicolas Markey
    On the Expressiveness of TPTL and MTL. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:432-443 [Conf]
  36. Shankara Narayanan Krishna, Paritosh K. Pandya
    Modal Strength Reduction in Quantified Discrete Duration Calculus. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:444-456 [Conf]
  37. Henning Fernau, Michael Kaufmann, Mathias Poths
    Comparing Trees Via Crossing Minimization. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:457-469 [Conf]
  38. Jirí Srba
    On Counting the Number of Consistent Genotype Assignments for Pedigrees. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:470-482 [Conf]
  39. Stefan Göller, Markus Lohrey
    Fixpoint Logics on Hierarchical Structures. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:483-494 [Conf]
  40. Joost Engelfriet, Sebastian Maneth
    The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:495-504 [Conf]
  41. Bruno Codenotti, Benton McCune, Sriram Penumatcha, Kasturi R. Varadarajan
    Market Equilibrium for CES Exchange Economies: Existence, Multiplicity, and Computation. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:505-516 [Conf]
  42. Radha Jagadeesan, Gopalan Nadathur, Vijay A. Saraswat
    Testing Concurrent Systems: An Interpretation of Intuitionistic Logic. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:517-528 [Conf]
  43. Toshiyasu Arai, Georg Moser
    Proofs of Termination of Rewrite Systems for Polytime Functions. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:529-540 [Conf]
  44. Antonín Kucera, Oldrich Strazovský
    On the Controller Synthesis for Finite-State Markov Decision Processes. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:541-552 [Conf]
  45. Ellie D'Hondt, Prakash Panangaden
    Reasoning About Quantum Knowledge. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:553-564 [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