Computer Science – Theory and Applications

Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007. Proceedings

Editors:

ISBN: 978-3-540-74509-9 (Print) 978-3-540-74510-5 (Online)

Table of contents (41 chapters)

previous Page of 3
  1. Front Matter

    Pages -

  2. No Access

    Book Chapter

    Pages 1-3

    Proving Church’s Thesis

  3. No Access

    Book Chapter

    Pages 4-4

    The Limits of Quantum Computers

  4. No Access

    Book Chapter

    Pages 5-5

    Marrying Words and Trees

  5. No Access

    Book Chapter

    Pages 6-22

    TPTP, TSTP, CASC, etc.

  6. No Access

    Book Chapter

    Pages 23-23

    Abstract Modeling and Formal Verification of Microprocessors

  7. No Access

    Book Chapter

    Pages 24-32

    Sequences of Level 1, 2, 3,..., k ,...

  8. No Access

    Book Chapter

    Pages 33-43

    Timers and Proximities for Mobile Ambients

  9. No Access

    Book Chapter

    Pages 44-55

    Pushing Random Walk Beyond Golden Ratio

  10. No Access

    Book Chapter

    Pages 56-69

    Reversible Machine Code and Its Abstract Processor Architecture

  11. No Access

    Book Chapter

    Pages 70-81

    A Fast Algorithm for Path 2-Packing Problem

  12. No Access

    Book Chapter

    Pages 82-91

    Decidability of Parameterized Probabilistic Information Flow

  13. No Access

    Book Chapter

    Pages 92-103

    Inverting Onto Functions and Polynomial Hierarchy

  14. No Access

    Book Chapter

    Pages 104-114

    Proved-Patterns-Based Development for Structured Programs

  15. No Access

    Book Chapter

    Pages 115-126

    Planarity, Determinants, Permanents, and (Unique) Matchings

  16. No Access

    Book Chapter

    Pages 127-138

    Equivalence Problems for Circuits over Sets of Natural Numbers

  17. No Access

    Book Chapter

    Pages 139-145

    Bouillon: A Wiki-Wiki Social Web

  18. No Access

    Book Chapter

    Pages 146-157

    A PDL-Like Logic of Knowledge Acquisition

  19. No Access

    Book Chapter

    Pages 158-167

    Resource Placement in Networks Using Chromatic Sets of Power Graphs

  20. No Access

    Book Chapter

    Pages 168-181

    Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth

  21. No Access

    Book Chapter

    Pages 182-193

    Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems

previous Page of 3