↓ Skip to main content

FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science : 21st Conference Bangalore, India, December 13–15, 2001 Proceedings

Overview of attention for book
Cover of 'FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science : 21st Conference Bangalore, India, December 13–15, 2001 Proceedings'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity
  3. Altmetric Badge
    Chapter 2 Approximation Schemes for Geometric NP-Hard Problems: A Survey
  4. Altmetric Badge
    Chapter 3 On Clustering Using Random Walks
  5. Altmetric Badge
    Chapter 4 An Introduction to Decidability of DPDA Equivalence
  6. Altmetric Badge
    Chapter 5 Semidefinite Programming Based Approximation Algorithms
  7. Altmetric Badge
    Chapter 6 Hard Sets and Pseudo-random Generators for Constant Depth Circuits
  8. Altmetric Badge
    Chapter 7 The First-Order Isomorphism Theorem
  9. Altmetric Badge
    Chapter 8 Thresholds and Optimal Binary Comparison Search Trees
  10. Altmetric Badge
    Chapter 9 Distributed LTL Model Checking Based on Negative Cycle Detection
  11. Altmetric Badge
    Chapter 10 Computability and Complexity Results for a Spatial Assertion Language for Data Structures
  12. Altmetric Badge
    Chapter 11 Using Nondeterminism to Design Efficient Deterministic Algorithms
  13. Altmetric Badge
    Chapter 12 Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter
  14. Altmetric Badge
    Chapter 13 A Mechanically Verified Compiling Specification for a Lisp Compiler
  15. Altmetric Badge
    Chapter 14 Beyond Regular Model Checking
  16. Altmetric Badge
    Chapter 15 Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity
  17. Altmetric Badge
    Chapter 16 Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel
  18. Altmetric Badge
    Chapter 17 List Decoding from Erasures: Bounds and Code Constructions
  19. Altmetric Badge
    Chapter 18 Verification of a Leader Election Algorithm in Timed Asynchronous Systems
  20. Altmetric Badge
    Chapter 19 Efficient Addition on Field Programmable Gate Arrays
  21. Altmetric Badge
    Chapter 20 The Directed Minimum-Degree Spanning Tree Problem
  22. Altmetric Badge
    Chapter 21 I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems
  23. Altmetric Badge
    Chapter 22 Beyond Message Sequence Graphs
  24. Altmetric Badge
    Chapter 23 Grouping Techniques for One Machine Scheduling Subject to Precedence Constraints
  25. Altmetric Badge
    Chapter 24 Properties of Distributed Timed-Arc Petri Nets
  26. Altmetric Badge
    Chapter 25 From Falsification to Verification
  27. Altmetric Badge
    Chapter 26 On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems
  28. Altmetric Badge
    Chapter 27 Range Allocation for Equivalence Logic
  29. Altmetric Badge
    Chapter 28 Rewrite Closure for Ground and Cancellative AC Theories
Attention for Chapter 10: Computability and Complexity Results for a Spatial Assertion Language for Data Structures
Altmetric Badge

Readers on

mendeley
16 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.
Chapter title
Computability and Complexity Results for a Spatial Assertion Language for Data Structures
Chapter number 10
Book title
FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science
Published by
Springer, Berlin, Heidelberg, December 2001
DOI 10.1007/3-540-45294-x_10
Book ISBNs
978-3-54-043002-5, 978-3-54-045294-2
Authors

Cristiano Calcagno, Hongseok Yang, Peter W. O’Hearn, Calcagno, Cristiano, Yang, Hongseok, O’Hearn, Peter W.

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
India 1 6%
Vietnam 1 6%
Unknown 14 88%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 5 31%
Student > Bachelor 3 19%
Researcher 2 13%
Student > Postgraduate 2 13%
Professor > Associate Professor 1 6%
Other 1 6%
Unknown 2 13%
Readers by discipline Count As %
Computer Science 14 88%
Unknown 2 13%