default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCSR 2021: Sochi, Russia
- Rahul Santhanam, Daniil Musatov
:
Computer Science - Theory and Applications - 16th International Computer Science Symposium in Russia, CSR 2021, Sochi, Russia, June 28 - July 2, 2021, Proceedings. Lecture Notes in Computer Science 12730, Springer 2021, ISBN 978-3-030-79415-6 - Manon Blanc, Kristoffer Arnsfelt Hansen:
Computational Complexity of Multi-player Evolutionarily Stable Strategies. 1-17 - Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith:
Injective Colouring for H-Free Graphs. 18-30 - Prasad Chaugule, Nutan Limaye, Shourya Pandey:
Variants of the Determinant Polynomial and the VP-Completeness. 31-55 - Samir Datta, Anuj Tawari, Yadu Vasudev:
Dynamic Complexity of Expansion. 56-77 - Pranjal Dutta:
Real τ-Conjecture for Sum-of-Squares: A Unified Approach to Lower Bound and Derandomization. 78-101 - Austen Z. Fan, Jin-Yi Cai:
Dichotomy Result on 3-Regular Bipartite Non-negative Functions. 102-115 - Anna Gál, Ridwan Syed:
Upper Bounds on Communication in Terms of Approximate Rank. 116-130 - Zuguang Gao, John R. Birge, Varun Gupta:
Approximation Schemes for Multiperiod Binary Knapsack Problems. 131-146 - Purnata Ghosal, B. V. Raghavendra Rao:
Limitations of Sums of Bounded Read Formulas and ABPs. 147-169 - Markus Holzer, Christian Rauch:
On the Computational Complexity of Reaction Systems, Revisited. 170-185 - Xuangui Huang, Emanuele Viola:
Average-Case Rigidity Lower Bounds. 186-205 - Florent Koechlin, Pablo Rotondo:
Analysis of an Efficient Reduction Algorithm for Random Regular Expressions Based on Universality Detection. 206-222 - Ivan Koswara, Gleb Pogudin, Svetlana Selivanova, Martin Ziegler:
Bit-Complexity of Solving Systems of Linear Evolutionary Partial Differential Equations. 223-241 - Hiroto Koyama, Daiki Miyahara, Takaaki Mizuki, Hideaki Sone:
A Secure Three-Input AND Protocol with a Standard Deck of Minimal Cards. 242-256 - Vaibhav Krishan:
Upper Bound for Torus Polynomials. 257-263 - Klaus Meer:
A PCP of Proximity for Real Algebraic Polynomials. 264-282 - Alexey Milovanov:
Predictions and Algorithmic Statistics for Infinite Sequences. 283-295 - Augusto Modanese:
Lower Bounds and Hardness Magnification for Sublinear-Time Shrinking Cellular Automata. 296-320 - Zeev Nutov:
Approximation Algorithms for Connectivity Augmentation Problems. 321-338 - Zeev Nutov:
On Rooted k-Connectivity Problems in Quasi-bipartite Digraphs. 339-348 - Alexander Okhotin, Victor L. Selivanov:
Input-Driven Pushdown Automata on Well-Nested Infinite Strings. 349-360 - Shuo Pang:
Large Clique is Hard on Average for Resolution. 361-380 - Olga G. Parshina, Svetlana Puzynina:
On Closed-Rich Words. 381-394 - Pawel Parys:
Shelah-Stupp's and Muchnik's Iterations Revisited. 395-405 - Nikolay V. Proskurin:
On Separation Between the Degree of a Boolean Function and the Block Sensitivity. 406-421 - Vladimir Shenmaier:
Approximation and Complexity of the Capacitated Geometric Median Problem. 422-434 - Johan M. M. van Rooij:
A Generic Convolution Algorithm for Join Operations on Tree Decompositions. 435-459 - Ning Xie, Shuai Xu, Yekun Xu:
A Generalization of a Theorem of Rothschild and van Lint. 460-483
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-04-27 18:10 CEST 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:
