default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCSR 2010: Kazan, Russia
- Farid M. Ablayev, Ernst W. Mayr:
Computer Science - Theory and Applications, 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010. Proceedings. Lecture Notes in Computer Science 6072, Springer 2010, ISBN 978-3-642-13181-3 - Susanne Albers:
Algorithms for Energy Management. 1-11 - Nathalie Aubrun, Marie-Pierre Béal:
Sofic and Almost of Finite Type Tree-Shifts. 12-24 - Nazim Benaïssa, Dominique Méry:
Proof-Based Design of Security Protocols. 25-36 - Mikhail V. Berlinkov
:
Approximating the Minimum Length of Synchronizing Words Is Hard. 37-47 - Benedikt Bollig, Loïc Hélouët:
Realizability of Dynamic MSC Languages. 48-59 - Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos, O. Pottié:
The max quasi-independent set Problem. 60-71 - Thomas Brihaye, Véronique Bruyère, Julie De Pril:
Equilibria in Quantitative Reachability Games. 72-83 - Janusz A. Brzozowski, Galina Jirásková, Chenglong Zou:
Quotient Complexity of Closed Languages. 84-95 - Olivier Carton:
Right-Sequential Functions on Infinite Words. 96-106 - Fedor V. Fomin:
Kernelization. 107-108 - Anahí Gajardo, Pierre Guillon:
Zigzags in Turing Machines. 109-119 - James Gate, Iain A. Stewart:
Frameworks for Logically Classifying Polynomial-Time Optimisation Problems. 120-131 - Pawel Gawrychowski, Artur Jez, Lukasz Jez:
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online. 132-143 - R. A. Gimadeev, Mikhail N. Vyalyi:
Identical Relations in Symmetric Groups and Separating Words with Reversible Automata. 144-155 - Nick Gravin:
Time Optimal d-List Colouring of a Graph. 156-168 - Bernhard Heinemann:
The Cantor Space as a Generic Model of Topologically Presented Knowledge. 169-180 - Juraj Hromkovic:
Algorithmics - Is There Hope for a Unified Theory? 181-194 - Ling-Ju Hung, Ton Kloks:
Classifying Rankwidth k-DH-Graphs. 195-203 - Dmitry Itsykson:
Lower Bound on Average-Case Complexity of Inversion of Goldreich's Function by Drunken Backtracking Algorithms. 204-215 - Gerold Jäger, Weixiong Zhang:
A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem. 216-227 - Maurice J. Jansen, Jayalal Sarma:
Balancing Bounded Treewidth Circuits. 228-239 - Matthew Johnson, Viresh Patel, Daniël Paulusma, Théophile Trunck:
Obtaining Online Ecological Colourings by Generalizing First-Fit. 240-251 - Richard Jozsa:
Classical Simulation and Complexity of Quantum Computations. 252-258 - Elena Kalinina:
Prefix-Free and Prefix-Correct Complexities with Compound Conditions. 259-265 - Pavel Karpovich:
Monotone Complexity of a Pair. 266-275 - Vladimir N. Krupski:
Symbolic Models for Single-Conclusion Proof Logics. 276-287 - Pavel V. Martyugin:
Complexity of Problems Concerning Carefully Synchronizing Words for PFA and Directing Words for NFA. 288-302 - Victor Y. Pan, Guoliang Qian, Ailong Zheng:
Advancing Matrix Computations with Randomized Preprocessing. 303-314 - Valery Plisko:
Transfinite Sequences of Constructive Predicate Logics. 315-326 - Prabhakar Raghavan:
The Quantitative Analysis of User Behavior Online - Data, Models and Algorithms. 327 - Daniel Binkele-Raible, Henning Fernau:
A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem. 328-339 - Alexander A. Razborov:
Complexity of Propositional Proofs. 340-342 - Miklos Santha:
Quantization of Random Walks: Search Algorithms and Hitting Time. 343 - Uwe Schöning:
Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems. 344-349 - Arseny M. Shur:
Growth of Power-Free Languages over Large Alphabets. 350-361 - Avraham Trakhtman:
A Partially Synchronizing Coloring. 362-370 - Nikolay K. Vereshchagin:
An Encoding Invariant Version of Polynomial Time Computable Distributions. 371-383 - Junhua Yu:
Prehistoric Phenomena and Self-referentiality. 384-396
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-12-09 23:22 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:
