Skip to main content
  • Conference proceedings
  • © 2007

Computer Science - Theory and Applications

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

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 4649)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): CSR: International Computer Science Symposium in Russia

Conference proceedings info: CSR 2007.

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (41 papers)

  1. Front Matter

  2. Proving Church’s Thesis

    • Yuri Gurevich
    Pages 1-3
  3. The Limits of Quantum Computers

    • Scott Aaronson
    Pages 4-4
  4. Marrying Words and Trees

    • Rajeev Alur
    Pages 5-5
  5. TPTP, TSTP, CASC, etc.

    • Geoff Sutcliffe
    Pages 6-22
  6. Sequences of Level 1, 2, 3,..., k,...

    • Géraud Sénizergues
    Pages 24-32
  7. Timers and Proximities for Mobile Ambients

    • Bogdan Aman, Gabriel Ciobanu
    Pages 33-43
  8. Pushing Random Walk Beyond Golden Ratio

    • Ehsan Amiri, Evgeny Skvortsov
    Pages 44-55
  9. Reversible Machine Code and Its Abstract Processor Architecture

    • Holger Bock Axelsen, Robert Glück, Tetsuo Yokoyama
    Pages 56-69
  10. A Fast Algorithm for Path 2-Packing Problem

    • Maxim A. Babenko
    Pages 70-81
  11. Decidability of Parameterized Probabilistic Information Flow

    • Danièle Beauquier, Marie Duflot, Yury Lifshits
    Pages 82-91
  12. Inverting Onto Functions and Polynomial Hierarchy

    • Harry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolay Vereshchagin
    Pages 92-103
  13. Proved-Patterns-Based Development for Structured Programs

    • Dominique Cansell, Dominique Méry
    Pages 104-114
  14. Planarity, Determinants, Permanents, and (Unique) Matchings

    • Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan
    Pages 115-126
  15. Equivalence Problems for Circuits over Sets of Natural Numbers

    • Christian Glaßer, Katrin Herr, Christian Reitwießner, Stephen Travers, Matthias Waldherr
    Pages 127-138
  16. Bouillon: A Wiki-Wiki Social Web

    • Victor Grishchenko
    Pages 139-145
  17. A PDL-Like Logic of Knowledge Acquisition

    • Bernhard Heinemann
    Pages 146-157
  18. Resource Placement in Networks Using Chromatic Sets of Power Graphs

    • Navid Imani, Hamid Sarbazi-Azad, Selim G. Akl
    Pages 158-167

Other Volumes

  1. Computer Science – Theory and Applications

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access