↓ Skip to main content
What is this page? Embed badge

FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

Overview of attention for book
Cover of 'FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Genome Halving Problem Revisited
  3. Altmetric Badge
    Chapter 2 Verifying Probabilistic Procedural Programs
  4. Altmetric Badge
    Chapter 3 Streaming Algorithms for Geometric Problems
  5. Altmetric Badge
    Chapter 4 Toward a Grainless Semantics for Shared-Variable Concurrency
  6. Altmetric Badge
    Chapter 5 Regular Languages, Unambiguous Concatenation and Computational Complexity
  7. Altmetric Badge
    Chapter 6 Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri Nets
  8. Altmetric Badge
    Chapter 7 On the Urgency Expressiveness
  9. Altmetric Badge
    Chapter 8 Asynchronous Automata-Theoretic Characterization of Aperiodic Trace Languages
  10. Altmetric Badge
    Chapter 9 A Decidable Fragment of Separation Logic
  11. Altmetric Badge
    Chapter 10 Approximate Range Searching Using Binary Space Partitions
  12. Altmetric Badge
    Chapter 11 Representable Disjoint NP-Pairs
  13. Altmetric Badge
    Chapter 12 Symbolic Reachability Analysis of Higher-Order Context-Free Processes
  14. Altmetric Badge
    Chapter 13 Optimal Strategies in Priced Timed Game Automata
  15. Altmetric Badge
    Chapter 14 A Calculus for Trust Management
  16. Altmetric Badge
    Chapter 15 Short-Cuts on Star, Source and Planar Unfoldings
  17. Altmetric Badge
    Chapter 16 Subdividing Alpha Complex
  18. Altmetric Badge
    Chapter 17 Real-Counter Automata and Their Decision Problems
  19. Altmetric Badge
    Chapter 18 FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
  20. Altmetric Badge
    Chapter 19 On the Bisimulation Invariant Fragment of Monadic Σ1 in the Finite
  21. Altmetric Badge
    Chapter 20 On the Complexity of Hilbert’s 17th Problem
  22. Altmetric Badge
    Chapter 21 Who is Pointing When to Whom?
  23. Altmetric Badge
    Chapter 22 An Almost Linear Time Approximation Algorithm for the Permanent of a Random (0-1) Matrix
  24. Altmetric Badge
    Chapter 23 Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems
  25. Altmetric Badge
    Chapter 24 Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS
  26. Altmetric Badge
    Chapter 25 Minimum Weight Pseudo-Triangulations
  27. Altmetric Badge
    Chapter 26 Join Algorithms for the Theory of Uninterpreted Functions
  28. Altmetric Badge
    Chapter 27 No, Coreset, No Cry
  29. Altmetric Badge
    Chapter 28 Hardness Hypotheses, Derandomization, and Circuit Complexity
  30. Altmetric Badge
    Chapter 29 Improved Approximation Algorithms for Maximum Graph Partitioning Problems Extended Abstract
  31. Altmetric Badge
    Chapter 30 Learning Languages from Positive Data and a Finite Number of Queries
  32. Altmetric Badge
    Chapter 31 The Complexity of the Local Hamiltonian Problem
  33. Altmetric Badge
    Chapter 32 Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds
  34. Altmetric Badge
    Chapter 33 Adaptive Stabilization of Reactive Protocols
  35. Altmetric Badge
    Chapter 34 Visibly Pushdown Games
  36. Altmetric Badge
    Chapter 35 Refinement and Separation Contexts
  37. Altmetric Badge
    Chapter 36 Decidability of MSO Theories of Tree Structures
  38. Altmetric Badge
    Chapter 37 Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
  39. Altmetric Badge
    Chapter 38 Monotone Multilinear Boolean Circuits for Bipartite Perfect Matching Require Exponential Size
  40. Altmetric Badge
    Chapter 39 Testing Geometric Convexity
  41. Altmetric Badge
    Chapter 40 Complexity of Linear Connectivity Problems in Directed Hypergraphs
  42. Altmetric Badge
    Chapter 41 Actively Learning to Verify Safety for FIFO Automata
  43. Altmetric Badge
    Chapter 42 Reasoning About Game Equilibria Using Temporal Logic
  44. Altmetric Badge
    Chapter 43 Alternation in Equational Tree Automata Modulo XOR
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • In the top 25% of all research outputs scored by Altmetric
  • High Attention Score compared to outputs of the same age (93rd percentile)
  • High Attention Score compared to outputs of the same age and source (91st percentile)

Mentioned by

blogs
1 blog
wikipedia
3 Wikipedia pages

Citations

dimensions_citation
5 Dimensions

Readers on

mendeley
1 Mendeley
Summary Blogs Wikipedia Dimensions citations
So far, Altmetric has seen 2 posts from 1 blogs.

This page shows the most recent blog posts that mention this research output.

Click here to find out how to access more activity.

This page is provided by Altmetric.