default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCSR 2012: Nizhny Novgorod, Russia
- Edward A. Hirsch, Juhani Karhumäki, Arto Lepistö, Michail Kh. Prilutskii:
Computer Science - Theory and Applications - 7th International Computer Science Symposium in Russia, CSR 2012, Nizhny Novgorod, Russia, July 3-7, 2012. Proceedings. Lecture Notes in Computer Science 7353, Springer 2012, ISBN 978-3-642-30641-9
Opening Talk
- Vijay V. Vazirani:
Can the Theory of Algorithms Ratify the "Invisible Hand of the Market"? 1-5
Full Papers
- Maxim A. Babenko, Ivan Pouzyrevsky
:
Resilient Quicksort and Selection. 6-17 - Sebastian S. Bauer, Uli Fahrenberg, Axel Legay, Claus R. Thrane:
General Quantitative Specification Theories with Modalities. 18-30 - Michael Blondin, Pierre McKenzie:
The Complexity of Intersecting Finite Automata Having Few Final States. 31-42 - Bartlomiej Bosek, Stefan Felsner, Kolja B. Knauer, Grzegorz Matecki:
News about Semiantichains and Unichain Coverings. 43-51 - Dmitry V. Chistikov:
Checking Tests for Read-Once Functions over Arbitrary Bases. 52-63 - Nachshon Cohen, Zeev Nutov:
Approximating Minimum Power Edge-Multi-Covers. 64-75 - Evgeny Demenkov:
A Lower Bound on Circuit Complexity of Vector Function in U 2. 76-80 - Evgeny Demenkov, Alexander S. Kulikov, Ivan Mihajlin, Hiroki Morizumi:
Computing All MOD-Functions Simultaneously. 81-88 - Volker Diekert, Manfred Kufleitner:
Bounded Synchronization Delay in Omega-Rational Expressions. 89-98 - Martin Dietzfelbinger, Michael Rink:
Towards Optimal Degree-Distributions for Left-Perfect Matchings in Random Bipartite Graphs. 99-111 - Stefan Dobrev, Evangelos Kranakis, Oscar Morales-Ponce, Milan Plzík:
Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGs. 112-124 - Amr Elmasry, Jyrki Katajainen:
Worst-Case Optimal Priority Queues via Extended Regular Counters. 125-137 - Eli Fox-Epstein, Danny Krizanc:
The Complexity of Minor-Ancestral Graph Properties with Forbidden Pairs. 138-147 - Andreas Goerdt, Lutz Falke:
Satisfiability Thresholds beyond k -XORSAT. 148-159 - Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma:
Finding Vertex-Surjective Graph Homomorphisms. 160-171 - Pinar Heggernes, Sigve Hortemo Sæther:
Broadcast Domination on Block Graphs in Linear Time. 172-183 - Bernhard Heinemann:
Characterizing Certain Topological Specifications. 184-195 - Galina Jirásková:
Descriptional Complexity of Operations on Alternating and Boolean Automata. 196-204 - Timo Jolivet, Jarkko Kari:
Consistency of Multidimensional Combinatorial Substitutions. 205-216 - Christos A. Kapoutsis, Giovanni Pighizzini:
Two-Way Automata Characterizations of L/poly versus NL. 217-228 - Prateek Karandikar, Philippe Schnoebelen:
Cutting through Regular Post Embedding Problems. 229-240 - Dennis Komm, Richard Královic, Tobias Mömke:
On the Advice Complexity of the Set Cover Problem. 241-252 - Florent R. Madelaine, Barnaby Martin, Juraj Stacho:
Constraint Satisfaction with Counting Quantifiers. 253-265 - Daniil Musatov:
Space-Bounded Kolmogorov Extractors. 266-277 - Romeo Rizzi, Florian Sikora:
Some Results on more Flexible Versions of Graph Motif. 278-289 - Ville Salo:
A Characterization of Cellular Automata Generated by Idempotents on the Full Shift. 290-301 - Svetlana N. Selezneva:
Constructing Polynomials for Functions over Residue Rings Modulo a Composite Number in Linear Time. 302-313 - Hans Ulrich Simon:
Boolean Composition of Visual Secret Sharing Schemes. 314-325
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-05 20:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
