researchr
explore
Tags
Journals
Conferences
Authors
Profiles
Groups
calendar
New Conferences
Events
Deadlines
search
search
You are not signed in
Sign in
Sign up
Links
Filter by Year
OR
AND
NOT
1
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
Filter by Tag
[+]
OR
AND
NOT
1
algebra
C++
Kolmogorov complexity
Meta-Environment
analysis
classification
completeness
constraints
coverage
data-flow analysis
design
e-science
grammar
graph-rewriting
logic
meta-model
rewriting
rule-based
search
synchronization
Filter by Author
[+]
OR
AND
NOT
1
Abuzer Yakaryilmaz
Alexander Kozachinskiy
Alexander Okhotin
Alexey Milovanov
Arseny M. Shur
Barnaby Martin
Daniil Musatov
Daniël Paulusma
Dmitry Itsykson
Fahad Panolan
Galina Jirásková
Kristoffer Arnsfelt Hansen
Manfred Kufleitner
Markus Lohrey
Mikhail N. Vyalyi
Neeldhara Misra
Nikolay K. Vereshchagin
Petr A. Golovach
Saket Saurabh 0001
Venkatesh Raman 0001
Filter by Top terms
[+]
OR
AND
NOT
1
algorithm
algorithms
applications
automata
bounds
complexity
computer
csr
free
functions
graphs
languages
linear
lower
parameterized
problem
problems
set
theory
time
CSR (csr)
Editions
Publications
Viewing Publication 1 - 100 from 433
2022
Bounds for Synchronizing Markov Decision Processes
Laurent Doyen 0001
,
Marie van den Bogaard
.
csr 2022
:
133-151
[doi]
Parameterized Algorithms for Finding Highly Connected Solution
Ankit Abhinav
,
Susobhan Bandopadhyay
,
Aritra Banik
,
Saket Saurabh 0001
.
csr 2022
:
1-16
[doi]
Quotient Structures and Groups Computable in Polynomial Time
Pavel Alaev
.
csr 2022
:
35-45
[doi]
Parameterized Complexity of List Coloring and Max Coloring
Bardiya Aryanfard
,
Fahad Panolan
.
csr 2022
:
46-63
[doi]
Eternal Vertex Cover on Bipartite Graphs
Jasine Babu
,
Neeldhara Misra
,
Saraswati Nanoti
.
csr 2022
:
64-76
[doi]
Non-crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time
Lorenzo Balzotti
,
Paolo Giulio Franciosa
.
csr 2022
:
77-95
[doi]
Lossy Kernelization of Same-Size Clustering
Sayan Bandyapadhyay
,
Fedor V. Fomin
,
Petr A. Golovach
,
Nidhi Purohit
,
Kirill Siminov
.
csr 2022
:
96-114
[doi]
Output Sensitive Fault Tolerant Maximum Matching
Niranka Banerjee
,
Manoj Gupta
,
Venkatesh Raman 0001
,
Saket Saurabh 0001
.
csr 2022
:
115-132
[doi]
Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs
Petr A. Golovach
,
Fahad Panolan
,
Ashutosh Rai 0001
,
Saket Saurabh 0001
.
csr 2022
:
152-169
[doi]
Discrete Versions of the KKM Lemma and Their PPAD-Completeness
Alexander Grishutin
,
Daniil Musatov
.
csr 2022
:
170-189
[doi]
The Fast Algorithm for Online k-server Problem on Trees
Kamil Khadiev
,
Maxim Yagafarov
.
csr 2022
:
190-208
[doi]
Finite Ambiguity and Finite Sequentiality in Weighted Automata over Fields
Peter Kostolányi
.
csr 2022
:
209-223
[doi]
New Bounds for the Flock-of-Birds Problem
Alexander Kozachinskiy
.
csr 2022
:
224-237
[doi]
Computer Science - Theory and Applications - 17th International Computer Science Symposium in Russia, CSR 2022, Virtual Event, June 29 - July 1, 2022, Proceedings
Alexander S. Kulikov
,
Sofya Raskhodnikova
, editors,
Volume 13296 of
Lecture Notes in Computer Science
, Springer,
2022.
[doi]
Heterogeneous Multi-commodity Network Flows over Time
Yifen Li
,
Xiaohui Bei
,
Youming Qiao
,
Dacheng Tao
,
Zhiya Chen
.
csr 2022
:
238-255
[doi]
On the Determinization of Event-Clock Input-Driven Pushdown Automata
Mizuhito Ogawa
,
Alexander Okhotin
.
csr 2022
:
256-268
[doi]
The GKK Algorithm is the Fastest over Simple Mean-Payoff Games
Pierre Ohlmann
.
csr 2022
:
269-288
[doi]
Coloring a Dominating Set Without Conflicts: q-Subset Square Coloring
Abidha V. P
,
Pradeesha Ashok
,
Avi Tomar
,
Dolly Yadav
.
csr 2022
:
17-34
[doi]
Partial Vertex Cover on Graphs of Bounded Degeneracy
Fahad Panolan
,
Hannane Yaghoubizade
.
csr 2022
:
289-301
[doi]
Abelian Repetition Threshold Revisited
Elena A. Petrova
,
Arseny M. Shur
.
csr 2022
:
302-319
[doi]
Characterizing Level One in Group-Based Concatenation Hierarchies
Thomas Place
,
Marc Zeitoun
.
csr 2022
:
320-337
[doi]
How Much Randomness is Needed to Convert MA Protocols to AM Protocols?
Nikolai K. Vereshchagin
.
csr 2022
:
338-349
[doi]
2021
On the Computational Complexity of Reaction Systems, Revisited
Markus Holzer 0001
,
Christian Rauch
.
csr 2021
:
170-185
[doi]
Computational Complexity of Multi-player Evolutionarily Stable Strategies
Manon Blanc
,
Kristoffer Arnsfelt Hansen
.
csr 2021
:
1-17
[doi]
Injective Colouring for H-Free Graphs
Jan Bok
,
Nikola Jedlicková
,
Barnaby Martin
,
Daniël Paulusma
,
Siani Smith
.
csr 2021
:
18-30
[doi]
Variants of the Determinant Polynomial and the sf VP-Completeness
Prasad Chaugule
,
Nutan Limaye
,
Shourya Pandey
.
csr 2021
:
31-55
[doi]
Dynamic Complexity of Expansion
Samir Datta
,
Anuj Tawari
,
Yadu Vasudev
.
csr 2021
:
56-77
[doi]
Real τ-Conjecture for Sum-of-Squares: A Unified Approach to Lower Bound and Derandomization
Pranjal Dutta
.
csr 2021
:
78-101
[doi]
Dichotomy Result on 3-Regular Bipartite Non-negative Functions
Austen Z. Fan
,
Jin-yi Cai
.
csr 2021
:
102-115
[doi]
Approximation Schemes for Multiperiod Binary Knapsack Problems
Zuguang Gao
,
John R. Birge
,
Varun Gupta
.
csr 2021
:
131-146
[doi]
Limitations of Sums of Bounded Read Formulas and ABPs
Purnata Ghosal
,
B. V. Raghavendra Rao
.
csr 2021
:
147-169
[doi]
Upper Bounds on Communication in Terms of Approximate Rank
Anna Gál
,
Ridwan Syed
.
csr 2021
:
116-130
[doi]
Average-Case Rigidity Lower Bounds
Xuangui Huang
,
Emanuele Viola
.
csr 2021
:
186-205
[doi]
Analysis of an Efficient Reduction Algorithm for Random Regular Expressions Based on Universality Detection
Florent Koechlin
,
Pablo Rotondo
.
csr 2021
:
206-222
[doi]
Bit-Complexity of Solving Systems of Linear Evolutionary Partial Differential Equations
Ivan Koswara
,
Gleb Pogudin
,
Svetlana Selivanova
,
Martin Ziegler 0001
.
csr 2021
:
223-241
[doi]
A Secure Three-Input AND Protocol with a Standard Deck of Minimal Cards
Hiroto Koyama
,
Daiki Miyahara
,
Takaaki Mizuki
,
Hideaki Sone
.
csr 2021
:
242-256
[doi]
Upper Bound for Torus Polynomials
Vaibhav Krishan
.
csr 2021
:
257-263
[doi]
A PCP of Proximity for Real Algebraic Polynomials
Klaus Meer
.
csr 2021
:
264-282
[doi]
Predictions and Algorithmic Statistics for Infinite Sequences
Alexey Milovanov
.
csr 2021
:
283-295
[doi]
Lower Bounds and Hardness Magnification for Sublinear-Time Shrinking Cellular Automata
Augusto Modanese
.
csr 2021
:
296-320
[doi]
On Rooted k-Connectivity Problems in Quasi-bipartite Digraphs
Zeev Nutov
.
csr 2021
:
339-348
[doi]
Approximation Algorithms for Connectivity Augmentation Problems
Zeev Nutov
.
csr 2021
:
321-338
[doi]
Input-Driven Pushdown Automata on Well-Nested Infinite Strings
Alexander Okhotin
,
Victor L. Selivanov
.
csr 2021
:
349-360
[doi]
Large Clique is Hard on Average for Resolution
Shuo Pang
.
csr 2021
:
361-380
[doi]
On Closed-Rich Words
Olga Parshina
,
Svetlana Puzynina
.
csr 2021
:
381-394
[doi]
Shelah-Stupp's and Muchnik's Iterations Revisited
Pawel Parys
.
csr 2021
:
395-405
[doi]
On Separation Between the Degree of a Boolean Function and the Block Sensitivity
Nikolay V. Proskurin
.
csr 2021
:
406-421
[doi]
Computer Science - Theory and Applications - 16th International Computer Science Symposium in Russia, CSR 2021, Sochi, Russia, June 28 - July 2, 2021, Proceedings
Rahul Santhanam
,
Daniil Musatov
, editors,
Volume 12730 of
Lecture Notes in Computer Science
, Springer,
2021.
[doi]
Approximation and Complexity of the Capacitated Geometric Median Problem
Vladimir Shenmaier
.
csr 2021
:
422-434
[doi]
A Generic Convolution Algorithm for Join Operations on Tree Decompositions
Johan M. M. van Rooij
.
csr 2021
:
435-459
[doi]
A Generalization of a Theorem of Rothschild and van Lint
Ning Xie
,
Shuai Xu
,
Yekun Xu
.
csr 2021
:
460-483
[doi]
2020
Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations
Farid M. Ablayev
,
Marat Ablayev
,
Alexander Vasiliev
.
csr 2020
:
1-15
[doi]
Parameterized Analysis of Art Gallery and Terrain Guarding
Akanksha Agrawal
,
Meirav Zehavi
.
csr 2020
:
16-29
[doi]
Faster 2-Disjoint-Shortest-Paths Algorithm
Maxim Akhmedov
.
csr 2020
:
103-116
[doi]
An Improvement to Chvátal and Thomassen's Upper Bound for Oriented Diameter
Jasine Babu
,
Deepu Benson
,
Deepak Rajendraprasad
,
Sai Nishant Vaka
.
csr 2020
:
117-129
[doi]
The Normalized Algorithmic Information Distance Can Not Be Approximated
Bruno Bauwens
,
Ilya Blinnikov
.
csr 2020
:
130-141
[doi]
Definable Subsets of Polynomial-Time Algebraic Structures
Nikolay Bazhenov
.
csr 2020
:
142-154
[doi]
Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics
Olivier Bodini
,
Antoine Genitrini
,
Mehdi Naima
,
Alexandros Singh
.
csr 2020
:
155-168
[doi]
Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata
Iovka Boneva
,
Joachim Niehren
,
Momar Sakho
.
csr 2020
:
169-183
[doi]
Central Positions in Social Networks
Ulrik Brandes
.
csr 2020
:
30-45
[doi]
On the Decision Tree Complexity of Threshold Functions
Anastasiya Chistopolskaya
,
Vladimir V. Podolskii
.
csr 2020
:
198-210
[doi]
Randomized and Symmetric Catalytic Computation
Samir Datta
,
Chetan Gupta 0002
,
Rahul Jain 0015
,
Vimal Raj Sharma
,
Raghunath Tewari
.
csr 2020
:
211-223
[doi]
Second-Order Finite Automata
Alexsander Andrade de Melo
,
Mateus de Oliveira Oliveira
.
csr 2020
:
46-63
[doi]
Isomorphic Distances Among Elections
Piotr Faliszewski
,
Piotr Skowron
,
Arkadii Slinko
,
Stanislaw Szufa
,
Nimrod Talmon
.
csr 2020
:
64-78
[doi]
Computer Science - Theory and Applications - 15th International Computer Science Symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 - July 3, 2020, Proceedings
Henning Fernau
, editor,
Volume 12159 of
Lecture Notes in Computer Science
, Springer,
2020.
[doi]
On the Parameterized Complexity of the Expected Coverage Problem
Fedor V. Fomin
,
Vijayaragunathan Ramamoorthi
.
csr 2020
:
224-236
[doi]
Computational Hardness of Multidimensional Subtraction Games
Vladimir Gurvich
,
Mikhail N. Vyalyi
.
csr 2020
:
237-249
[doi]
Parameterized Complexity of Fair Feedback Vertex Set Problem
Lawqueen Kanesh
,
Soumen Maity
,
Komal Muluk
,
Saket Saurabh 0001
.
csr 2020
:
250-262
[doi]
The Power of Leibniz-Like Functions as Oracles
Jaeyoon Kim
,
Ilya Volkovich
,
Nelson Xuzhi Zhang
.
csr 2020
:
263-275
[doi]
Optimal Skeleton Huffman Trees Revisited
Dmitry Kosolobov
,
Oleg Merkurev
.
csr 2020
:
276-288
[doi]
The Subtrace Order and Counting First-Order Logic
Dietrich Kuske
.
csr 2020
:
289-302
[doi]
Speedable Left-c.e. Numbers
Wolfgang Merkle
,
Ivan Titov
.
csr 2020
:
303-313
[doi]
The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters
Marc Neveling
,
Jörg Rothe
,
Roman Zorn
.
csr 2020
:
314-327
[doi]
On the Transformation of LL(k)-linear Grammars to LL(1)-linear
Alexander Okhotin
,
Ilya Olkhovsky
.
csr 2020
:
328-340
[doi]
On Computing the Hamiltonian Index of Graphs
Geevarghese Philip
,
M. R. Rani
,
R. Subashini
.
csr 2020
:
341-353
[doi]
A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels
Tobias Rupp
,
Stefan Funke
.
csr 2020
:
354-366
[doi]
Kernelization of Arc Disjoint Cycle Packing in α-Bounded Digraphs
Abhishek Sahu
,
Saket Saurabh 0001
.
csr 2020
:
367-378
[doi]
On Subquadratic Derivational Complexity of Semi-Thue Systems
Alexey Talambutsa
.
csr 2020
:
379-392
[doi]
The Untold Story of SBP
Ilya Volkovich
.
csr 2020
:
393-405
[doi]
Weighted Rooted Trees: Fat or Tall?
Yaokun Wu
,
Yinfeng Zhu
.
csr 2020
:
406-418
[doi]
Groupoid Action and Rearrangement Problem of Bicolor Arrays by Prefix Reversals
Akihiro Yamamura
,
Riki Kase
,
Tatiana Baginová Jajcayová
.
csr 2020
:
419-431
[doi]
Tandem Duplications, Segmental Duplications and Deletions, and Their Applications
Binhai Zhu
.
csr 2020
:
79-102
[doi]
On Embeddability of Unit Disk Graphs onto Straight Lines
Onur Çagirici
.
csr 2020
:
184-197
[doi]
2019
Approximability and Inapproximability for Maximum k-Edge-Colored Clustering Problem
Yousef M. Alhamdan
,
Alexander Kononov
.
csr 2019
:
1-12
[doi]
Approximations of Schatten Norms via Taylor Expansions
Vladimir Braverman
.
csr 2019
:
70-79
[doi]
Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes
Bireswar Das
,
Shivdutt Sharma
.
csr 2019
:
80-92
[doi]
Eventually Dendric Shifts
Francesco Dolce
,
Dominique Perrin
.
csr 2019
:
106-118
[doi]
On Decidability of Regular Languages Theories
Sergey Dudakov
,
Boris Karlov
.
csr 2019
:
119-130
[doi]
Minimizing Branching Vertices in Distance-Preserving Subgraphs
Kshitij Gajjar
,
Jaikumar Radhakrishnan
.
csr 2019
:
131-142
[doi]
On Tseitin Formulas, Read-Once Branching Programs and Treewidth
Ludmila Glinskih
,
Dmitry Itsykson
.
csr 2019
:
143-155
[doi]
Matched Instances of Quantum Satisfiability (QSat) - Product State Solutions of Restrictions
Andreas Goerdt
.
csr 2019
:
156-167
[doi]
Notes on Resolution over Linear Equations
Svyatoslav Gryaznov
.
csr 2019
:
168-179
[doi]
Computational Complexity of Real Powering and Improved Solving Linear Differential Equations
Ivan Koswara
,
Svetlana Selivanova
,
Martin Ziegler 0001
.
csr 2019
:
215-227
[doi]
On the Quantum and Classical Complexity of Solving Subtraction Games
Dmitry Kravchenko
,
Kamil Khadiev
,
Danil Serov
.
csr 2019
:
228-236
[doi]
On the Complexity of Restarting
Jan-Hendrik Lorenz
.
csr 2019
:
250-261
[doi]
Uniform CSP Parameterized by Solution Size is in W[1]
Ruhollah Majdoddin
.
csr 2019
:
275-285
[doi]
The Parameterized Complexity of Dominating Set and Friends Revisited for Structured Graphs
Neeldhara Misra
,
Piyush Rathi
.
csr 2019
:
299-310
[doi]
Transition Property for Cube-Free Words
Elena A. Petrova
,
Arseny M. Shur
.
csr 2019
:
311-324
[doi]
A Polynomial Time Delta-Decomposition Algorithm for Positive DNFs
Denis K. Ponomaryov
.
csr 2019
:
325-336
[doi]
Computer Science - Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1-5, 2019, Proceedings
René van Bevern
,
Gregory Kucherov
, editors,
Volume 11532 of
Lecture Notes in Computer Science
, Springer,
2019.
[doi]
Sign in
or
sign up
to see more results.