Skip to main content
  • Conference proceedings
  • © 2009

Computer Science - Theory and Applications

Fourth International Computer Science Symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18-23, 2009, Proceedings

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

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 2009.

Buying options

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (33 papers)

  1. Front Matter

  2. Invited Papers

    1. Well-Founded and Partial Stable Semantics Logical Aspects

      • Pedro Cabalar, Sergei Odintsov, David Pearce
      Pages 1-11
    2. The Reachability Problem over Infinite Graphs

      • Wolfgang Thomas
      Pages 12-18
    3. Kolmogorov Complexity and Model Selection

      • Nikolay Vereshchagin
      Pages 19-24
  3. Accepted Papers

    1. Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism

      • Arnon Avron, Agata Ciabattoni, Anna Zamansky
      Pages 26-37
    2. Integrality Property in Preemptive Parallel Machine Scheduling

      • Philippe Baptiste, Jacques Carlier, Alexander Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko
      Pages 38-46
    3. k-SAT Is No Harder Than Decision-Unique-k-SAT

      • Chris Calabro, Ramamohan Paturi
      Pages 59-70
    4. Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model

      • Yi Deng, Giovanni Di Crescenzo, Dongdai Lin, Dengguo Feng
      Pages 80-91
    5. Approximability Distance in the Space of H-Colourability Problems

      • Tommy Färnqvist, Peter Jonsson, Johan Thapper
      Pages 92-104
    6. On Random Ordering Constraints

      • Andreas Goerdt
      Pages 105-116
    7. A Feebly Secure Trapdoor Function

      • Edward A. Hirsch, Sergey I. Nikolenko
      Pages 129-142
    8. Partitioning Graphs into Connected Parts

      • Pim van ’t Hof, Daniël Paulusma, Gerhard J. Woeginger
      Pages 143-154
    9. Structural Complexity of AvgBPP

      • Dmitry Itsykson
      Pages 155-166
    10. One-Nonterminal Conjunctive Grammars over a Unary Alphabet

      • Artur Jeż, Alexander Okhotin
      Pages 191-202

Other Volumes

  1. Computer Science - Theory and Applications

Keywords

  • Alphabet
  • Erfüllbarkeitsproblem der Aussagenlogik
  • Graph
  • algorithm analysis
  • automata theory
  • classification
  • complexity
  • computability
  • cryptography
  • formal language
  • linear optimization
  • logic
  • satisfiability
  • verification
  • word problems
  • algorithm analysis and problem complexity

Editors and Affiliations

  • Sobolev Institute of Mathematics SB RAS, Novosibirsk, Russia

    Anna Frid, Andrey Morozov

  • Max Planck Institute for Software Systems, Saarbrücken, Germany

    Andrey Rybalchenko

  • Lehrstuhl für Theoretische Informatik, Institut für Informatik, Julius-Maximilians-Universität Würzburg, Am Hubland, Würzburg, Germany

    Klaus W. Wagner

Bibliographic Information

Buying options

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions