Advertisement

Computer Science – Theory and Applications

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

  • Edward A. Hirsch
  • Juhani Karhumäki
  • Arto Lepistö
  • Michail Prilutskii
Conference proceedings CSR 2012

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

Table of contents

  1. Front Matter
    PDF

  2. Opening Talk

    1. Can the Theory of Algorithms Ratify the “Invisible Hand of the Market”?
      Vijay V. Vazirani
      Pages 1-5

  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 U2
      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
    19. Consistency of Multidimensional Combinatorial Substitutions
      Timo Jolivet, Jarkko Kari
      Pages 205-216
    20. Two-Way Automata Characterizations of L/poly versus NL
      Christos A. Kapoutsis, Giovanni Pighizzini
      Pages 217-228
    21. Cutting through Regular Post Embedding Problems
      Prateek Karandikar, Philippe Schnoebelen
      Pages 229-240
    22. On the Advice Complexity of the Set Cover Problem
      Dennis Komm, Richard Královič, Tobias Mömke
      Pages 241-252
    23. Constraint Satisfaction with Counting Quantifiers
      Florent Madelaine, Barnaby Martin, Juraj Stacho
      Pages 253-265
    24. Space-Bounded Kolmogorov Extractors
      Daniil Musatov
      Pages 266-277
    25. Some Results on more Flexible Versions of Graph Motif
      Romeo Rizzi, Florian Sikora
      Pages 278-289
    26. A Characterization of Cellular Automata Generated by Idempotents on the Full Shift
      Ville Salo
      Pages 290-301
    27. Constructing Polynomials for Functions over Residue Rings Modulo a Composite Number in Linear Time
      Svetlana N. Selezneva
      Pages 302-313
    28. Boolean Composition of Visual Secret Sharing Schemes
      Hans Ulrich Simon
      Pages 314-325
  4. Back Matter
    PDF

About these proceedings

Introduction

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

Keywords

algorithm analysis automata theory complexity computability turing machine

Editors and affiliations

  • Edward A. Hirsch
    • 1
  • Juhani Karhumäki
    • 2
  • Arto Lepistö
    • 2
  • Michail Prilutskii
    • 3
  1. 1.Steklov Institute of Mathematics at St.PetersburgSt. PetersburgRussia
  2. 2.University of TurkuTurkuFinland
  3. 3.Lobachevky State University of Nizhni NovgorodNiszhi NovgorodRussia

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-30642-6
  • Copyright Information Springer-Verlag Berlin Heidelberg 2012
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-30641-9
  • Online ISBN 978-3-642-30642-6
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Biotechnology
Finance, Business & Banking
Electronics
IT & Software
Telecommunications
Energy, Utilities & Environment
Engineering