Skip to content

International Computer Science Symposium in Russia

CSR

National

CORE rank

CORE rank (raw)

National: Russia

Fields of research

Information and Computing Sciences (general)

Papers indexed

571

2006–2022

Papers per year

200667 peak2022

CSR papers

571 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
2010Time OptimalNick Gravin
2010Identical Relations in Symmetric Groups and Separating Words with Reversible Automata.R. A. Gimadeev, Mikhail N. Vyalyi
2010Validating the Knuth-Morris-Pratt Failure Function, Fast and Online.Pawel Gawrychowski, Artur Jez, Lukasz Jez
2010Frameworks for Logically Classifying Polynomial-Time Optimisation Problems.James Gate, Iain A. Stewart
2010Zigzags in Turing Machines.Anah Gajardo, Pierre Guillon
2010Kernelization.Fedor V. Fomin
2010Right-Sequential Functions on Infinite Words.Olivier Carton
2010Quotient Complexity of Closed Languages.Janusz A. Brzozowski, Galina Jirskov, Chenglong Zou
2010Equilibria in Quantitative Reachability Games.Thomas Brihaye, Vronique Bruyre, Julie De Pril
2010The max quasi-independent set Problem.Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos, O. Potti
2010Realizability of Dynamic MSC Languages.Benedikt Bollig, Loc Hlout
2010A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem.Daniel Binkele-Raible, Henning Fernau
2010Approximating the Minimum Length of Synchronizing Words Is Hard.Mikhail V. Berlinkov
2010Proof-Based Design of Security Protocols.Nazim Benassa, Dominique Mry
2010Sofic and Almost of Finite Type Tree-Shifts.Nathalie Aubrun, Marie-Pierre Bal
2010Algorithms for Energy Management.Susanne Albers
2009Automatic Verification of Heap-Manipulating Programs Using Separation Logic.Hongseok Yang
2009Languages Recognized with Unbounded Error by Quantum Finite Automata.Abuzer Yakaryilmaz, A. C. Cem Say
2009New Plain-Exponential Time Classes for Graph Homomorphism.Magnus Wahlstrm
2009On Models of a Nondeterministic Computation.Mikhail N. Vyalyi
2009Kolmogorov Complexity and Model Selection.Nikolay K. Vereshchagin
2009The Reachability Problem over Infinite Graphs.Wolfgang Thomas
2009On the Complexity of Matroid Isomorphism Problems.B. V. Raghavendra Rao, Jayalal Sarma
2009Aperiodicity Measure for Infinite Sequences.Yuri Pritykin, Julya Ulyashkina
2009An Optimal Bloom Filter Replacement Based on Matrix Solving.Ely Porat
376400 of 571← PreviousNext →