Skip to main content
SpringerLink
Log in
Book cover

Computer Science -- Theory and Applications

7th International Computer Science Symposium in Russia, CSR 2012, Niszhny Novgorod, Russia, July 3-7, 2012, Proceedings

  • Conference proceedings
  • © 2012

Overview

Editors:
  1. Edward A. Hirsch

    1. Steklov Institute of Mathematics at St.Petersburg, St. Petersburg, Russia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Juhani Karhumäki

    1. University of Turku, Turku, Finland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Arto Lepistö

    1. University of Turku, Turku, Finland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Michail Prilutskii

    1. Lobachevky State University of Nizhni Novgorod, Niszhi Novgorod, Russia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Up-to-date results
  • Fast-track conference proceedings
  • State-of-the-art research

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

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

Included in the following conference series:

Conference proceedings info: CSR 2012.

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

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

Table of contents (29 papers)

  1. Front Matter

    Download chapter PDF

  3. Full Papers

    1. Resilient Quicksort and Selection

      • Maxim Babenko, Ivan Pouzyrevsky
      Pages 6-17

    2. General Quantitative Specification Theories with Modalities

      • Sebastian S. Bauer, Uli Fahrenberg, Axel Legay, Claus Thrane
      Pages 18-30

    3. The Complexity of Intersecting Finite Automata Having Few Final States

      • Michael Blondin, Pierre McKenzie
      Pages 31-42

    4. News about Semiantichains and Unichain Coverings

      • Bartłomiej Bosek, Stefan Felsner, Kolja Knauer, Grzegorz Matecki
      Pages 43-51

    5. Checking Tests for Read-Once Functions over Arbitrary Bases

      • Dmitry V. Chistikov
      Pages 52-63

    6. Approximating Minimum Power Edge-Multi-Covers

      • Nachshon Cohen, Zeev Nutov
      Pages 64-75

    7. A Lower Bound on Circuit Complexity of Vector Function in U 2

      • Evgeny Demenkov
      Pages 76-80

    8. Computing All MOD-Functions Simultaneously

      • Evgeny Demenkov, Alexander S. Kulikov, Ivan Mihajlin, Hiroki Morizumi
      Pages 81-88

    9. Bounded Synchronization Delay in Omega-Rational Expressions

      • Volker Diekert, Manfred Kufleitner
      Pages 89-98

    10. Towards Optimal Degree-Distributions for Left-Perfect Matchings in Random Bipartite Graphs

      • Martin Dietzfelbinger, Michael Rink
      Pages 99-111

    11. Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGs

      • Stefan Dobrev, Evangelos Kranakis, Oscar Morales Ponce, Milan Plžík
      Pages 112-124

    12. Worst-Case Optimal Priority Queues via Extended Regular Counters

      • Amr Elmasry, Jyrki Katajainen
      Pages 125-137

    13. The Complexity of Minor-Ancestral Graph Properties with Forbidden Pairs

      • Eli Fox-Epstein, Danny Krizanc
      Pages 138-147

    14. Satisfiability Thresholds beyond k −XORSAT

      • Andreas Goerdt, Lutz Falke
      Pages 148-159

    15. Finding Vertex-Surjective Graph Homomorphisms

      • Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma
      Pages 160-171

    16. Broadcast Domination on Block Graphs in Linear Time

      • Pinar Heggernes, Sigve H. Sæther
      Pages 172-183

    17. Characterizing Certain Topological Specifications

      • Bernhard Heinemann
      Pages 184-195

    18. Descriptional Complexity of Operations on Alternating and Boolean Automata

      • Galina Jirásková
      Pages 196-204
Back to top

Other volumes

  1. Computer Science – Theory and Applications

Keywords

About this book

This book constitutes the proceedings of the 7th International Computer Science Symposium in Russia, CSR 2012, held in Nizhny Novgorod in July 2012. The 28 full papers presented in this volume were carefully reviewed and selected from 66 submissions. CSR 2012 was one of the events of the Alan Turing Year 2012, the topics dealt with cover substantial parts of theoretical computer science and its applications.

Editors and Affiliations

  • Steklov Institute of Mathematics at St.Petersburg, St. Petersburg, Russia

    Edward A. Hirsch

  • University of Turku, Turku, Finland

    Juhani Karhumäki, Arto Lepistö

  • Lobachevky State University of Nizhni Novgorod, Niszhi Novgorod, Russia

    Michail Prilutskii

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation