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
2015Approximation and Exact Algorithms for Special Cases of Connected f-Factors.N. S. Narayanaswamy, C. S. Rahul
2015Some Properties of Antistochastic Strings.Alexey Milovanov
2015Representation of (Left) Ideal Regular Languages by Synchronizing Automata.Marina I. Maslennikova, Emanuele Rodaro
2015First-Order Logic Definability of Free Languages.Violetta Lonati, Dino Mandrioli, Federica Panella, Matteo Pradella
2015Making Randomness Public in Unbounded-Round Information Complexity.Alexander Kozachinskiy
2015Circuit Lower Bounds for Average-Case MA.Alexander Knop
2015Automath Type Inclusion in Barendregt's Cube.Fairouz Kamareddine, Joe B. Wells, Daniel Lima Ventura
2015Operations on Self-Verifying Finite Automata.Jozef Stefan Jirsek, Galina Jirskov, Alexander Szabari
2015Resolution Complexity of Perfect Matching Principles for Sparse Graphs.Dmitry Itsykson, Mikhail Slabodkin, Dmitry Sokolov
2015An In-Place Priority Queue with O(1) Time for Push and lg n + O ( 1 ) Comparisons for Pop.Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
2015A Logical Characterization of Timed Pushdown Languages.Manfred Droste, Vitaly Perevoshchikov
2015Equations over Free Inverse Monoids with Idempotent Variables.Volker Diekert, Florent Martin, Graud Snizergues, Pedro V. Silva
2015Editing to a Planar Graph of Given Degrees.Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Danil Paulusma, Dimitrios M. Thilikos
2015A Polynomial-Time Algorithm for Outerplanar Diameter Improvement.Nathann Cohen, Daniel Gonalves, Eunjung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller
2015On Growth and Fluctuation of k-Abelian Complexity.Julien Cassaigne, Juhani Karhumki, Aleksi Saarela
2015Satisfiability of ECTL* with Tree Constraints.Claudia Carapelle, Shiguang Feng, Alexander Kartzow, Markus Lohrey
2015Propositional Proofs in Frege and Extended Frege Systems (Abstract).Sam Buss
2015On Compiling Structured CNFs to OBDDs.Simone Bova, Friedrich Slivovsky
2015Interacting with Modal Logics in the Coq Proof Assistant.Christoph Benzmller, Bruno Woltzenlogel Paleo
2015Generalized LR Parsing for Grammars with Contexts.Mikhail Barash, Alexander Okhotin
2015A Combinatorial Algorithm for the Planar Multiflow Problem with Demands Located on Three Holes.Maxim A. Babenko, Alexander V. Karzanov
2015NEXP-Completeness and Universal Hardness Results for Justification Logic.Antonis Achilleos
2014Randomized Communication Complexity of Approximating Kolmogorov Complexity.Nikolay K. Vereshchagin
2014The Lattice of Definability. Origins, Recent Developments, and Further Directions.Alexei L. Semenov, Sergey Soprunov, Vladimir A. Uspensky
2014The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits.Konrad W. Schwerdtfeger
201225 of 571← PreviousNext →