↓ Skip to main content

FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 The Multicore Revolution
  3. Altmetric Badge
    Chapter 2 Streaming Algorithms for Selection and Approximate Sorting
  4. Altmetric Badge
    Chapter 3 Adventures in Bidirectional Programming
  5. Altmetric Badge
    Chapter 4 Program Analysis Using Weighted Pushdown Systems
  6. Altmetric Badge
    Chapter 5 The Complexity of Zero Knowledge
  7. Altmetric Badge
    Chapter 6 The Priority k -Median Problem
  8. Altmetric Badge
    Chapter 7 “Rent-or-Buy” Scheduling and Cost Coloring Problems
  9. Altmetric Badge
    Chapter 8 Order Scheduling Models: Hardness and Algorithms
  10. Altmetric Badge
    Chapter 9 On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography
  11. Altmetric Badge
    Chapter 10 Key Substitution in the Symbolic Analysis of Cryptographic Protocols
  12. Altmetric Badge
    Chapter 11 Symbolic Bisimulation for the Applied Pi Calculus
  13. Altmetric Badge
    Chapter 12 Non-mitotic Sets
  14. Altmetric Badge
    Chapter 13 Reductions to Graph Isomorphism
  15. Altmetric Badge
    Chapter 14 Strong Reductions and Isomorphism of Complete Sets
  16. Altmetric Badge
    Chapter 15 Probabilistic and Topological Semantics for Timed Automata
  17. Altmetric Badge
    Chapter 16 A Theory for Game Theories
  18. Altmetric Badge
    Chapter 17 An Incremental Bisimulation Algorithm
  19. Altmetric Badge
    Chapter 18 Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs
  20. Altmetric Badge
    Chapter 19 Communication Lower Bounds Via the Chromatic Number
  21. Altmetric Badge
    Chapter 20 The Deduction Theorem for Strong Propositional Proof Systems
  22. Altmetric Badge
    Chapter 21 Satisfiability of Algebraic Circuits over Sets of Natural Numbers
  23. Altmetric Badge
    Chapter 22 Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems
  24. Altmetric Badge
    Chapter 23 Synthesis of Safe Message-Passing Systems
  25. Altmetric Badge
    Chapter 24 Automata and Logics for Timed Message Sequence Charts
  26. Altmetric Badge
    Chapter 25 Propositional Dynamic Logic for Message-Passing Systems
  27. Altmetric Badge
    Chapter 26 Better Algorithms and Bounds for Directed Maximum Leaf Problems
  28. Altmetric Badge
    Chapter 27 Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs
  29. Altmetric Badge
    Chapter 28 Covering Graphs with Few Complete Bipartite Subgraphs
  30. Altmetric Badge
    Chapter 29 Safely Composing Security Protocols
  31. Altmetric Badge
    Chapter 30 Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption
  32. Altmetric Badge
    Chapter 31 Bounding Messages for Free in Security Protocols
  33. Altmetric Badge
    Chapter 32 Triangulations of Line Segment Sets in the Plane
  34. Altmetric Badge
    Chapter 33 Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections
  35. Altmetric Badge
    Chapter 34 Finding a Rectilinear Shortest Path in R 2 Using Corridor Based Staircase Structures
  36. Altmetric Badge
    Chapter 35 Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space
  37. Altmetric Badge
    Chapter 36 Stochastic Müller Games are PSPACE-Complete
  38. Altmetric Badge
    Chapter 37 Solving Parity Games in Big Steps
  39. Altmetric Badge
    Chapter 38 Efficient and Expressive Tree Filters
  40. Altmetric Badge
    Chapter 39 Markov Decision Processes with Multiple Long-Run Average Objectives
  41. Altmetric Badge
    Chapter 40 A Formal Investigation of Diff3
  42. Altmetric Badge
    Chapter 41 Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem
  43. Altmetric Badge
    Chapter 42 Undirected Graphs of Entanglement 2
  44. Altmetric Badge
    Chapter 43 Acceleration in Convex Data-Flow Analysis
  45. Altmetric Badge
    Chapter 44 Model Checking Almost All Paths Can Be Less Expensive Than Checking All Paths
  46. Altmetric Badge
    Chapter 45 Closures and Modules Within Linear Logic Concurrent Constraint Programming
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 X user
wikipedia
3 Wikipedia pages

Citations

dimensions_citation
7 Dimensions

Readers on

mendeley
3 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 2007: Foundations of Software Technology and Theoretical Computer Science
Published by
Springer Science & Business Media, November 2007
DOI 10.1007/978-3-540-77050-3
ISBNs
978-3-54-077049-7, 978-3-54-077050-3
Editors

Arvind, V., Prasad, Sanjiva, Arvind, V., Prasad, Sanjiva

X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 3 100%

Demographic breakdown

Readers by professional status Count As %
Professor 1 33%
Student > Master 1 33%
Student > Doctoral Student 1 33%
Readers by discipline Count As %
Computer Science 2 67%
Mathematics 1 33%