↓ Skip to main content

FSTTCS 2005 : foundations of software technology and theoretical computer science : 25th international conference, Hyderabad, India, December 15-18, 2005 : proceedings

Overview of attention for book
Cover of 'FSTTCS 2005 : foundations of software technology and theoretical computer science : 25th international conference, Hyderabad, India, December 15-18, 2005 : proceedings'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Semiperfect-Information Games
  3. Altmetric Badge
    Chapter 2 Computational Complexity Since 1980
  4. Altmetric Badge
    Chapter 3 Developments in Data Structure Research During the First 25 Years of FSTTCS
  5. Altmetric Badge
    Chapter 4 Inference Systems for Logical Algorithms
  6. Altmetric Badge
    Chapter 5 From Logic to Games
  7. Altmetric Badge
    Chapter 6 Proving Lower Bounds Via Pseudo-random Generators
  8. Altmetric Badge
    Chapter 7 Erdős Magic
  9. Altmetric Badge
    Chapter 8 No Coreset, No Cry: II
  10. Altmetric Badge
    Chapter 9 Improved Bounds on the Union Complexity of Fat Objects
  11. Altmetric Badge
    Chapter 10 On the Bisimulation Congruence in χ -Calculus
  12. Altmetric Badge
    Chapter 11 Extending Howe’s Method to Early Bisimulations for Typed Mobile Embedded Resources with Local Names
  13. Altmetric Badge
    Chapter 12 Approximation Algorithms for Wavelength Assignment
  14. Altmetric Badge
    Chapter 13 The Set Cover with Pairs Problem
  15. Altmetric Badge
    Chapter 14 Non-disclosure for Distributed Mobile Code
  16. Altmetric Badge
    Chapter 15 Quantitative Models and Implicit Complexity
  17. Altmetric Badge
    Chapter 16 The MSO Theory of Connectedly Communicating Processes
  18. Altmetric Badge
    Chapter 17 Reachability of Hennessy-Milner Properties for Weakly Extended PRS
  19. Altmetric Badge
    Chapter 18 Decision Procedures for Queues with Integer Constraints
  20. Altmetric Badge
    Chapter 19 The Directed Planar Reachability Problem
  21. Altmetric Badge
    Chapter 20 Dimensions of Copeland-Erdös Sequences
  22. Altmetric Badge
    Chapter 21 Refining the Undecidability Frontier of Hybrid Automata
  23. Altmetric Badge
    Chapter 22 When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets?
  24. Altmetric Badge
    Chapter 23 Subquadratic Algorithms for Workload-Aware Haar Wavelet Synopses
  25. Altmetric Badge
    Chapter 24 Practical Algorithms for Tracking Database Join Sizes
  26. Altmetric Badge
    Chapter 25 On Sampled Semantics of Timed Systems
  27. Altmetric Badge
    Chapter 26 Eventual Timed Automata
  28. Altmetric Badge
    Chapter 27 Causal Closure for MSC Languages
  29. Altmetric Badge
    Chapter 28 Reachability Analysis of Multithreaded Software with Asynchronous Communication
  30. Altmetric Badge
    Chapter 29 Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem
  31. Altmetric Badge
    Chapter 30 Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains
  32. Altmetric Badge
    Chapter 31 Towards a CTL* Tableau
  33. Altmetric Badge
    Chapter 32 Bisimulation Quantified Logics: Undecidability
  34. Altmetric Badge
    Chapter 33 Logarithmic-Time Single Deleter, Multiple Inserter Wait-Free Queues and Stacks
  35. Altmetric Badge
    Chapter 34 Monitoring Stable Properties in Dynamic Peer-to-Peer Distributed Systems
  36. Altmetric Badge
    Chapter 35 On the Expressiveness of TPTL and MTL
  37. Altmetric Badge
    Chapter 36 Modal Strength Reduction in Quantified Discrete Duration Calculus
  38. Altmetric Badge
    Chapter 37 Comparing Trees Via Crossing Minimization
  39. Altmetric Badge
    Chapter 38 On Counting the Number of Consistent Genotype Assignments for Pedigrees
  40. Altmetric Badge
    Chapter 39 Fixpoint Logics on Hierarchical Structures
  41. Altmetric Badge
    Chapter 40 The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable
  42. Altmetric Badge
    Chapter 41 Market Equilibrium for CES Exchange Economies: Existence, Multiplicity, and Computation
  43. Altmetric Badge
    Chapter 42 Testing Concurrent Systems: An Interpretation of Intuitionistic Logic
  44. Altmetric Badge
    Chapter 43 Proofs of Termination of Rewrite Systems for Polytime Functions
  45. Altmetric Badge
    Chapter 44 On the Controller Synthesis for Finite-State Markov Decision Processes
  46. Altmetric Badge
    Chapter 45 Reasoning About Quantum Knowledge
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

wikipedia
2 Wikipedia pages

Readers on

mendeley
2 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
FSTTCS 2005 : foundations of software technology and theoretical computer science : 25th international conference, Hyderabad, India, December 15-18, 2005 : proceedings
Published by
Springer, January 2005
DOI 10.1007/11590156
ISBNs
978-3-54-030495-1, 978-3-54-032419-5
Authors

Ramanujam, R, Sen, Sandeep

Editors

Sarukkai, Sundar, Sen, Sandeep, Sarukkai, Sundar, Sen, Sandeep

Mendeley readers

The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Professor > Associate Professor 1 50%
Lecturer 1 50%
Readers by discipline Count As %
Mathematics 1 50%
Agricultural and Biological Sciences 1 50%