default search action
CSR 2020: Yekaterinburg, Russia
- Henning Fernau
:
Computer Science - Theory and Applications - 15th International Computer Science Symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 - July 3, 2020, Proceedings. Lecture Notes in Computer Science 12159, Springer 2020, ISBN 978-3-030-50025-2 - Farid M. Ablayev
Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations. 1-15 - Akanksha Agrawal, Meirav Zehavi:
Parameterized Analysis of Art Gallery and Terrain Guarding. 16-29 - Ulrik Brandes
Central Positions in Social Networks. 30-45 - Alexsander Andrade de Melo
Second-Order Finite Automata. 46-63 - Piotr Faliszewski
Isomorphic Distances Among Elections. 64-78 - Binhai Zhu:
Tandem Duplications, Segmental Duplications and Deletions, and Their Applications. 79-102 - Maxim Akhmedov
Faster 2-Disjoint-Shortest-Paths Algorithm. 103-116 - Jasine Babu, Deepu Benson, Deepak Rajendraprasad
An Improvement to Chvátal and Thomassen's Upper Bound for Oriented Diameter. 117-129 - Bruno Bauwens
The Normalized Algorithmic Information Distance Can Not Be Approximated. 130-141 - Nikolay Bazhenov
Definable Subsets of Polynomial-Time Algebraic Structures. 142-154 - Olivier Bodini, Antoine Genitrini, Mehdi Naima, Alexandros Singh:
Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics. 155-168 - Iovka Boneva
Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata. 169-183 - Onur Çagirici:
On Embeddability of Unit Disk Graphs onto Straight Lines. 184-197 - Anastasiya Chistopolskaya, Vladimir V. Podolskii
On the Decision Tree Complexity of Threshold Functions. 198-210 - Samir Datta
Randomized and Symmetric Catalytic Computation. 211-223 - Fedor V. Fomin
On the Parameterized Complexity of the Expected Coverage Problem. 224-236 - Vladimir Gurvich, Mikhail N. Vyalyi
Computational Hardness of Multidimensional Subtraction Games. 237-249 - Lawqueen Kanesh, Soumen Maity, Komal Muluk
Parameterized Complexity of Fair Feedback Vertex Set Problem. 250-262 - Jaeyoon Kim, Ilya Volkovich
The Power of Leibniz-Like Functions as Oracles. 263-275 - Dmitry Kosolobov, Oleg Merkurev:
Optimal Skeleton Huffman Trees Revisited. 276-288 - Dietrich Kuske:
The Subtrace Order and Counting First-Order Logic. 289-302 - Wolfgang Merkle, Ivan Titov:
Speedable Left-c.e. Numbers. 303-313 - Marc Neveling, Jörg Rothe, Roman Zorn:
The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters. 314-327 - Alexander Okhotin
On the Transformation of LL(k)-linear Grammars to LL(1)-linear. 328-340 - Geevarghese Philip
On Computing the Hamiltonian Index of Graphs. 341-353 - Tobias Rupp, Stefan Funke:
A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels. 354-366 - Abhishek Sahu, Saket Saurabh:
Kernelization of Arc Disjoint Cycle Packing in α-Bounded Digraphs. 367-378 - Alexey L. Talambutsa
On Subquadratic Derivational Complexity of Semi-Thue Systems. 379-392 - Ilya Volkovich
The Untold Story of SBP. 393-405 - Yaokun Wu
Weighted Rooted Trees: Fat or Tall? 406-418 - Akihiro Yamamura
Groupoid Action and Rearrangement Problem of Bicolor Arrays by Prefix Reversals. 419-431
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 2024-12-19 22:20 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: